diff --git a/.gitignore b/.gitignore
deleted file mode 100644
index 0053193..0000000
--- a/.gitignore
+++ /dev/null
@@ -1,222 +0,0 @@
-#################
-## IntelliJIdea
-#################
-
-.idea
-
-#################
-## Eclipse
-#################
-
-*.pydevproject
-.project
-.metadata
-bin/
-tmp/
-*.tmp
-*.bak
-*.swp
-*~.nib
-local.properties
-.classpath
-.settings/
-.loadpath
-
-# External tool builders
-.externalToolBuilders/
-
-# Locally stored "Eclipse launch configurations"
-*.launch
-
-# CDT-specific
-.cproject
-
-# PDT-specific
-.buildpath
-
-
-#################
-## Visual Studio
-#################
-
-## Ignore Visual Studio temporary files, build results, and
-## files generated by popular Visual Studio add-ons.
-
-# User-specific files
-*.suo
-*.user
-*.sln.docstates
-
-# Build results
-
-[Dd]ebug/
-[Rr]elease/
-x64/
-build/
-[Bb]in/
-[Oo]bj/
-
-# MSTest test Results
-[Tt]est[Rr]esult*/
-[Bb]uild[Ll]og.*
-
-*_i.c
-*_p.c
-*.ilk
-*.meta
-*.obj
-*.pch
-*.pdb
-*.pgc
-*.pgd
-*.rsp
-*.sbr
-*.tlb
-*.tli
-*.tlh
-*.tmp
-*.tmp_proj
-*.log
-*.vspscc
-*.vssscc
-.builds
-*.pidb
-*.log
-*.scc
-
-# Visual C++ cache files
-ipch/
-*.aps
-*.ncb
-*.opensdf
-*.sdf
-*.cachefile
-
-# Visual Studio profiler
-*.psess
-*.vsp
-*.vspx
-
-# Guidance Automation Toolkit
-*.gpState
-
-# ReSharper is a .NET coding add-in
-_ReSharper*/
-*.[Rr]e[Ss]harper
-
-# TeamCity is a build add-in
-_TeamCity*
-
-# DotCover is a Code Coverage Tool
-*.dotCover
-
-# NCrunch
-*.ncrunch*
-.*crunch*.local.xml
-
-# Installshield output folder
-[Ee]xpress/
-
-# DocProject is a documentation generator add-in
-DocProject/buildhelp/
-DocProject/Help/*.HxT
-DocProject/Help/*.HxC
-DocProject/Help/*.hhc
-DocProject/Help/*.hhk
-DocProject/Help/*.hhp
-DocProject/Help/Html2
-DocProject/Help/html
-
-# Click-Once directory
-publish/
-
-# Publish Web Output
-*.Publish.xml
-*.pubxml
-*.publishproj
-
-# NuGet Packages Directory
-## TODO: If you have NuGet Package Restore enabled, uncomment the next line
-#packages/
-
-# Windows Azure Build Output
-csx
-*.build.csdef
-
-# Windows Store app package directory
-AppPackages/
-
-# Others
-sql/
-*.Cache
-ClientBin/
-[Ss]tyle[Cc]op.*
-~$*
-*~
-*.dbmdl
-*.[Pp]ublish.xml
-*.pfx
-*.publishsettings
-
-# RIA/Silverlight projects
-Generated_Code/
-
-# Backup & report files from converting an old project file to a newer
-# Visual Studio version. Backup files are not needed, because we have git ;-)
-_UpgradeReport_Files/
-Backup*/
-UpgradeLog*.XML
-UpgradeLog*.htm
-
-# SQL Server files
-App_Data/*.mdf
-App_Data/*.ldf
-
-#############
-## Windows detritus
-#############
-
-# Windows image file caches
-Thumbs.db
-ehthumbs.db
-
-# Folder config file
-Desktop.ini
-
-# Recycle Bin used on file shares
-$RECYCLE.BIN/
-
-# Mac crap
-.DS_Store
-
-
-#############
-## Python
-#############
-
-*.py[cod]
-
-# Packages
-*.egg
-*.egg-info
-dist/
-build/
-eggs/
-parts/
-var/
-sdist/
-develop-eggs/
-.installed.cfg
-
-# Installer logs
-pip-log.txt
-
-# Unit test / coverage reports
-.coverage
-.tox
-
-#Translations
-*.mo
-
-#Mr Developer
-.mr.developer.cfg
diff --git a/.gitignore_global b/.gitignore_global
deleted file mode 100644
index 723ef36..0000000
--- a/.gitignore_global
+++ /dev/null
@@ -1 +0,0 @@
-.idea
\ 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/LICENSE.md b/LICENSE.md
deleted file mode 100644
index 5c304d1..0000000
--- a/LICENSE.md
+++ /dev/null
@@ -1,201 +0,0 @@
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright {yyyy} {name of copyright owner}
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/README.md b/README.md
deleted file mode 100644
index 99199ef..0000000
--- a/README.md
+++ /dev/null
@@ -1,53 +0,0 @@
-[Data Structures](https://github.com/Bishop92/JavaScript-Data-Structures)
-=================
-**A library for data structures in JavaScript**
-
-DataStructures is a JavaScript library where you can find the most common data structures and also other data
-structures more advanced. Various method are also provided in order to manipulate data structures.
-
-This library implements the [iterator] (http://en.wikipedia.org/wiki/Iterator_pattern) pattern in order to hide
-the data structure that work for storing your data.
-
-Supported data structures
--------------------------
-- [Stack](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Stack)
-- [Queue](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Queue)
-- [Priority Queue](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Priority-Queue)
-- [Circular Buffer](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Circular-Buffer)
-- [Hash Table](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Hash-Table)
-- [Linked List](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Linked-List)
-- [Double Linked List](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Double-Linked-List)
-- [Binary search Tree](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Binary-search-tree)
-- [Red-Black Tree](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Red-Black-Tree)
-- [Red-Black Tree List](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Red-Black-Tree-List)
-- [B-Tree](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/B-Tree)
-- [Set](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Set)
-- [Trie](https://github.com/Bishop92/JavaScript-Data-Structures/wiki/Trie)
-
-How to use
-----------
-1. Download the minimized library [here](https://raw.githubusercontent.com/Bishop92/JavaScript-Data-Structures/master/DataStructuresMinimized.js) (right click and save as...);
-
-2. Include the file in your project;
-
-3. Start to use it as any other class.
-
-Example
-
-```JavaScript
-var listA = new DoubleLinkedList();
-var listB = new DoubleLinkedList();
-listA.fromArray([0, 1]);
-listB.fromArray([2, 3]);
-listA.join(listB);
-listA.toArray(); // [0, 1, 2, 3]
-```
-
-Documentation
--------------
-Follow this [link](https://github.com/Bishop92/JavaScript-Data-Structures/wiki) to read the full documentation.
-Follow this [link](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/index.html) to read the JSDoc.
-
-Support
--------
-Battistella Stefano, [stefano.battistella.92@gmail.com](mailto:stefano.battistella.92@gmail.com)
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/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/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/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/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/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/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/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/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/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/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/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/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/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/tester.html b/Tests/tester.html
deleted file mode 100644
index e79e53f..0000000
--- a/Tests/tester.html
+++ /dev/null
@@ -1,68 +0,0 @@
-<!DOCTYPE html>
-<html>
-<head>
-    <meta charset="utf-8">
-    <title>QUnit basic example</title>
-    <link rel="stylesheet" href="//code.jquery.com/qunit/qunit-1.17.1.css">
-</head>
-<body>
-<div id="qunit"></div>
-<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>
-
-<!--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>
-    QUnit.jUnitReport = function (report) {
-        console.log(report.xml);
-    };
-</script>
-
-</body>
-</html>
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/doc/files.html b/doc/files.html
deleted file mode 100644
index 87ba799..0000000
--- a/doc/files.html
+++ /dev/null
@@ -1,258 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-
-    <title>JsDoc Reference - File Index</title>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<div id="header">
-</div>
-
-<div id="index">
-    <div align="center"><a href="index.html">Class Index</a>
-        | <a href="files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="symbols/BTree.html">BTree</a></li>
-
-        <li><a href="symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="symbols/Queue.html">Queue</a></li>
-
-        <li><a href="symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="symbols/Set.html">Set</a></li>
-
-        <li><a href="symbols/Stack.html">Stack</a></li>
-
-        <li><a href="symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-</div>
-
-<div id="content">
-    <h1 class="classTitle">File Index</h1>
-
-
-    <div>
-        <h2><a href="symbols/src/C__DataStructures_DataStructures.js.html">C:\DataStructures\DataStructures.js</a></h2>
-
-        <dl>
-
-
-        </dl>
-    </div>
-    <hr/>
-
-
-</div>
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blankt">JsDoc Toolkit</a>
-    2.4.0 on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
\ No newline at end of file
diff --git a/doc/index.html b/doc/index.html
deleted file mode 100644
index ee62b1a..0000000
--- a/doc/index.html
+++ /dev/null
@@ -1,398 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-
-    <title>JsDoc Reference - Index</title>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<div id="header">
-</div>
-
-<div id="index">
-    <div align="center"><a href="index.html">Class Index</a>
-        | <a href="files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="symbols/BTree.html">BTree</a></li>
-
-        <li><a href="symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="symbols/Queue.html">Queue</a></li>
-
-        <li><a href="symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="symbols/Set.html">Set</a></li>
-
-        <li><a href="symbols/Stack.html">Stack</a></li>
-
-        <li><a href="symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-</div>
-
-<div id="content">
-    <h1 class="classTitle">Class Index</h1>
-
-
-    <div>
-        <h2><a href="symbols/_global_.html">_global_</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/Aggregate.html">Aggregate</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/BSTree.html">BSTree</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/BSTreeIterator.html">BSTreeIterator</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/BTree.html">BTree</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/BTreeIterator.html">BTreeIterator</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/CircularBuffer.html">CircularBuffer</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/CircularBufferIterator.html">CircularBufferIterator</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/DoubleLinkedList.html">DoubleLinkedList</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/HashTable.html">HashTable</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/Iterator.html">Iterator</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/LinkedList.html">LinkedList</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/LinkedListIterator.html">LinkedListIterator</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/PriorityQueue.html">PriorityQueue</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/Queue.html">Queue</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/QueueIterator.html">QueueIterator</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/RBTree.html">RBTree</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/RBTreeIterator.html">RBTreeIterator</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/RBTreeList.html">RBTreeList</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/RBTreeListIterator.html">RBTreeListIterator</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/Set.html">Set</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/Stack.html">Stack</a></h2>
-
-    </div>
-    <hr/>
-
-    <div>
-        <h2><a href="symbols/StackIterator.html">StackIterator</a></h2>
-
-    </div>
-    <hr/>
-
-
-</div>
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blankt">JsDoc Toolkit</a>
-    2.4.0 on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
\ No newline at end of file
diff --git a/doc/symbols/Aggregate.html b/doc/symbols/Aggregate.html
deleted file mode 100644
index e44f39c..0000000
--- a/doc/symbols/Aggregate.html
+++ /dev/null
@@ -1,381 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - Aggregate</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-    <!-- ============================== class title ============================ -->
-    <h1 class="classTitle">
-
-        Class Aggregate
-    </h1>
-
-    <!-- ============================== class summary ========================== -->
-    <p class="description">
-
-
-        <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-    </p>
-
-    <!-- ============================== constructor summary ==================== -->
-
-    <table class="summaryTable" cellspacing="0"
-           summary="A summary of the constructor documented in the class Aggregate.">
-        <caption>Class Summary</caption>
-        <thead>
-        <tr>
-            <th scope="col">Constructor Attributes</th>
-            <th scope="col">Constructor Name and Description</th>
-        </tr>
-        </thead>
-        <tbody>
-        <tr>
-            <td class="attributes">&nbsp;</td>
-            <td class="nameDescription">
-                <div class="fixedFont">
-                    <b><a href="../symbols/Aggregate.html#constructor">Aggregate</a></b>()
-                </div>
-                <div class="description">Interface for managing a generic data structure.</div>
-            </td>
-        </tr>
-        </tbody>
-    </table>
-
-
-    <!-- ============================== properties summary ===================== -->
-
-
-    <!-- ============================== methods summary ======================== -->
-
-
-    <table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class Aggregate.">
-        <caption>Method Summary</caption>
-        <thead>
-        <tr>
-            <th scope="col">Method Attributes</th>
-            <th scope="col">Method Name and Description</th>
-        </tr>
-        </thead>
-        <tbody>
-
-        <tr>
-            <td class="attributes">&nbsp;</td>
-            <td class="nameDescription">
-                <div class="fixedFont"><b><a href="../symbols/Aggregate.html#getIterator">getIterator</a></b>()
-                </div>
-                <div class="description">Returns the iterator relative to the aggregate.</div>
-            </td>
-        </tr>
-
-        </tbody>
-    </table>
-
-
-    <!-- ============================== events summary ======================== -->
-
-
-    <!-- ============================== constructor details ==================== -->
-
-    <div class="details"><a name="constructor"> </a>
-
-        <div class="sectionTitle">
-            Class Detail
-        </div>
-
-        <div class="fixedFont">
-            <b>Aggregate</b>()
-        </div>
-
-        <div class="description">
-            Interface for managing a generic data structure.
-
-        </div>
-
-
-    </div>
-
-
-    <!-- ============================== field details ========================== -->
-
-
-    <!-- ============================== method details ========================= -->
-
-    <div class="sectionTitle">
-        Method Detail
-    </div>
-
-    <a name="getIterator"> </a>
-
-    <div class="fixedFont">
-
-        <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-        <b>getIterator</b>()
-
-    </div>
-    <div class="description">
-        Returns the iterator relative to the aggregate.
-
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Returns:</dt>
-
-        <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-    </dl>
-
-
-    <!-- ============================== event details ========================= -->
-
-
-    <hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/BSTree.html b/doc/symbols/BSTree.html
deleted file mode 100644
index e4dc8d6..0000000
--- a/doc/symbols/BSTree.html
+++ /dev/null
@@ -1,756 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - BSTree</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class BSTree
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the constructor documented in the class BSTree.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BSTree.html#constructor">BSTree</a></b>()
-            </div>
-            <div class="description">Class for managing a binary search tree.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class BSTree.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BSTree.html#root">root</a></b>
-            </div>
-            <div class="description">The root of the tree.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class BSTree.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTree.html#deleteNode">deleteNode</a></b>(node)
-            </div>
-            <div class="description">Deletes the node from the tree.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTree.html#getIterator">getIterator</a></b>()
-            </div>
-            <div class="description">Returns the iterator relative to the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTree.html#insert">insert</a></b>(key, item)
-            </div>
-            <div class="description">Inserts the item relatives to the key value in the tree.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTree.html#maximum">maximum</a></b>(node)
-            </div>
-            <div class="description">Gets the item relatives to the maximum key stored in the tree.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTree.html#minimum">minimum</a></b>(node)
-            </div>
-            <div class="description">Gets the item relatives to the minimum key stored in the tree.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTree.html#predecessor">predecessor</a></b>(node)
-            </div>
-            <div class="description">Gets the node with the key previous to the param node key.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTree.html#search">search</a></b>(key, node)
-            </div>
-            <div class="description">Searches the item relatives to the key.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTree.html#successor">successor</a></b>(node)
-            </div>
-            <div class="description">Gets the node with the key next to the param node key.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>BSTree</b>()
-    </div>
-
-    <div class="description">
-        Class for managing a binary search tree.
-
-    </div>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="root"> </a>
-
-<div class="fixedFont">
-
-
-    <b>root</b>
-
-</div>
-<div class="description">
-    The root of the tree.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="deleteNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteNode</b>(node)
-
-</div>
-<div class="description">
-    Deletes the node from the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{BSNode} The node to delete.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getIterator"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-    <b>getIterator</b>()
-
-</div>
-<div class="description">
-    Returns the iterator relative to the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="insert"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>insert</b>(key, item)
-
-</div>
-<div class="description">
-    Inserts the item relatives to the key value in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to store.</dd>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to store.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="maximum"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{BSNode}</span>
-    <b>maximum</b>(node)
-
-</div>
-<div class="description">
-    Gets the item relatives to the maximum key stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>{Node} The node from which start the search.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{BSNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="minimum"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{BSNode}</span>
-    <b>minimum</b>(node)
-
-</div>
-<div class="description">
-    Gets the item relatives to the minimum key stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>{Node} The node from which start the search.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{BSNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="predecessor"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{BSNode}</span>
-    <b>predecessor</b>(node)
-
-</div>
-<div class="description">
-    Gets the node with the key previous to the param node key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{BSNode} The node of which search the predecessor.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{BSNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="search"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>search</b>(key, node)
-
-</div>
-<div class="description">
-    Searches the item relatives to the key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{Number} The key to find.</dd>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>{BSNode} The node from which start the search.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item found or undefined if there isn't the key in the tree.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="successor"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{BSNode}</span>
-    <b>successor</b>(node)
-
-</div>
-<div class="description">
-    Gets the node with the key next to the param node key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{BSNode} The node of which search the successor.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{BSNode}</span> The node found.</dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/BSTreeIterator.html b/doc/symbols/BSTreeIterator.html
deleted file mode 100644
index 9c851f7..0000000
--- a/doc/symbols/BSTreeIterator.html
+++ /dev/null
@@ -1,668 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - BSTreeIterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class BSTreeIterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class BSTreeIterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BSTreeIterator.html#constructor">BSTreeIterator</a></b>(aggregate)
-            </div>
-            <div class="description">Class that implements the iterator for a binary search tree.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class BSTreeIterator.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BSTreeIterator.html#aggregate">aggregate</a></b>
-            </div>
-            <div class="description">The aggregate relates to this iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BSTreeIterator.html#pointer">pointer</a></b>
-            </div>
-            <div class="description">The pointer to the position.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class BSTreeIterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTreeIterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTreeIterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTreeIterator.html#getNode">getNode</a></b>()
-            </div>
-            <div class="description">Returns the node stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTreeIterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTreeIterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTreeIterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BSTreeIterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>BSTreeIterator</b>(aggregate)
-    </div>
-
-    <div class="description">
-        Class that implements the iterator for a binary search tree.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>aggregate</b>
-
-        </dt>
-        <dd>{BSTree} The aggregate to scan.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="aggregate"> </a>
-
-<div class="fixedFont">
-
-
-    <b>aggregate</b>
-
-</div>
-<div class="description">
-    The aggregate relates to this iterator.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointer"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointer</b>
-
-</div>
-<div class="description">
-    The pointer to the position.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored or undefined if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{BSNode|null}</span>
-    <b>getNode</b>()
-
-</div>
-<div class="description">
-    Returns the node stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{BSNode|null}</span> The node stored or null if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/BTree.html b/doc/symbols/BTree.html
deleted file mode 100644
index 44d3cd5..0000000
--- a/doc/symbols/BTree.html
+++ /dev/null
@@ -1,1765 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - BTree</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class BTree
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the constructor documented in the class BTree.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BTree.html#constructor">BTree</a></b>(minimumDegree)
-            </div>
-            <div class="description">Class for managing a B-Tree.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class BTree.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BTree.html#root">root</a></b>
-            </div>
-            <div class="description">The root of the tree.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BTree.html#size">size</a></b>
-            </div>
-            <div class="description">The number of items stored in the tree.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BTree.html#t">t</a></b>
-            </div>
-            <div class="description">The minimum number of the keys of a node.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class BTree.">
-<caption>Method Summary</caption>
-<thead>
-<tr>
-    <th scope="col">Method Attributes</th>
-    <th scope="col">Method Name and Description</th>
-</tr>
-</thead>
-<tbody>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#allIndexesOf">allIndexesOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns all the position in which the item has been found in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#augmentChild">augmentChild</a></b>(node, index)
-        </div>
-        <div class="description">Augments the number of keys stored in the node preserving the order.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#clear">clear</a></b>()
-        </div>
-        <div class="description">Removes all the items stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#clone">clone</a></b>()
-        </div>
-        <div class="description">Clones the tree into a new tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#cloneDistinct">cloneDistinct</a></b>()
-        </div>
-        <div class="description">Clones the tree into a new tree without cloning duplicated items.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#contains">contains</a></b>(key, callback)
-        </div>
-        <div class="description">Checks if the tree contains the key.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#deleteKey">deleteKey</a></b>(key)
-        </div>
-        <div class="description">Deletes the key from the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#deleteMax">deleteMax</a></b>(node, index)
-        </div>
-        <div class="description">Deletes a node that have the maximum number of keys for node.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#deleteNonMin">deleteNonMin</a></b>(node, key)
-        </div>
-        <div class="description">Deletes a node that's a number of keys greater than the minimum for a node.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#execute">execute</a></b>(callback)
-        </div>
-        <div class="description">Executes the callback function for each item of the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#filter">filter</a></b>(callback)
-        </div>
-        <div class="description">Returns the items that satisfy the condition determined by the callback.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#fullContains">fullContains</a></b>(callback)
-        </div>
-        <div class="description">Checks if the tree contains a node that satisfy the condition represented by the
-            callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#getItem">getItem</a></b>(index)
-        </div>
-        <div class="description">Returns the item at the position index.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#getIterator">getIterator</a></b>()
-        </div>
-        <div class="description">Returns the iterator relative to the aggregate.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#getSize">getSize</a></b>()
-        </div>
-        <div class="description">Returns the size of the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#indexOf">indexOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns the first position of the item in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#insert">insert</a></b>(key, item)
-        </div>
-        <div class="description">Inserts the item relatives to the key value in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#insertNonFull">insertNonFull</a></b>(node, key, item)
-        </div>
-        <div class="description">Inserts the new node in the right position if the node is not full.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#isEmpty">isEmpty</a></b>()
-        </div>
-        <div class="description">Checks if the tree is empty.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#lastIndexOf">lastIndexOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns the last position of the item in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#maximum">maximum</a></b>()
-        </div>
-        <div class="description">Gets the item relatives to the maximum key stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#maximumKey">maximumKey</a></b>()
-        </div>
-        <div class="description">Gets the maximum key stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#minimum">minimum</a></b>()
-        </div>
-        <div class="description">Gets the item relatives to the minimum key stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#minimumKey">minimumKey</a></b>()
-        </div>
-        <div class="description">Gets the minimum key stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#predecessor">predecessor</a></b>(key, node)
-        </div>
-        <div class="description">Gets the key previous to the param key.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#search">search</a></b>(key, node, callback)
-        </div>
-        <div class="description">Searches the item relatives to the key that satisfy the condition represented by the
-            callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#splitChild">splitChild</a></b>(node, index)
-        </div>
-        <div class="description">Splits the child of the node at the position index.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#successor">successor</a></b>(key, node)
-        </div>
-        <div class="description">Gets the key next to the param node key.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/BTree.html#toArray">toArray</a></b>()
-        </div>
-        <div class="description">Transforms the tree into an array without preserving keys.</div>
-    </td>
-</tr>
-
-</tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>BTree</b>(minimumDegree)
-    </div>
-
-    <div class="description">
-        Class for managing a B-Tree.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>minimumDegree</b>
-
-        </dt>
-        <dd>{number} The minimum number of keys of a node.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="root"> </a>
-
-<div class="fixedFont">
-
-
-    <b>root</b>
-
-</div>
-<div class="description">
-    The root of the tree.
-
-
-</div>
-
-
-<hr/>
-
-<a name="size"> </a>
-
-<div class="fixedFont">
-
-
-    <b>size</b>
-
-</div>
-<div class="description">
-    The number of items stored in the tree.
-
-
-</div>
-
-
-<hr/>
-
-<a name="t"> </a>
-
-<div class="fixedFont">
-
-
-    <b>t</b>
-
-</div>
-<div class="description">
-    The minimum number of the keys of a node.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="allIndexesOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<number>}</span>
-    <b>allIndexesOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns all the position in which the item has been found in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<number>}</span> The positions in which the item has been found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="augmentChild"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>augmentChild</b>(node, index)
-
-</div>
-<div class="description">
-    Augments the number of keys stored in the node preserving the order.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{BNode} The node to delete.</dd>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The index of the position to augment.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clear"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>clear</b>()
-
-</div>
-<div class="description">
-    Removes all the items stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/BTree.html">BTree</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the tree into a new tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/BTree.html">BTree</a>}</span> The tree cloned from this tree.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="cloneDistinct"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/BTree.html">BTree</a>}</span>
-    <b>cloneDistinct</b>()
-
-</div>
-<div class="description">
-    Clones the tree into a new tree without cloning duplicated items.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/BTree.html">BTree</a>}</span> The tree cloned from this tree.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="contains"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>contains</b>(key, callback)
-
-</div>
-<div class="description">
-    Checks if the tree contains the key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to find.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(node,index){return(node.keys[index]===key);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current node to check and optionally the position of the
-        key.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the tree contains the key.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="deleteKey"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteKey</b>(key)
-
-</div>
-<div class="description">
-    Deletes the key from the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{*} The key to delete.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="deleteMax"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteMax</b>(node, index)
-
-</div>
-<div class="description">
-    Deletes a node that have the maximum number of keys for node.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{BNode} The node to delete.</dd>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The key to delete in the node.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="deleteNonMin"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteNonMin</b>(node, key)
-
-</div>
-<div class="description">
-    Deletes a node that's a number of keys greater than the minimum for a node.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{BNode} The node to delete.</dd>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to delete.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="execute"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>execute</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function to execute for each item. The function must accept the current item on which execute the
-        function.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="filter"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>filter</b>(callback)
-
-</div>
-<div class="description">
-    Returns the items that satisfy the condition determined by the callback.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function that implements the condition.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that contains the items that satisfy the condition.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="fullContains"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>fullContains</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The condition to satisfy. The callback must accept the current node to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the tree contains the node that satisfy the condition,
-        false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>(index)
-
-</div>
-<div class="description">
-    Returns the item at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the item.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the position. It's undefined if index isn't in the tree
-        bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getIterator"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-    <b>getIterator</b>()
-
-</div>
-<div class="description">
-    Returns the iterator relative to the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getSize"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>getSize</b>()
-
-</div>
-<div class="description">
-    Returns the size of the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The size of the tree.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="indexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>indexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the first position of the item in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The first position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="insert"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>insert</b>(key, item)
-
-</div>
-<div class="description">
-    Inserts the item relatives to the key value in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to store.</dd>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to store.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="insertNonFull"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>insertNonFull</b>(node, key, item)
-
-</div>
-<div class="description">
-    Inserts the new node in the right position if the node is not full.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{BNode} The node from which start to check the insertion.</dd>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to store.</dd>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to store.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Checks if the tree is empty.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the tree is empty, false otherwise.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="lastIndexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>lastIndexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the last position of the item in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The last position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="maximum"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{node}</span>
-    <b>maximum</b>()
-
-</div>
-<div class="description">
-    Gets the item relatives to the maximum key stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{node}</span> The item found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="maximumKey"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>maximumKey</b>()
-
-</div>
-<div class="description">
-    Gets the maximum key stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The key found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="minimum"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>minimum</b>()
-
-</div>
-<div class="description">
-    Gets the item relatives to the minimum key stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The item found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="minimumKey"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>minimumKey</b>()
-
-</div>
-<div class="description">
-    Gets the minimum key stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The key found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="predecessor"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>predecessor</b>(key, node)
-
-</div>
-<div class="description">
-    Gets the key previous to the param key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key of which search the predecessor.</dd>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>The node from start the search of the predecessor.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The key found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="search"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>search</b>(key, node, callback)
-
-</div>
-<div class="description">
-    Searches the item relatives to the key that satisfy the condition represented by the callback function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{Number} The key to find.</dd>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>{RBNode} The node from which start the search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(node,index){return(node.keys[index]===key);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current node to check and optionally the position of the
-        key.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item found or undefined if there isn't the key in the tree.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="splitChild"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>splitChild</b>(node, index)
-
-</div>
-<div class="description">
-    Splits the child of the node at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{BNode} The parent of the child to split.</dd>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the child to split.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="successor"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>successor</b>(key, node)
-
-</div>
-<div class="description">
-    Gets the key next to the param node key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key of which search the successor.</dd>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>The node from start the search of the successor.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The key found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="toArray"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>toArray</b>()
-
-</div>
-<div class="description">
-    Transforms the tree into an array without preserving keys.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that represents the tree.</dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/BTreeIterator.html b/doc/symbols/BTreeIterator.html
deleted file mode 100644
index b1846da..0000000
--- a/doc/symbols/BTreeIterator.html
+++ /dev/null
@@ -1,668 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - BTreeIterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class BTreeIterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class BTreeIterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BTreeIterator.html#constructor">BTreeIterator</a></b>(aggregate)
-            </div>
-            <div class="description">Class that implements the iterator for a binary search tree.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class BTreeIterator.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BTreeIterator.html#aggregate">aggregate</a></b>
-            </div>
-            <div class="description">The aggregate relates to this iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/BTreeIterator.html#pointer">pointer</a></b>
-            </div>
-            <div class="description">The pointer to the position.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class BTreeIterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BTreeIterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BTreeIterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BTreeIterator.html#getKey">getKey</a></b>()
-            </div>
-            <div class="description">Returns the key stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BTreeIterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BTreeIterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BTreeIterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/BTreeIterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>BTreeIterator</b>(aggregate)
-    </div>
-
-    <div class="description">
-        Class that implements the iterator for a binary search tree.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>aggregate</b>
-
-        </dt>
-        <dd>{BTree} The aggregate to scan.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="aggregate"> </a>
-
-<div class="fixedFont">
-
-
-    <b>aggregate</b>
-
-</div>
-<div class="description">
-    The aggregate relates to this iterator.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointer"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointer</b>
-
-</div>
-<div class="description">
-    The pointer to the position.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored or undefined if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getKey"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>getKey</b>()
-
-</div>
-<div class="description">
-    Returns the key stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The key stored or null if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/CircularBuffer.html b/doc/symbols/CircularBuffer.html
deleted file mode 100644
index 3e8651b..0000000
--- a/doc/symbols/CircularBuffer.html
+++ /dev/null
@@ -1,899 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - CircularBuffer</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class CircularBuffer
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class CircularBuffer.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBuffer.html#constructor">CircularBuffer</a></b>(size)
-            </div>
-            <div class="description">Class for managing a circular buffer.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class CircularBuffer.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBuffer.html#empty">empty</a></b>
-            </div>
-            <div class="description">Is true if buffer is empty, false otherwise.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBuffer.html#full">full</a></b>
-            </div>
-            <div class="description">Is true if buffer is full, false otherwise.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBuffer.html#head">head</a></b>
-            </div>
-            <div class="description">The index of the position of the head of the buffer.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBuffer.html#items">items</a></b>
-            </div>
-            <div class="description">The items stored in the buffer.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBuffer.html#size">size</a></b>
-            </div>
-            <div class="description">The size of the buffer.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBuffer.html#tail">tail</a></b>
-            </div>
-            <div class="description">The index of the position of the tail of the buffer.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class CircularBuffer.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBuffer.html#clone">clone</a></b>()
-            </div>
-            <div class="description">Clones the circular buffer into a new circular buffer.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBuffer.html#free">free</a></b>(from, to)
-            </div>
-            <div class="description">Frees the buffer between indexes from and to.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBuffer.html#freeAll">freeAll</a></b>()
-            </div>
-            <div class="description">Frees all the buffer.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBuffer.html#getIterator">getIterator</a></b>()
-            </div>
-            <div class="description">Returns the iterator relative to the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBuffer.html#isEmpty">isEmpty</a></b>()
-            </div>
-            <div class="description">Returns true if the buffer is empty, false otherwise.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBuffer.html#isFull">isFull</a></b>()
-            </div>
-            <div class="description">Returns true if the buffer is full, false otherwise.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBuffer.html#read">read</a></b>(index)
-            </div>
-            <div class="description">Reads the item stored at the position index.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBuffer.html#resize">resize</a></b>(size)
-            </div>
-            <div class="description">Resize the buffer.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBuffer.html#write">write</a></b>(item)
-            </div>
-            <div class="description">Writes the item at the head of the buffer.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>CircularBuffer</b>(size)
-    </div>
-
-    <div class="description">
-        Class for managing a circular buffer.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>size</b>
-
-        </dt>
-        <dd>{Number} The size of the buffer.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="empty"> </a>
-
-<div class="fixedFont">
-
-
-    <b>empty</b>
-
-</div>
-<div class="description">
-    Is true if buffer is empty, false otherwise.
-
-
-</div>
-
-
-<hr/>
-
-<a name="full"> </a>
-
-<div class="fixedFont">
-
-
-    <b>full</b>
-
-</div>
-<div class="description">
-    Is false if buffer is full, false otherwise.
-
-
-</div>
-
-
-<hr/>
-
-<a name="head"> </a>
-
-<div class="fixedFont">
-
-
-    <b>head</b>
-
-</div>
-<div class="description">
-    The index of the position of the head of the buffer.
-
-
-</div>
-
-
-<hr/>
-
-<a name="items"> </a>
-
-<div class="fixedFont">
-
-
-    <b>items</b>
-
-</div>
-<div class="description">
-    The items stored in the buffer.
-
-
-</div>
-
-
-<hr/>
-
-<a name="size"> </a>
-
-<div class="fixedFont">
-
-
-    <b>size</b>
-
-</div>
-<div class="description">
-    The size of the buffer.
-
-
-</div>
-
-
-<hr/>
-
-<a name="tail"> </a>
-
-<div class="fixedFont">
-
-
-    <b>tail</b>
-
-</div>
-<div class="description">
-    The index of the position of the tail of the buffer.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/CircularBuffer.html">CircularBuffer</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the circular buffer into a new circular buffer.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/CircularBuffer.html">CircularBuffer</a>}</span> The circular
-        buffer cloned from this circular buffer.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="free"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>free</b>(from, to)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>from</b>
-
-    </dt>
-    <dd>{Number} The index from which start to free (inclusive index)</dd>
-
-    <dt>
-        <b>to</b>
-
-    </dt>
-    <dd>{Number} The index where stop to free (exclusive index)</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="freeAll"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>freeAll</b>()
-
-</div>
-<div class="description">
-    Frees all the buffer.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getIterator"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-    <b>getIterator</b>()
-
-</div>
-<div class="description">
-    Returns the iterator relative to the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Returns true if the buffer is empty, false otherwise.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isFull"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isFull</b>()
-
-</div>
-<div class="description">
-    Returns true if the buffer is full, false otherwise.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="read"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>read</b>(index)
-
-</div>
-<div class="description">
-    Reads the item stored at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{Number} The position of the item to read.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item read.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="resize"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>resize</b>(size)
-
-</div>
-<div class="description">
-    Resize the buffer.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>size</b>
-
-    </dt>
-    <dd>{number} The new size of the buffer.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="write"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>write</b>(item)
-
-</div>
-<div class="description">
-    Writes the item at the head of the buffer.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to write.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/CircularBufferIterator.html b/doc/symbols/CircularBufferIterator.html
deleted file mode 100644
index 7f74a48..0000000
--- a/doc/symbols/CircularBufferIterator.html
+++ /dev/null
@@ -1,663 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - CircularBufferIterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class CircularBufferIterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class CircularBufferIterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBufferIterator.html#constructor">CircularBufferIterator</a></b>(aggregate)
-            </div>
-            <div class="description">Class that implements the iterator for a circular buffer.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the fields documented in the class CircularBufferIterator.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBufferIterator.html#aggregate">aggregate</a></b>
-            </div>
-            <div class="description">The aggregate relates to this iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBufferIterator.html#pointer">pointer</a></b>
-            </div>
-            <div class="description">The pointer to the position.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/CircularBufferIterator.html#start">start</a></b>
-            </div>
-            <div class="description">Discriminator for full buffer</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the methods documented in the class CircularBufferIterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBufferIterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBufferIterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBufferIterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBufferIterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBufferIterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/CircularBufferIterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>CircularBufferIterator</b>(aggregate)
-    </div>
-
-    <div class="description">
-        Class that implements the iterator for a circular buffer.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>aggregate</b>
-
-        </dt>
-        <dd>{CircularBuffer} The aggregate to scan.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="aggregate"> </a>
-
-<div class="fixedFont">
-
-
-    <b>aggregate</b>
-
-</div>
-<div class="description">
-    The aggregate relates to this iterator.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointer"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointer</b>
-
-</div>
-<div class="description">
-    The pointer to the position.
-
-
-</div>
-
-
-<hr/>
-
-<a name="start"> </a>
-
-<div class="fixedFont">
-
-
-    <b>start</b>
-
-</div>
-<div class="description">
-    Discriminator for full buffer
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored or undefined if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/DoubleLinkedList.html b/doc/symbols/DoubleLinkedList.html
deleted file mode 100644
index aa065ca..0000000
--- a/doc/symbols/DoubleLinkedList.html
+++ /dev/null
@@ -1,2104 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - DoubleLinkedList</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class DoubleLinkedList
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class DoubleLinkedList.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/DoubleLinkedList.html#constructor">DoubleLinkedList</a></b>(args)
-            </div>
-            <div class="description">Class for managing a double linked list.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class DoubleLinkedList.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/DoubleLinkedList.html#first">first</a></b>
-            </div>
-            <div class="description">The first node of the list.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/DoubleLinkedList.html#last">last</a></b>
-            </div>
-            <div class="description">The last node of the list.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/DoubleLinkedList.html#length">length</a></b>
-            </div>
-            <div class="description">The length of the list.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the methods documented in the class DoubleLinkedList.">
-<caption>Method Summary</caption>
-<thead>
-<tr>
-    <th scope="col">Method Attributes</th>
-    <th scope="col">Method Name and Description</th>
-</tr>
-</thead>
-<tbody>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#addAt">addAt</a></b>(item, index)
-        </div>
-        <div class="description">Adds the item at the index position.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#allIndexesOf">allIndexesOf</a></b>(item,
-            callback)
-        </div>
-        <div class="description">Returns all the position in which the item has been found in the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#clear">clear</a></b>()
-        </div>
-        <div class="description">Removes all the items stored in the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#clone">clone</a></b>()
-        </div>
-        <div class="description">Clones the list into a new list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#cloneDistinct">cloneDistinct</a></b>()
-        </div>
-        <div class="description">Clones the list into a new list without cloning duplicated items.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#contains">contains</a></b>(item, callback)
-        </div>
-        <div class="description">Checks if the list contains an item that satisfy the condition represented by the
-            callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#count">count</a></b>(callback)
-        </div>
-        <div class="description">Returns the number of items that satisfy the represented by the callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#deleteNode">deleteNode</a></b>(node)
-        </div>
-        <div class="description">Deletes the node from the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#divide">divide</a></b>(index)
-        </div>
-        <div class="description">Divides the list at the index position.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#execute">execute</a></b>(callback)
-        </div>
-        <div class="description">Executes the callback function for each item of the stack.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#filter">filter</a></b>(callback)
-        </div>
-        <div class="description">Returns the items that satisfy the condition determined by the callback.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#fromArray">fromArray</a></b>(array)
-        </div>
-        <div class="description">Builds the list from the array.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#getItem">getItem</a></b>(index)
-        </div>
-        <div class="description">Gets the item at the position index.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#getIterator">getIterator</a></b>()
-        </div>
-        <div class="description">Returns the iterator relative to the aggregate.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#getLength">getLength</a></b>()
-        </div>
-        <div class="description">Returns the length of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#getNode">getNode</a></b>(index, node)
-        </div>
-        <div class="description">Gets the node at the position index relative from the node.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#indexOf">indexOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns the first position of the item in the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#isEmpty">isEmpty</a></b>()
-        </div>
-        <div class="description">Checks if the list is empty.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#join">join</a></b>(list)
-        </div>
-        <div class="description">Adds the list at the end of this list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#lastIndexOf">lastIndexOf</a></b>(item,
-            callback)
-        </div>
-        <div class="description">Returns the last position of the item in the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#modifyAt">modifyAt</a></b>(index, item)
-        </div>
-        <div class="description">Changes the item stored in the index position.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#multiPopBack">multiPopBack</a></b>(times)
-        </div>
-        <div class="description">Removes the last times items of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#multiPopFront">multiPopFront</a></b>(times)
-        </div>
-        <div class="description">Removes the first times items of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#parallelSort">parallelSort</a></b>()
-        </div>
-        <div class="description">Sorts the list using web workers.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#peek">peek</a></b>()
-        </div>
-        <div class="description">Returns the first item of the list without remove it.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#popBack">popBack</a></b>()
-        </div>
-        <div class="description">Removes the last item of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#popFront">popFront</a></b>()
-        </div>
-        <div class="description">Removes the first item of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#pushBack">pushBack</a></b>(item)
-        </div>
-        <div class="description">Adds an item at the tail of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#pushFront">pushFront</a></b>(item)
-        </div>
-        <div class="description">Adds an item at the head of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#remove">remove</a></b>(item, callback)
-        </div>
-        <div class="description">Removes the item from the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#removeAll">removeAll</a></b>(item, callback)
-        </div>
-        <div class="description">Removes all the item from the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#removeAt">removeAt</a></b>(index)
-        </div>
-        <div class="description">Removes the item at the position index.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#removeSegment">removeSegment</a></b>(from,
-            to)
-        </div>
-        <div class="description">Removes all the items stored from the from position to the to position.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#reverse">reverse</a></b>()
-        </div>
-        <div class="description">Reverses the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#sort">sort</a></b>(callback)
-        </div>
-        <div class="description">Sorts the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#split">split</a></b>(size)
-        </div>
-        <div class="description">Splits the list into lists of desired size.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/DoubleLinkedList.html#toArray">toArray</a></b>()
-        </div>
-        <div class="description">Transforms the list into an array.</div>
-    </td>
-</tr>
-
-</tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>DoubleLinkedList</b>(args)
-    </div>
-
-    <div class="description">
-        Class for managing a double linked list.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <span class="light fixedFont">{...*}</span> <b>args</b>
-            <i>Optional</i>
-        </dt>
-        <dd>The items for initializing the list.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-
-    <b>first</b>
-
-</div>
-<div class="description">
-    The first node of the list.
-
-
-</div>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-
-    <b>last</b>
-
-</div>
-<div class="description">
-    The last node of the list.
-
-
-</div>
-
-
-<hr/>
-
-<a name="length"> </a>
-
-<div class="fixedFont">
-
-
-    <b>length</b>
-
-</div>
-<div class="description">
-    The length of the list.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="addAt"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>addAt</b>(item, index)
-
-</div>
-<div class="description">
-    Adds the item at the index position.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to add.</dd>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position where to add the item. If index is negative, the item won't be added.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="allIndexesOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<number>}</span>
-    <b>allIndexesOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns all the position in which the item has been found in the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<number>}</span> The positions in which the item has been found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clear"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>clear</b>()
-
-</div>
-<div class="description">
-    Removes all the items stored in the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the list into a new list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a>}</span> The list
-        cloned from this list.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="cloneDistinct"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a>}</span>
-    <b>cloneDistinct</b>()
-
-</div>
-<div class="description">
-    Clones the list into a new list without cloning duplicated items.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a>}</span> The list
-        cloned from this list.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="contains"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>contains</b>(item, callback)
-
-</div>
-<div class="description">
-    Checks if the list contains an item that satisfy the condition represented by the callback function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to find.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the list contains the item that satisfy the condition,
-        false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="count"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>count</b>(callback)
-
-</div>
-<div class="description">
-    Returns the number of items that satisfy the represented by the callback function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The condition to satisfy.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The number of items that satisfy the condition.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="deleteNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteNode</b>(node)
-
-</div>
-<div class="description">
-    Deletes the node from the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{DLLNode} The node to delete.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="divide"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a>}</span>
-    <b>divide</b>(index)
-
-</div>
-<div class="description">
-    Divides the list at the index position. The node at the index position is the first new node of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position where to divide the list.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a>}</span> The list
-        formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="execute"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>execute</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function to execute for each item. The function must accept the current item on which execute the
-        function.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="filter"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<Object>}</span>
-    <b>filter</b>(callback)
-
-</div>
-<div class="description">
-    Returns the items that satisfy the condition determined by the callback.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function that implements the condition.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<Object>}</span> The array that contains the items that satisfy the
-        condition.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="fromArray"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>fromArray</b>(array)
-
-</div>
-<div class="description">
-    Builds the list from the array.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>array</b>
-
-    </dt>
-    <dd>{Array<*>} The array from which build the list.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>(index)
-
-</div>
-<div class="description">
-    Gets the item at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{Number} The position of the item.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> . It's undefined if index isn't in the queue bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getIterator"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-    <b>getIterator</b>()
-
-</div>
-<div class="description">
-    Returns the iterator relative to the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getLength"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Number}</span>
-    <b>getLength</b>()
-
-</div>
-<div class="description">
-    Returns the length of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Number}</span> The length of the list.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{DLLNode}</span>
-    <b>getNode</b>(index, node)
-
-</div>
-<div class="description">
-    Gets the node at the position index relative from the node.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{Number} The index, relative to the node, of the node to return.</dd>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: first</i>
-    </dt>
-    <dd>{DLLNode} The node from which start the search.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{DLLNode}</span> The node at the position index.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="indexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>indexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the first position of the item in the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The first position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Checks if the list is empty.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the list is empty, false otherwise.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="join"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>join</b>(list)
-
-</div>
-<div class="description">
-    Adds the list at the end of this list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>list</b>
-
-    </dt>
-    <dd>{DoubleLinkedList} The list to join.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="lastIndexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>lastIndexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the last position of the item in the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The last position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="modifyAt"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>modifyAt</b>(index, item)
-
-</div>
-<div class="description">
-    Changes the item stored in the index position. If the index is out of bound, the node won't be updated.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the node to modify.</dd>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The new item stored in the node.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiPopBack"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>multiPopBack</b>(times)
-
-</div>
-<div class="description">
-    Removes the last times items of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>times</b>
-
-    </dt>
-    <dd>{number} The number of times to repeat the popBack method.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The items removed.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiPopFront"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>multiPopFront</b>(times)
-
-</div>
-<div class="description">
-    Removes the first times items of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>times</b>
-
-    </dt>
-    <dd>{number} The number of times to repeat the popFront method.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item removed. It's undefined if the list is empty.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="parallelSort"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>parallelSort</b>()
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="peek"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>peek</b>()
-
-</div>
-<div class="description">
-    Returns the first item of the list without remove it.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the top of the list. It's undefined if the list is empty.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="popBack"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>popBack</b>()
-
-</div>
-<div class="description">
-    Removes the last item of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item removed. It's undefined if the list is empty.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="popFront"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>popFront</b>()
-
-</div>
-<div class="description">
-    Removes the first item of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item removed. It's undefined if the list is empty.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="pushBack"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>pushBack</b>(item)
-
-</div>
-<div class="description">
-    Adds an item at the tail of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to add.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="pushFront"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>pushFront</b>(item)
-
-</div>
-<div class="description">
-    Adds an item at the head of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to add.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="remove"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>remove</b>(item, callback)
-
-</div>
-<div class="description">
-    Removes the item from the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to remove.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="removeAll"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>removeAll</b>(item, callback)
-
-</div>
-<div class="description">
-    Removes all the item from the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to remove.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="removeAt"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>removeAt</b>(index)
-
-</div>
-<div class="description">
-    Removes the item at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{Number} The position of the item to remove.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored at the position index. It's undefined if the index is
-        out of bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="removeSegment"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>removeSegment</b>(from, to)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>from</b>
-
-    </dt>
-    <dd>{number} The position where start to remove the items. The from position is included.</dd>
-
-    <dt>
-        <b>to</b>
-
-    </dt>
-    <dd>{number} The position where stop to remove the items. The to position is included.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The items removed.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="reverse"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>reverse</b>()
-
-</div>
-<div class="description">
-    Reverses the list. This method reverses only the items, not the nodes.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="sort"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>sort</b>(callback)
-
-</div>
-<div class="description">
-    Sorts the list.
-
-
-</div>
-					
-					
-					
-					<pre class="code">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.</pre>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(item);}</i>
-    </dt>
-    <dd>{function} The function invoked in order to get the value for the evaluation of the sort criteria.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="split"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<DoubleLinkedList>}</span>
-    <b>split</b>(size)
-
-</div>
-<div class="description">
-    Splits the list into lists of desired size.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>size</b>
-
-    </dt>
-    <dd>{number} The size of the lists.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<DoubleLinkedList>}</span> The lists created by splitting the list.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="toArray"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>toArray</b>()
-
-</div>
-<div class="description">
-    Transforms the list into an array.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array built.</dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/DoubleLinkedListIterator.html b/doc/symbols/DoubleLinkedListIterator.html
deleted file mode 100644
index e822350..0000000
--- a/doc/symbols/DoubleLinkedListIterator.html
+++ /dev/null
@@ -1,670 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - DoubleLinkedListIterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class DoubleLinkedListIterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class DoubleLinkedListIterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/DoubleLinkedListIterator.html#constructor">DoubleLinkedListIterator</a></b>(aggregate)
-            </div>
-            <div class="description">Class that implements the iterator for a double linked list.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the fields documented in the class DoubleLinkedListIterator.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/DoubleLinkedListIterator.html#aggregate">aggregate</a></b>
-            </div>
-            <div class="description">The aggregate relates to this iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/DoubleLinkedListIterator.html#pointer">pointer</a></b>
-            </div>
-            <div class="description">The pointer to the position.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the methods documented in the class DoubleLinkedListIterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/DoubleLinkedListIterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/DoubleLinkedListIterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/DoubleLinkedListIterator.html#getNode">getNode</a></b>()
-            </div>
-            <div class="description">Returns the node stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/DoubleLinkedListIterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/DoubleLinkedListIterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/DoubleLinkedListIterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/DoubleLinkedListIterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>DoubleLinkedListIterator</b>(aggregate)
-    </div>
-
-    <div class="description">
-        Class that implements the iterator for a double linked list.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>aggregate</b>
-
-        </dt>
-        <dd>{DoubleLinkedList} The aggregate to scan.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="aggregate"> </a>
-
-<div class="fixedFont">
-
-
-    <b>aggregate</b>
-
-</div>
-<div class="description">
-    The aggregate relates to this iterator.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointer"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointer</b>
-
-</div>
-<div class="description">
-    The pointer to the position.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored or undefined if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{DLLNode|null}</span>
-    <b>getNode</b>()
-
-</div>
-<div class="description">
-    Returns the node stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{DLLNode|null}</span> The node stored or null if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/HashTable.html b/doc/symbols/HashTable.html
deleted file mode 100644
index b225578..0000000
--- a/doc/symbols/HashTable.html
+++ /dev/null
@@ -1,1120 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - HashTable</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class HashTable
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the constructor documented in the class HashTable.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/HashTable.html#constructor">HashTable</a></b>(size)
-            </div>
-            <div class="description">Class for managing an hash table.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class HashTable.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/HashTable.html#items">items</a></b>
-            </div>
-            <div class="description">The items stored in the hash table.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/HashTable.html#keyLength">keyLength</a></b>
-            </div>
-            <div class="description">The number of keys stored in the hash table.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/HashTable.html#size">size</a></b>
-            </div>
-            <div class="description">The size of the table</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class HashTable.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#clear">clear</a></b>()
-            </div>
-            <div class="description">Removes all the keys and the items stored in the hash table.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#clone">clone</a></b>()
-            </div>
-            <div class="description">Clones the hash table into a new hash table.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#containsKey">containsKey</a></b>(key, callback)
-            </div>
-            <div class="description">Checks if the hash table contains a key that satisfy the condition represented by
-                the callback function.
-            </div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#deleteAllKey">deleteAllKey</a></b>(key)
-            </div>
-            <div class="description">Deletes all the items relative to the key value.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#deleteKey">deleteKey</a></b>(key)
-            </div>
-            <div class="description">Deletes the first item relatives to the key value.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#execute">execute</a></b>(callback)
-            </div>
-            <div class="description">Executes the callback function for each item of the hash table.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#filter">filter</a></b>(callback)
-            </div>
-            <div class="description">Returns the items that satisfy the condition determined by the callback.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#getItems">getItems</a></b>()
-            </div>
-            <div class="description">Returns the items stored in the hash table.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#getKeys">getKeys</a></b>()
-            </div>
-            <div class="description">Returns the keys stored in the hash table.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#getNumberOfKeys">getNumberOfKeys</a></b>()
-            </div>
-            <div class="description">Returns the number of keys stored in the hash table.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#getSize">getSize</a></b>()
-            </div>
-            <div class="description">Returns the size of the hash table.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#hash">hash</a></b>(key)
-            </div>
-            <div class="description">Calculate the hash of the param key.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#insert">insert</a></b>(key, item)
-            </div>
-            <div class="description">Stores the item with its key.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#isEmpty">isEmpty</a></b>()
-            </div>
-            <div class="description">Checks if the hash table is empty.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#search">search</a></b>(key)
-            </div>
-            <div class="description">Searches the item relative to the key value.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/HashTable.html#searchAll">searchAll</a></b>(key)
-            </div>
-            <div class="description">Searches all the items relative to the key value.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>HashTable</b>(size)
-    </div>
-
-    <div class="description">
-        Class for managing an hash table.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>size</b>
-
-        </dt>
-        <dd>{number} The size of the table.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="items"> </a>
-
-<div class="fixedFont">
-
-
-    <b>items</b>
-
-</div>
-<div class="description">
-    The items stored in the hash table.
-
-
-</div>
-
-
-<hr/>
-
-<a name="keyLength"> </a>
-
-<div class="fixedFont">
-
-
-    <b>keyLength</b>
-
-</div>
-<div class="description">
-    The number of keys stored in the hash table.
-
-
-</div>
-
-
-<hr/>
-
-<a name="size"> </a>
-
-<div class="fixedFont">
-
-
-    <b>size</b>
-
-</div>
-<div class="description">
-    The size of the table
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="clear"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>clear</b>()
-
-</div>
-<div class="description">
-    Removes all the keys and the items stored in the hash table.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/HashTable.html">HashTable</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the hash table into a new hash table.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/HashTable.html">HashTable</a>}</span> The hash table cloned
-        from this hash table.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="containsKey"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>containsKey</b>(key, callback)
-
-</div>
-<div class="description">
-    Checks if the hash table contains a key that satisfy the condition represented by the callback function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to find.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(k){return(k===key);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current key to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the hash table contains the key that satisfy the
-        condition, false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="deleteAllKey"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteAllKey</b>(key)
-
-</div>
-<div class="description">
-    Deletes all the items relative to the key value.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to delete.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="deleteKey"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteKey</b>(key)
-
-</div>
-<div class="description">
-    Deletes the first item relatives to the key value.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to delete.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="execute"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>execute</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function to execute for each item. The function must accept the current item on which execute the
-        function.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="filter"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>filter</b>(callback)
-
-</div>
-<div class="description">
-    Returns the items that satisfy the condition determined by the callback.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function that implements the condition.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that contains the items that satisfy the condition.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItems"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>getItems</b>()
-
-</div>
-<div class="description">
-    Returns the items stored in the hash table.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The items stored in the table.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getKeys"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<number>}</span>
-    <b>getKeys</b>()
-
-</div>
-<div class="description">
-    Returns the keys stored in the hash table.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<number>}</span> The keys stored in the table.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getNumberOfKeys"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>getNumberOfKeys</b>()
-
-</div>
-<div class="description">
-    Returns the number of keys stored in the hash table.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The number of keys stored.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getSize"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>getSize</b>()
-
-</div>
-<div class="description">
-    Returns the size of the hash table.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The size of the hash table.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="hash"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>hash</b>(key)
-
-</div>
-<div class="description">
-    Calculate the hash of the param key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to hash.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The hash of the key.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="insert"> </a>
-
-<div class="fixedFont">
-
-
-    <b>insert</b>(key, item)
-
-</div>
-<div class="description">
-    Stores the item with its key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key relatives to the item.</dd>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to store.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Checks if the hash table is empty.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the hash table is empty, false otherwise.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="search"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*|undefined}</span>
-    <b>search</b>(key)
-
-</div>
-<div class="description">
-    Searches the item relative to the key value.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key of the item to search.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*|undefined}</span> The item found or undefined if the key does not exist.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="searchAll"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array.<*>}</span>
-    <b>searchAll</b>(key)
-
-</div>
-<div class="description">
-    Searches all the items relative to the key value.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key of the items to search.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array.<*>}</span> An array with the items found.</dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/Iterator.html b/doc/symbols/Iterator.html
deleted file mode 100644
index 782b8f3..0000000
--- a/doc/symbols/Iterator.html
+++ /dev/null
@@ -1,552 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - Iterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class Iterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the constructor documented in the class Iterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/Iterator.html#constructor">Iterator</a></b>()
-            </div>
-            <div class="description">Interface for managing an iterator for an aggregate.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class Iterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Iterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Iterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Iterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Iterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Iterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Iterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>Iterator</b>()
-    </div>
-
-    <div class="description">
-        Interface for managing an iterator for an aggregate.
-
-    </div>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored or undefined if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/LinkedList.html b/doc/symbols/LinkedList.html
deleted file mode 100644
index 9b637e4..0000000
--- a/doc/symbols/LinkedList.html
+++ /dev/null
@@ -1,1929 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - LinkedList</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class LinkedList
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the constructor documented in the class LinkedList.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/LinkedList.html#constructor">LinkedList</a></b>(args)
-            </div>
-            <div class="description">Class for managing a linked list.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class LinkedList.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/LinkedList.html#first">first</a></b>
-            </div>
-            <div class="description">The first node of the list.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/LinkedList.html#last">last</a></b>
-            </div>
-            <div class="description">The last node of the list.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/LinkedList.html#length">length</a></b>
-            </div>
-            <div class="description">The length of the list.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class LinkedList.">
-<caption>Method Summary</caption>
-<thead>
-<tr>
-    <th scope="col">Method Attributes</th>
-    <th scope="col">Method Name and Description</th>
-</tr>
-</thead>
-<tbody>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#addAt">addAt</a></b>(item, index)
-        </div>
-        <div class="description">Adds the item at the index position.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#allIndexesOf">allIndexesOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns all the position in which the item has been found in the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#clear">clear</a></b>()
-        </div>
-        <div class="description">Removes all the items stored in the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#clone">clone</a></b>()
-        </div>
-        <div class="description">Clones the list into a new list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#cloneDistinct">cloneDistinct</a></b>()
-        </div>
-        <div class="description">Clones the list into a new list without cloning duplicated items.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#contains">contains</a></b>(item, callback)
-        </div>
-        <div class="description">Checks if the list contains an item that satisfy the condition represented by the
-            callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#count">count</a></b>(callback)
-        </div>
-        <div class="description">Returns the number of items that satisfy the represented by the callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#divide">divide</a></b>(index)
-        </div>
-        <div class="description">Divides the list at the index position.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#execute">execute</a></b>(callback)
-        </div>
-        <div class="description">Executes the callback function for each item of the stack.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#filter">filter</a></b>(callback)
-        </div>
-        <div class="description">Returns the items that satisfy the condition determined by the callback.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#fromArray">fromArray</a></b>(array)
-        </div>
-        <div class="description">Builds the list from the array.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#getItem">getItem</a></b>(index)
-        </div>
-        <div class="description">Returns the item at the position index.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#getIterator">getIterator</a></b>()
-        </div>
-        <div class="description">Returns the iterator relative to the aggregate.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#getLength">getLength</a></b>()
-        </div>
-        <div class="description">Returns the length of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#getNode">getNode</a></b>(index)
-        </div>
-        <div class="description">Returns the node at the position index.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#indexOf">indexOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns the first position of the item in the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#isEmpty">isEmpty</a></b>()
-        </div>
-        <div class="description">Checks if the list is empty.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#join">join</a></b>(list)
-        </div>
-        <div class="description">Joins the list at the end of this list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#lastIndexOf">lastIndexOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns the last position of the item in the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#modifyAt">modifyAt</a></b>(index, item)
-        </div>
-        <div class="description">Changes the item stored in the index position.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#multiPopBack">multiPopBack</a></b>(times)
-        </div>
-        <div class="description">Removes the last times items of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#multiPopFront">multiPopFront</a></b>(times)
-        </div>
-        <div class="description">Removes the first times items of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#peek">peek</a></b>()
-        </div>
-        <div class="description">Returns the first item of the list without remove it.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#popBack">popBack</a></b>()
-        </div>
-        <div class="description">Removes the last item of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#popFront">popFront</a></b>()
-        </div>
-        <div class="description">Removes the first item of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#pushBack">pushBack</a></b>(item)
-        </div>
-        <div class="description">Adds an item at the tail of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#pushFront">pushFront</a></b>(item)
-        </div>
-        <div class="description">Adds an item at the head of the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#remove">remove</a></b>(item, callback)
-        </div>
-        <div class="description">Removes the item from the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#removeAll">removeAll</a></b>(item, callback)
-        </div>
-        <div class="description">Removes all the item from the list.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#removeAt">removeAt</a></b>(index)
-        </div>
-        <div class="description">Removes the item at the index position.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#removeSegment">removeSegment</a></b>(from, to)
-        </div>
-        <div class="description">Removes all the items stored from the from position to the to position.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#split">split</a></b>(size)
-        </div>
-        <div class="description">Splits the list into lists of desired size.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/LinkedList.html#toArray">toArray</a></b>()
-        </div>
-        <div class="description">Transforms the list into an array.</div>
-    </td>
-</tr>
-
-</tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>LinkedList</b>(args)
-    </div>
-
-    <div class="description">
-        Class for managing a linked list.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <span class="light fixedFont">{...*}</span> <b>args</b>
-            <i>Optional</i>
-        </dt>
-        <dd>The items for initializing the list.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-
-    <b>first</b>
-
-</div>
-<div class="description">
-    The first node of the list.
-
-
-</div>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-
-    <b>last</b>
-
-</div>
-<div class="description">
-    The last node of the list.
-
-
-</div>
-
-
-<hr/>
-
-<a name="length"> </a>
-
-<div class="fixedFont">
-
-
-    <b>length</b>
-
-</div>
-<div class="description">
-    The length of the list.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="addAt"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>addAt</b>(item, index)
-
-</div>
-<div class="description">
-    Adds the item at the index position.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to add.</dd>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position where to add the item. If index is negative, the item won't be added.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="allIndexesOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<number>}</span>
-    <b>allIndexesOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns all the position in which the item has been found in the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<number>}</span> The positions in which the item has been found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clear"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>clear</b>()
-
-</div>
-<div class="description">
-    Removes all the items stored in the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/LinkedList.html">LinkedList</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the list into a new list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/LinkedList.html">LinkedList</a>}</span> The list cloned from
-        this list.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="cloneDistinct"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/LinkedList.html">LinkedList</a>}</span>
-    <b>cloneDistinct</b>()
-
-</div>
-<div class="description">
-    Clones the list into a new list without cloning duplicated items.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/LinkedList.html">LinkedList</a>}</span> The list cloned from
-        this list.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="contains"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>contains</b>(item, callback)
-
-</div>
-<div class="description">
-    Checks if the list contains an item that satisfy the condition represented by the callback function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to find.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the list contains the item that satisfy the condition,
-        false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="count"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>count</b>(callback)
-
-</div>
-<div class="description">
-    Returns the number of items that satisfy the represented by the callback function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The condition to satisfy.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The number of items that satisfy the condition.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="divide"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/LinkedList.html">LinkedList</a>}</span>
-    <b>divide</b>(index)
-
-</div>
-<div class="description">
-    Divides the list at the index position. The node at the index position is the first new node of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position where to divide the list.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/LinkedList.html">LinkedList</a>}</span> The list formed by
-        the nodes from the index position then. If the index is out of bound, the list will be empty.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="execute"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>execute</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function to execute for each item. The function must accept the current item on which execute the
-        function.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="filter"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>filter</b>(callback)
-
-</div>
-<div class="description">
-    Returns the items that satisfy the condition determined by the callback.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function that implements the condition.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that contains the items that satisfy the condition.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="fromArray"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>fromArray</b>(array)
-
-</div>
-<div class="description">
-    Builds the list from the array.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>array</b>
-
-    </dt>
-    <dd>{Array<*>} The array from which build the list.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>(index)
-
-</div>
-<div class="description">
-    Returns the item at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the item.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored at the position index. It's undefined if index isn't in
-        the list bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getIterator"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-    <b>getIterator</b>()
-
-</div>
-<div class="description">
-    Returns the iterator relative to the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getLength"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Number}</span>
-    <b>getLength</b>()
-
-</div>
-<div class="description">
-    Returns the length of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Number}</span> The length of the list.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{LLNode}</span>
-    <b>getNode</b>(index)
-
-</div>
-<div class="description">
-    Returns the node at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the node.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{LLNode}</span> The node stored at the position index. It's undefined if index
-        isn't in the list bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="indexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>indexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the first position of the item in the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The first position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Checks if the list is empty.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the list is empty, false otherwise.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="join"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>join</b>(list)
-
-</div>
-<div class="description">
-    Joins the list at the end of this list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>list</b>
-
-    </dt>
-    <dd>{LinkedList} The list to join.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="lastIndexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>lastIndexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the last position of the item in the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The last position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="modifyAt"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>modifyAt</b>(index, item)
-
-</div>
-<div class="description">
-    Changes the item stored in the index position. If the index is out of bound, the node won't be updated.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the node to modify.</dd>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The new item stored in the node.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiPopBack"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>multiPopBack</b>(times)
-
-</div>
-<div class="description">
-    Removes the last times items of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>times</b>
-
-    </dt>
-    <dd>{number} The number of times to repeat the popBack method.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The items removed.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiPopFront"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>multiPopFront</b>(times)
-
-</div>
-<div class="description">
-    Removes the first times items of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>times</b>
-
-    </dt>
-    <dd>{number} The number of times to repeat the popFront method.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item removed. It's undefined if the list is empty.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="peek"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>peek</b>()
-
-</div>
-<div class="description">
-    Returns the first item of the list without remove it.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the top of the list. It's undefined if the list is empty.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="popBack"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>popBack</b>()
-
-</div>
-<div class="description">
-    Removes the last item of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item removed. It's undefined if the list is empty.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="popFront"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>popFront</b>()
-
-</div>
-<div class="description">
-    Removes the first item of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item removed. It's undefined if the list is empty.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="pushBack"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>pushBack</b>(item)
-
-</div>
-<div class="description">
-    Adds an item at the tail of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to add.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="pushFront"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>pushFront</b>(item)
-
-</div>
-<div class="description">
-    Adds an item at the head of the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to add.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="remove"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>remove</b>(item, callback)
-
-</div>
-<div class="description">
-    Removes the item from the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to remove.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="removeAll"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>removeAll</b>(item, callback)
-
-</div>
-<div class="description">
-    Removes all the item from the list.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to remove.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="removeAt"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>removeAt</b>(index)
-
-</div>
-<div class="description">
-    Removes the item at the index position.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the item to remove.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored at the position index. It's undefined if the index is
-        out of bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="removeSegment"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>removeSegment</b>(from, to)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>from</b>
-
-    </dt>
-    <dd>{number} The position where start to remove the items. The from position is included.</dd>
-
-    <dt>
-        <b>to</b>
-
-    </dt>
-    <dd>{number} The position where stop to remove the items. The to position is included.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The items removed.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="split"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<LinkedList>}</span>
-    <b>split</b>(size)
-
-</div>
-<div class="description">
-    Splits the list into lists of desired size.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>size</b>
-
-    </dt>
-    <dd>{number} The size of the lists.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<LinkedList>}</span> The lists created by splitting the list.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="toArray"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>toArray</b>()
-
-</div>
-<div class="description">
-    Transforms the list into an array.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array built.</dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/LinkedListIterator.html b/doc/symbols/LinkedListIterator.html
deleted file mode 100644
index 42db394..0000000
--- a/doc/symbols/LinkedListIterator.html
+++ /dev/null
@@ -1,670 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - LinkedListIterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class LinkedListIterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class LinkedListIterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/LinkedListIterator.html#constructor">LinkedListIterator</a></b>(aggregate)
-            </div>
-            <div class="description">Class that implements the iterator for a linked list.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the fields documented in the class LinkedListIterator.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/LinkedListIterator.html#aggregate">aggregate</a></b>
-            </div>
-            <div class="description">The aggregate relates to this iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/LinkedListIterator.html#pointer">pointer</a></b>
-            </div>
-            <div class="description">The pointer to the position.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the methods documented in the class LinkedListIterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/LinkedListIterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/LinkedListIterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/LinkedListIterator.html#getNode">getNode</a></b>()
-            </div>
-            <div class="description">Returns the node stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/LinkedListIterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/LinkedListIterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/LinkedListIterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/LinkedListIterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>LinkedListIterator</b>(aggregate)
-    </div>
-
-    <div class="description">
-        Class that implements the iterator for a linked list.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>aggregate</b>
-
-        </dt>
-        <dd>{LinkedList} The aggregate to scan.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="aggregate"> </a>
-
-<div class="fixedFont">
-
-
-    <b>aggregate</b>
-
-</div>
-<div class="description">
-    The aggregate relates to this iterator.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointer"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointer</b>
-
-</div>
-<div class="description">
-    The pointer to the position.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored or undefined if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Node|null}</span>
-    <b>getNode</b>()
-
-</div>
-<div class="description">
-    Returns the node stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Node|null}</span> The node stored or null if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/PriorityQueue.html b/doc/symbols/PriorityQueue.html
deleted file mode 100644
index 31151d2..0000000
--- a/doc/symbols/PriorityQueue.html
+++ /dev/null
@@ -1,1232 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - PriorityQueue</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class PriorityQueue
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class PriorityQueue.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/PriorityQueue.html#constructor">PriorityQueue</a></b>()
-            </div>
-            <div class="description">Class for managing a priority queue.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class PriorityQueue.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/PriorityQueue.html#items">items</a></b>
-            </div>
-            <div class="description">The list of the items in the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/PriorityQueue.html#length">length</a></b>
-            </div>
-            <div class="description">The length of the queue.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class PriorityQueue.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#changePriority">changePriority</a></b>(index,
-                newPriority)
-            </div>
-            <div class="description">Changes the priority of the item at the position index.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#clear">clear</a></b>()
-            </div>
-            <div class="description">Removes all the items stored in the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#clone">clone</a></b>()
-            </div>
-            <div class="description">Clones the queue into a new queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#cloneDistinct">cloneDistinct</a></b>()
-            </div>
-            <div class="description">Clones the queue into a new queue without cloning duplicated items.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#containsPriority">containsPriority</a></b>(priority,
-                callback)
-            </div>
-            <div class="description">Checks if the queue contains a priority that satisfy the condition represented by
-                the callback function.
-            </div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#dequeue">dequeue</a></b>()
-            </div>
-            <div class="description">Removes the item at the head of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#enqueue">enqueue</a></b>(priority, item)
-            </div>
-            <div class="description">Adds the item at the tail of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#execute">execute</a></b>(callback)
-            </div>
-            <div class="description">Executes the callback function for each item of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#filter">filter</a></b>(callback)
-            </div>
-            <div class="description">Returns the items that satisfy the condition determined by the callback.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#getItem">getItem</a></b>(index)
-            </div>
-            <div class="description">Returns the item at the position index.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#getItems">getItems</a></b>(priority)
-            </div>
-            <div class="description">Returns the items relatives to the priority.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#getIterator">getIterator</a></b>()
-            </div>
-            <div class="description">Returns the iterator relative to the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#getLength">getLength</a></b>()
-            </div>
-            <div class="description">Returns the length of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#isEmpty">isEmpty</a></b>()
-            </div>
-            <div class="description">Checks if the queue is empty.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#multiDequeue">multiDequeue</a></b>(times)
-            </div>
-            <div class="description">Removes the items at the head of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#multiEnqueue">multiEnqueue</a></b>(priority,
-                items)
-            </div>
-            <div class="description">Adds the items with the same priority at the tail of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#peek">peek</a></b>()
-            </div>
-            <div class="description">Returns the first item in the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#remove">remove</a></b>(index, length)
-            </div>
-            <div class="description">Removes the first length items from the position index.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueue.html#toQueue">toQueue</a></b>()
-            </div>
-            <div class="description">Returns the queue created by the priority queue with the items in the same order
-                but without the priority.
-            </div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>PriorityQueue</b>()
-    </div>
-
-    <div class="description">
-        Class for managing a priority queue.
-
-    </div>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="items"> </a>
-
-<div class="fixedFont">
-
-
-    <b>items</b>
-
-</div>
-<div class="description">
-    The list of the items in the queue.
-
-
-</div>
-
-
-<hr/>
-
-<a name="length"> </a>
-
-<div class="fixedFont">
-
-
-    <b>length</b>
-
-</div>
-<div class="description">
-    The length of the queue.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="changePriority"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>changePriority</b>(index, newPriority)
-
-</div>
-<div class="description">
-    Changes the priority of the item at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the item of which increase the priority.</dd>
-
-    <dt>
-        <b>newPriority</b>
-
-    </dt>
-    <dd>{number} The new priority.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clear"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>clear</b>()
-
-</div>
-<div class="description">
-    Removes all the items stored in the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/PriorityQueue.html">PriorityQueue</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the queue into a new queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/PriorityQueue.html">PriorityQueue</a>}</span> The queue
-        cloned from this queue.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="cloneDistinct"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/PriorityQueue.html">PriorityQueue</a>}</span>
-    <b>cloneDistinct</b>()
-
-</div>
-<div class="description">
-    Clones the queue into a new queue without cloning duplicated items.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/PriorityQueue.html">PriorityQueue</a>}</span> The queue
-        cloned from this queue.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="containsPriority"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>containsPriority</b>(priority, callback)
-
-</div>
-<div class="description">
-    Checks if the queue contains a priority that satisfy the condition represented by the callback function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>priority</b>
-
-    </dt>
-    <dd>{number} The priority to find.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(p){return(p===priority);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current priority to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the queue contains the priority that satisfy the
-        condition, false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="dequeue"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>dequeue</b>()
-
-</div>
-<div class="description">
-    Removes the item at the head of the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the head of the queue. It's undefined if the queue is
-        empty.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="enqueue"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>enqueue</b>(priority, item)
-
-</div>
-<div class="description">
-    Adds the item at the tail of the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>priority</b>
-
-    </dt>
-    <dd>{number} The priority of the item.</dd>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to add.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="execute"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>execute</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function to execute for each item. The function must accept the current item on which execute the
-        function.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="filter"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>filter</b>(callback)
-
-</div>
-<div class="description">
-    Returns the items that satisfy the condition determined by the callback.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function that implements the condition.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that contains the items that satisfy the condition.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>(index)
-
-</div>
-<div class="description">
-    Returns the item at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The index of the item.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item found. It's undefined if the position index is out of bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItems"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>getItems</b>(priority)
-
-</div>
-<div class="description">
-    Returns the items relatives to the priority.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>priority</b>
-
-    </dt>
-    <dd>{number} The priority of the items.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The items found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getIterator"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-    <b>getIterator</b>()
-
-</div>
-<div class="description">
-    Returns the iterator relative to the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getLength"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>getLength</b>()
-
-</div>
-<div class="description">
-    Returns the length of the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The length of the queue.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Checks if the queue is empty.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the queue is empty, false otherwise.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiDequeue"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>multiDequeue</b>(times)
-
-</div>
-<div class="description">
-    Removes the items at the head of the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>times</b>
-
-    </dt>
-    <dd>{number} The number of times to repeat the dequeue method.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The items at the head of the queue.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiEnqueue"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>multiEnqueue</b>(priority, items)
-
-</div>
-<div class="description">
-    Adds the items with the same priority at the tail of the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>priority</b>
-
-    </dt>
-    <dd>{number} The priority of the items.</dd>
-
-    <dt>
-        <b>items</b>
-
-    </dt>
-    <dd>{Array<*>} The items to add.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="peek"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>peek</b>()
-
-</div>
-<div class="description">
-    Returns the first item in the queue. The item is not removed.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The first item. It's undefined if the queue is empty.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="remove"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>remove</b>(index, length)
-
-</div>
-<div class="description">
-    Removes the first length items from the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position where to start to remove the items.</dd>
-
-    <dt>
-        <b>length</b>
-        <i>Optional, Default: 1</i>
-    </dt>
-    <dd>{number} The number of items to remove.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="toQueue"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Queue.html">Queue</a>}</span>
-    <b>toQueue</b>()
-
-</div>
-<div class="description">
-    Returns the queue created by the priority queue with the items in the same order but without the priority.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Queue.html">Queue</a>}</span> The queue created.</dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/PriorityQueueIterator.html b/doc/symbols/PriorityQueueIterator.html
deleted file mode 100644
index a05d2c8..0000000
--- a/doc/symbols/PriorityQueueIterator.html
+++ /dev/null
@@ -1,663 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - PriorityQueueIterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class PriorityQueueIterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class PriorityQueueIterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/PriorityQueueIterator.html#constructor">PriorityQueueIterator</a></b>(aggregate)
-            </div>
-            <div class="description">Class that implements the iterator for a priority queue.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the fields documented in the class PriorityQueueIterator.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/PriorityQueueIterator.html#aggregate">aggregate</a></b>
-            </div>
-            <div class="description">The aggregate relates to this iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/PriorityQueueIterator.html#pointerNode">pointerNode</a></b>
-            </div>
-            <div class="description">The pointer to the position of the node.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/PriorityQueueIterator.html#pointerPosition">pointerPosition</a></b>
-            </div>
-            <div class="description">The pointer to the position in the node.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the methods documented in the class PriorityQueueIterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueueIterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueueIterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueueIterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueueIterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueueIterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/PriorityQueueIterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>PriorityQueueIterator</b>(aggregate)
-    </div>
-
-    <div class="description">
-        Class that implements the iterator for a priority queue.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>aggregate</b>
-
-        </dt>
-        <dd>{PriorityQueue} The aggregate to scan.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="aggregate"> </a>
-
-<div class="fixedFont">
-
-
-    <b>aggregate</b>
-
-</div>
-<div class="description">
-    The aggregate relates to this iterator.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointerNode"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointerNode</b>
-
-</div>
-<div class="description">
-    The pointer to the position of the node.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointerPosition"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointerPosition</b>
-
-</div>
-<div class="description">
-    The pointer to the position in the node.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored or undefined if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/Queue.html b/doc/symbols/Queue.html
deleted file mode 100644
index eab245e..0000000
--- a/doc/symbols/Queue.html
+++ /dev/null
@@ -1,1224 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - Queue</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class Queue
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the constructor documented in the class Queue.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/Queue.html#constructor">Queue</a></b>(args)
-            </div>
-            <div class="description">Class for managing a queue.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class Queue.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/Queue.html#items">items</a></b>
-            </div>
-            <div class="description">The list of the items in the queue.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class Queue.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#allIndexesOf">allIndexesOf</a></b>(item, callback)
-            </div>
-            <div class="description">Returns all the position in which the item has been found in the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#clear">clear</a></b>()
-            </div>
-            <div class="description">Removes all the items stored in the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#clone">clone</a></b>()
-            </div>
-            <div class="description">Clones the queue into a new queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#cloneDistinct">cloneDistinct</a></b>()
-            </div>
-            <div class="description">Clones the queue into a new queue without cloning duplicated items.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#contains">contains</a></b>(item, callback)
-            </div>
-            <div class="description">Checks if the queue contains an item that satisfy the condition represented by the
-                callback function.
-            </div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#dequeue">dequeue</a></b>()
-            </div>
-            <div class="description">Removes the item at the head of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#enqueue">enqueue</a></b>(item)
-            </div>
-            <div class="description">Adds the item at the tail of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#execute">execute</a></b>(callback)
-            </div>
-            <div class="description">Executes the callback function for each item of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#filter">filter</a></b>(callback)
-            </div>
-            <div class="description">Returns the items that satisfy the condition determined by the callback.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#getItem">getItem</a></b>(index)
-            </div>
-            <div class="description">Returns the item at the position index.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#getIterator">getIterator</a></b>()
-            </div>
-            <div class="description">Returns the iterator relative to the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#getLength">getLength</a></b>()
-            </div>
-            <div class="description">Returns the length of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#indexOf">indexOf</a></b>(item, callback)
-            </div>
-            <div class="description">Returns the first position of the item in the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#isEmpty">isEmpty</a></b>()
-            </div>
-            <div class="description">Checks if the queue is empty.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#lastIndexOf">lastIndexOf</a></b>(item, callback)
-            </div>
-            <div class="description">Returns the last position of the item in the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#multiDequeue">multiDequeue</a></b>(times)
-            </div>
-            <div class="description">Removes the items at the head of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#multiEnqueue">multiEnqueue</a></b>(items)
-            </div>
-            <div class="description">Adds the items at the tail of the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#peek">peek</a></b>()
-            </div>
-            <div class="description">Returns the first item in the queue.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Queue.html#remove">remove</a></b>(index, length)
-            </div>
-            <div class="description">Removes the first length items from the position index.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>Queue</b>(args)
-    </div>
-
-    <div class="description">
-        Class for managing a queue.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <span class="light fixedFont">{...*}</span> <b>args</b>
-            <i>Optional</i>
-        </dt>
-        <dd>The items for initializing the queue.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="items"> </a>
-
-<div class="fixedFont">
-
-
-    <b>items</b>
-
-</div>
-<div class="description">
-    The list of the items in the queue.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="allIndexesOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<number>}</span>
-    <b>allIndexesOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns all the position in which the item has been found in the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<number>}</span> The positions in which the item has been found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clear"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>clear</b>()
-
-</div>
-<div class="description">
-    Removes all the items stored in the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Queue.html">Queue</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the queue into a new queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Queue.html">Queue</a>}</span> The queue cloned from this
-        queue.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="cloneDistinct"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Queue.html">Queue</a>}</span>
-    <b>cloneDistinct</b>()
-
-</div>
-<div class="description">
-    Clones the queue into a new queue without cloning duplicated items.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Queue.html">Queue</a>}</span> The queue cloned from this
-        queue.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="contains"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>contains</b>(item, callback)
-
-</div>
-<div class="description">
-    Checks if the queue contains an item that satisfy the condition represented by the callback function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to find.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the queue contains the item that satisfy the condition,
-        false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="dequeue"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>dequeue</b>()
-
-</div>
-<div class="description">
-    Removes the item at the head of the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the head of the queue. It's undefined if the queue is
-        empty.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="enqueue"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>enqueue</b>(item)
-
-</div>
-<div class="description">
-    Adds the item at the tail of the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to add.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="execute"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>execute</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function to execute for each item. The function must accept the current item on which execute the
-        function.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="filter"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>filter</b>(callback)
-
-</div>
-<div class="description">
-    Returns the items that satisfy the condition determined by the callback.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function that implements the condition.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that contains the items that satisfy the condition.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>(index)
-
-</div>
-<div class="description">
-    Returns the item at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the item.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the position. It's undefined if index isn't in the queue
-        bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getIterator"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-    <b>getIterator</b>()
-
-</div>
-<div class="description">
-    Returns the iterator relative to the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getLength"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>getLength</b>()
-
-</div>
-<div class="description">
-    Returns the length of the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The length of the queue.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="indexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>indexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the first position of the item in the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The first position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Checks if the queue is empty.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the queue is empty, false otherwise.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="lastIndexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>lastIndexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the last position of the item in the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The last position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiDequeue"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>multiDequeue</b>(times)
-
-</div>
-<div class="description">
-    Removes the items at the head of the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>times</b>
-
-    </dt>
-    <dd>{number} The number of times to repeat the dequeue method.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The items at the head of the queue.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiEnqueue"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>multiEnqueue</b>(items)
-
-</div>
-<div class="description">
-    Adds the items at the tail of the queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>items</b>
-
-    </dt>
-    <dd>{Array<*>} The items to add.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="peek"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>peek</b>()
-
-</div>
-<div class="description">
-    Returns the first item in the queue. The item is not removed.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The first item. It's undefined if the queue is empty.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="remove"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>remove</b>(index, length)
-
-</div>
-<div class="description">
-    Removes the first length items from the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position where to start to remove the items.</dd>
-
-    <dt>
-        <b>length</b>
-        <i>Optional, Default: 1</i>
-    </dt>
-    <dd>{number} The number of items to remove.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/QueueIterator.html b/doc/symbols/QueueIterator.html
deleted file mode 100644
index 1c43074..0000000
--- a/doc/symbols/QueueIterator.html
+++ /dev/null
@@ -1,634 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - QueueIterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class QueueIterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class QueueIterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/QueueIterator.html#constructor">QueueIterator</a></b>(aggregate)
-            </div>
-            <div class="description">Class that implements the iterator for a linked list.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class QueueIterator.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/QueueIterator.html#aggregate">aggregate</a></b>
-            </div>
-            <div class="description">The aggregate relates to this iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/QueueIterator.html#pointer">pointer</a></b>
-            </div>
-            <div class="description">The pointer to the position.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class QueueIterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/QueueIterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/QueueIterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/QueueIterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/QueueIterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/QueueIterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/QueueIterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>QueueIterator</b>(aggregate)
-    </div>
-
-    <div class="description">
-        Class that implements the iterator for a linked list.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>aggregate</b>
-
-        </dt>
-        <dd>{Queue} The aggregate to scan.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="aggregate"> </a>
-
-<div class="fixedFont">
-
-
-    <b>aggregate</b>
-
-</div>
-<div class="description">
-    The aggregate relates to this iterator.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointer"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointer</b>
-
-</div>
-<div class="description">
-    The pointer to the position.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored or undefined if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/RBTree.html b/doc/symbols/RBTree.html
deleted file mode 100644
index 0ec8b16..0000000
--- a/doc/symbols/RBTree.html
+++ /dev/null
@@ -1,1598 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - RBTree</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class RBTree
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the constructor documented in the class RBTree.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTree.html#constructor">RBTree</a></b>()
-            </div>
-            <div class="description">Class for managing a red-black tree.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class RBTree.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTree.html#root">root</a></b>
-            </div>
-            <div class="description">The root of the tree.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTree.html#size">size</a></b>
-            </div>
-            <div class="description">The number of items stored in the tree.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class RBTree.">
-<caption>Method Summary</caption>
-<thead>
-<tr>
-    <th scope="col">Method Attributes</th>
-    <th scope="col">Method Name and Description</th>
-</tr>
-</thead>
-<tbody>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#allIndexesOf">allIndexesOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns all the position in which the item has been found in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#clear">clear</a></b>()
-        </div>
-        <div class="description">Removes all the items stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#clone">clone</a></b>()
-        </div>
-        <div class="description">Clones the queue into a new queue.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#cloneDistinct">cloneDistinct</a></b>()
-        </div>
-        <div class="description">Clones the tree into a new tree without cloning duplicated items.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#contains">contains</a></b>(key, callback)
-        </div>
-        <div class="description">Checks if the tree contains a key or a node that satisfy the condition represented by
-            the callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#deleteFixUp">deleteFixUp</a></b>(node, parent)
-        </div>
-        <div class="description">Preserves the properties of the tree after a deletion.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#deleteNode">deleteNode</a></b>(node)
-        </div>
-        <div class="description">Deletes the node from the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#execute">execute</a></b>(callback)
-        </div>
-        <div class="description">Executes the callback function for each item of the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#filter">filter</a></b>(callback)
-        </div>
-        <div class="description">Returns the items that satisfy the condition determined by the callback.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#fullContains">fullContains</a></b>(callback)
-        </div>
-        <div class="description">Checks if the tree contains a node that satisfy the condition represented by the
-            callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#getItem">getItem</a></b>(index)
-        </div>
-        <div class="description">Returns the item at the position index.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#getIterator">getIterator</a></b>()
-        </div>
-        <div class="description">Returns the iterator relative to the aggregate.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#getSize">getSize</a></b>()
-        </div>
-        <div class="description">Returns the size of the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#indexOf">indexOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns the first position of the item in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#insert">insert</a></b>(key, item)
-        </div>
-        <div class="description">Inserts the item relatives to the key value in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#insertFixUp">insertFixUp</a></b>(node)
-        </div>
-        <div class="description">Preserves the properties of the tree after an insert.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#isEmpty">isEmpty</a></b>()
-        </div>
-        <div class="description">Checks if the tree is empty.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#lastIndexOf">lastIndexOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns the last position of the item in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#leftRotate">leftRotate</a></b>(node)
-        </div>
-        <div class="description">Rotates the node with its right child.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#maximum">maximum</a></b>(node)
-        </div>
-        <div class="description">Gets the item relatives to the maximum key stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#minimum">minimum</a></b>(node)
-        </div>
-        <div class="description">Gets the item relatives to the minimum key stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#predecessor">predecessor</a></b>(node)
-        </div>
-        <div class="description">Gets the node with the key previous to the param node key.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#rightRotate">rightRotate</a></b>(node)
-        </div>
-        <div class="description">Rotates the node with its left child.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#search">search</a></b>(key, node, callback)
-        </div>
-        <div class="description">Searches the item relatives to the key and to the nodes that satisfy the condition
-            represented by the callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#successor">successor</a></b>(node)
-        </div>
-        <div class="description">Gets the node with the key next to the param node key.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTree.html#toArray">toArray</a></b>()
-        </div>
-        <div class="description">Transforms the tree into an array without preserving keys.</div>
-    </td>
-</tr>
-
-</tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>RBTree</b>()
-    </div>
-
-    <div class="description">
-        Class for managing a red-black tree.
-
-    </div>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="root"> </a>
-
-<div class="fixedFont">
-
-
-    <b>root</b>
-
-</div>
-<div class="description">
-    The root of the tree.
-
-
-</div>
-
-
-<hr/>
-
-<a name="size"> </a>
-
-<div class="fixedFont">
-
-
-    <b>size</b>
-
-</div>
-<div class="description">
-    The number of items stored in the tree.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="allIndexesOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<number>}</span>
-    <b>allIndexesOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns all the position in which the item has been found in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<number>}</span> The positions in which the item has been found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clear"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>clear</b>()
-
-</div>
-<div class="description">
-    Removes all the items stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/RBTree.html">RBTree</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the queue into a new queue.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/RBTree.html">RBTree</a>}</span> The tree cloned from this
-        queue.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="cloneDistinct"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/RBTree.html">RBTree</a>}</span>
-    <b>cloneDistinct</b>()
-
-</div>
-<div class="description">
-    Clones the tree into a new tree without cloning duplicated items.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/RBTree.html">RBTree</a>}</span> The tree cloned from this
-        tree.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="contains"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>contains</b>(key, callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{*} The key to find.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(node){return(node.key===key);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current node to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the tree contains the key or a node that satisfy the
-        condition, false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="deleteFixUp"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteFixUp</b>(node, parent)
-
-</div>
-<div class="description">
-    Preserves the properties of the tree after a deletion.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBNode} The node to delete.</dd>
-
-    <dt>
-        <b>parent</b>
-
-    </dt>
-    <dd>{RBNode} The parent of the node.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="deleteNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteNode</b>(node)
-
-</div>
-<div class="description">
-    Deletes the node from the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBNode} The node to delete.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="execute"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>execute</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function to execute for each item. The function must accept the current item on which execute the
-        function.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="filter"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>filter</b>(callback)
-
-</div>
-<div class="description">
-    Returns the items that satisfy the condition determined by the callback.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function that implements the condition.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that contains the items that satisfy the condition.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="fullContains"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>fullContains</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The condition to satisfy. The callback must accept the current node to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the tree contains the node that satisfy the condition,
-        false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>(index)
-
-</div>
-<div class="description">
-    Returns the item at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the item.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the position. It's undefined if index isn't in the tree
-        bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getIterator"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-    <b>getIterator</b>()
-
-</div>
-<div class="description">
-    Returns the iterator relative to the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getSize"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>getSize</b>()
-
-</div>
-<div class="description">
-    Returns the size of the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The size of the tree.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="indexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>indexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the first position of the item in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The first position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="insert"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>insert</b>(key, item)
-
-</div>
-<div class="description">
-    Inserts the item relatives to the key value in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to store.</dd>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to store.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="insertFixUp"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>insertFixUp</b>(node)
-
-</div>
-<div class="description">
-    Preserves the properties of the tree after an insert.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBNode} The node to insert.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Checks if the tree is empty.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the tree is empty, false otherwise.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="lastIndexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>lastIndexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the last position of the item in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The last position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="leftRotate"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>leftRotate</b>(node)
-
-</div>
-<div class="description">
-    Rotates the node with its right child.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBNode} The node to rotate.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="maximum"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{RBNode}</span>
-    <b>maximum</b>(node)
-
-</div>
-<div class="description">
-    Gets the item relatives to the maximum key stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>{Node} The node from which start the search.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{RBNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="minimum"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{RBNode}</span>
-    <b>minimum</b>(node)
-
-</div>
-<div class="description">
-    Gets the item relatives to the minimum key stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>{Node} The node from which start the search.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{RBNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="predecessor"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{RBNode}</span>
-    <b>predecessor</b>(node)
-
-</div>
-<div class="description">
-    Gets the node with the key previous to the param node key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBNode} The node of which search the predecessor.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{RBNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="rightRotate"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>rightRotate</b>(node)
-
-</div>
-<div class="description">
-    Rotates the node with its left child.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBNode} The node to rotate.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="search"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>search</b>(key, node, callback)
-
-</div>
-<div class="description">
-    Searches the item relatives to the key and to the nodes that satisfy the condition represented by the callback
-    function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to find.</dd>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>{RBNode} The node from which start the search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(node){return(node.key===key);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current node to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item found or undefined if there isn't the key in the tree.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="successor"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{RBNode}</span>
-    <b>successor</b>(node)
-
-</div>
-<div class="description">
-    Gets the node with the key next to the param node key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBNode} The node of which search the successor.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{RBNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="toArray"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>toArray</b>()
-
-</div>
-<div class="description">
-    Transforms the tree into an array without preserving keys.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that represents the tree.</dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/RBTreeIterator.html b/doc/symbols/RBTreeIterator.html
deleted file mode 100644
index 7bcbdf1..0000000
--- a/doc/symbols/RBTreeIterator.html
+++ /dev/null
@@ -1,669 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - RBTreeIterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class RBTreeIterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class RBTreeIterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeIterator.html#constructor">RBTreeIterator</a></b>(aggregate)
-            </div>
-            <div class="description">Class that implements the iterator for a red-black tree.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class RBTreeIterator.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeIterator.html#aggregate">aggregate</a></b>
-            </div>
-            <div class="description">The aggregate relates to this iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeIterator.html#pointer">pointer</a></b>
-            </div>
-            <div class="description">The pointer to the position.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class RBTreeIterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeIterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeIterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeIterator.html#getNode">getNode</a></b>()
-            </div>
-            <div class="description">Returns the node stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeIterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeIterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeIterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeIterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>RBTreeIterator</b>(aggregate)
-    </div>
-
-    <div class="description">
-        Class that implements the iterator for a red-black tree.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>aggregate</b>
-
-        </dt>
-        <dd>{RBTree} The aggregate to scan.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="aggregate"> </a>
-
-<div class="fixedFont">
-
-
-    <b>aggregate</b>
-
-</div>
-<div class="description">
-    The aggregate relates to this iterator.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointer"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointer</b>
-
-</div>
-<div class="description">
-    The pointer to the position.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Object|undefined}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Object|undefined}</span> The item stored or undefined if it's out of the bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{RBNode|null}</span>
-    <b>getNode</b>()
-
-</div>
-<div class="description">
-    Returns the node stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{RBNode|null}</span> The node stored or null if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/RBTreeList.html b/doc/symbols/RBTreeList.html
deleted file mode 100644
index 2cc5327..0000000
--- a/doc/symbols/RBTreeList.html
+++ /dev/null
@@ -1,1651 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - RBTreeList</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class RBTreeList
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the constructor documented in the class RBTreeList.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeList.html#constructor">RBTreeList</a></b>()
-            </div>
-            <div class="description">Class for managing a red-black tree where nodes are also in a list.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class RBTreeList.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeList.html#first">first</a></b>
-            </div>
-            <div class="description">The first node of the tree.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeList.html#last">last</a></b>
-            </div>
-            <div class="description">The last node of the tree.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeList.html#root">root</a></b>
-            </div>
-            <div class="description">The root of the tree.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeList.html#size">size</a></b>
-            </div>
-            <div class="description">The size of the tree.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class RBTreeList.">
-<caption>Method Summary</caption>
-<thead>
-<tr>
-    <th scope="col">Method Attributes</th>
-    <th scope="col">Method Name and Description</th>
-</tr>
-</thead>
-<tbody>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#allIndexesOf">allIndexesOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns all the position in which the item has been found in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#clear">clear</a></b>()
-        </div>
-        <div class="description">Removes all the items stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#clone">clone</a></b>()
-        </div>
-        <div class="description">Clones the tree into a new tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#cloneDistinct">cloneDistinct</a></b>()
-        </div>
-        <div class="description">Clones the tree into a new tree without cloning duplicated items.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#contains">contains</a></b>(key, callback)
-        </div>
-        <div class="description">Checks if the tree contains a key or a node that satisfy the condition represented by
-            the callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#deleteFixUp">deleteFixUp</a></b>(node, parent)
-        </div>
-        <div class="description">Preserves the properties of the tree after a deletion.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#deleteNode">deleteNode</a></b>(node)
-        </div>
-        <div class="description">Deletes the node from the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#execute">execute</a></b>(callback)
-        </div>
-        <div class="description">Executes the callback function for each item of the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#filter">filter</a></b>(callback)
-        </div>
-        <div class="description">Returns the items that satisfy the condition determined by the callback.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#fullContains">fullContains</a></b>(callback)
-        </div>
-        <div class="description">Checks if the tree contains a node that satisfy the condition represented by the
-            callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#getItem">getItem</a></b>(index)
-        </div>
-        <div class="description">Returns the item at the position index.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#getIterator">getIterator</a></b>()
-        </div>
-        <div class="description">Returns the iterator relative to the aggregate.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#getSize">getSize</a></b>()
-        </div>
-        <div class="description">Returns the size of the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#indexOf">indexOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns the first position of the item in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#insert">insert</a></b>(key, item)
-        </div>
-        <div class="description">Inserts the item relatives to the key value in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#insertFixUp">insertFixUp</a></b>(node)
-        </div>
-        <div class="description">Preserves the properties of the tree after an insert.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#isEmpty">isEmpty</a></b>()
-        </div>
-        <div class="description">Checks if the tree is empty.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#lastIndexOf">lastIndexOf</a></b>(item, callback)
-        </div>
-        <div class="description">Returns the last position of the item in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#leftRotate">leftRotate</a></b>(node)
-        </div>
-        <div class="description">Rotates the node with its right child.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#maximum">maximum</a></b>(node)
-        </div>
-        <div class="description">Gets the item relatives to the maximum key stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#minimum">minimum</a></b>(node)
-        </div>
-        <div class="description">Gets the item relatives to the minimum key stored in the tree.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#predecessor">predecessor</a></b>(node)
-        </div>
-        <div class="description">Gets the node with the key previous to the param node key.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#rightRotate">rightRotate</a></b>(node)
-        </div>
-        <div class="description">Rotates the node with its left child.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#search">search</a></b>(key, node, callback)
-        </div>
-        <div class="description">Searches the item relatives to the key that satisfy the condition represented by the
-            callback function.
-        </div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#successor">successor</a></b>(node)
-        </div>
-        <div class="description">Gets the node with the key next to the param node key.</div>
-    </td>
-</tr>
-
-<tr>
-    <td class="attributes">&nbsp;</td>
-    <td class="nameDescription">
-        <div class="fixedFont"><b><a href="../symbols/RBTreeList.html#toArray">toArray</a></b>()
-        </div>
-        <div class="description">Transforms the tree into an array without preserving keys.</div>
-    </td>
-</tr>
-
-</tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>RBTreeList</b>()
-    </div>
-
-    <div class="description">
-        Class for managing a red-black tree where nodes are also in a list.
-
-    </div>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-
-    <b>first</b>
-
-</div>
-<div class="description">
-    The first node of the tree.
-
-
-</div>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-
-    <b>last</b>
-
-</div>
-<div class="description">
-    The last node of the tree.
-
-
-</div>
-
-
-<hr/>
-
-<a name="root"> </a>
-
-<div class="fixedFont">
-
-
-    <b>root</b>
-
-</div>
-<div class="description">
-    The root of the tree.
-
-
-</div>
-
-
-<hr/>
-
-<a name="size"> </a>
-
-<div class="fixedFont">
-
-
-    <b>size</b>
-
-</div>
-<div class="description">
-    The size of the tree.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="allIndexesOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<number>}</span>
-    <b>allIndexesOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns all the position in which the item has been found in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<number>}</span> The positions in which the item has been found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clear"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>clear</b>()
-
-</div>
-<div class="description">
-    Removes all the items stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/RBTreeList.html">RBTreeList</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the tree into a new tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/RBTreeList.html">RBTreeList</a>}</span> The tree cloned from
-        this tree.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="cloneDistinct"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/RBTreeList.html">RBTreeList</a>}</span>
-    <b>cloneDistinct</b>()
-
-</div>
-<div class="description">
-    Clones the tree into a new tree without cloning duplicated items.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/RBTreeList.html">RBTreeList</a>}</span> The tree cloned from
-        this tree.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="contains"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>contains</b>(key, callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{*} The key to find.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(node){return(node.key===key);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current node to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the tree contains the key or a node that satisfy the
-        condition, false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="deleteFixUp"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteFixUp</b>(node, parent)
-
-</div>
-<div class="description">
-    Preserves the properties of the tree after a deletion.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBLNode} The node to delete.</dd>
-
-    <dt>
-        <b>parent</b>
-
-    </dt>
-    <dd>{RBLNode} The parent of the node.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="deleteNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>deleteNode</b>(node)
-
-</div>
-<div class="description">
-    Deletes the node from the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBLNode} The node to delete.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="execute"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>execute</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function to execute for each item. The function must accept the current item on which execute the
-        function.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="filter"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>filter</b>(callback)
-
-</div>
-<div class="description">
-    Returns the items that satisfy the condition determined by the callback.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function that implements the condition.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that contains the items that satisfy the condition.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="fullContains"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>fullContains</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The condition to satisfy. The callback must accept the current node to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the tree contains the node that satisfy the condition,
-        false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>(index)
-
-</div>
-<div class="description">
-    Returns the item at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>{number} The position of the item.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the position. It's undefined if index isn't in the tree
-        bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getIterator"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-    <b>getIterator</b>()
-
-</div>
-<div class="description">
-    Returns the iterator relative to the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getSize"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>getSize</b>()
-
-</div>
-<div class="description">
-    Returns the size of the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The size of the tree.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="indexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>indexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the first position of the item in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The first position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="insert"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>insert</b>(key, item)
-
-</div>
-<div class="description">
-    Inserts the item relatives to the key value in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to store.</dd>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to store.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="insertFixUp"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>insertFixUp</b>(node)
-
-</div>
-<div class="description">
-    Preserves the properties of the tree after an insert.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBLNode} The node to insert.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Checks if the tree is empty.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the tree is empty, false otherwise.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="lastIndexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>lastIndexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the last position of the item in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The last position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="leftRotate"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>leftRotate</b>(node)
-
-</div>
-<div class="description">
-    Rotates the node with its right child.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBLNode} The node to rotate.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="maximum"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{RBLNode}</span>
-    <b>maximum</b>(node)
-
-</div>
-<div class="description">
-    Gets the item relatives to the maximum key stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>{Node} The node from which start the search.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{RBLNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="minimum"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{RBLNode}</span>
-    <b>minimum</b>(node)
-
-</div>
-<div class="description">
-    Gets the item relatives to the minimum key stored in the tree.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>{Node} The node from which start the search.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{RBLNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="predecessor"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{RBLNode}</span>
-    <b>predecessor</b>(node)
-
-</div>
-<div class="description">
-    Gets the node with the key previous to the param node key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBLNode} The node of which search the predecessor.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{RBLNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="rightRotate"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>rightRotate</b>(node)
-
-</div>
-<div class="description">
-    Rotates the node with its left child.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBLNode} The node to rotate.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="search"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>search</b>(key, node, callback)
-
-</div>
-<div class="description">
-    Searches the item relatives to the key that satisfy the condition represented by the callback function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>key</b>
-
-    </dt>
-    <dd>{number} The key to find.</dd>
-
-    <dt>
-        <b>node</b>
-        <i>Optional, Default: root</i>
-    </dt>
-    <dd>{RBNode} The node from which start the search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(k){return(k===key);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current key to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item found or undefined if there isn't the key in the tree.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="successor"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{RBLNode}</span>
-    <b>successor</b>(node)
-
-</div>
-<div class="description">
-    Gets the node with the key next to the param node key.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>node</b>
-
-    </dt>
-    <dd>{RBLNode} The node of which search the successor.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{RBLNode}</span> The node found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="toArray"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>toArray</b>()
-
-</div>
-<div class="description">
-    Transforms the tree into an array without preserving keys.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that represents the tree.</dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/RBTreeListIterator.html b/doc/symbols/RBTreeListIterator.html
deleted file mode 100644
index c1bc7f5..0000000
--- a/doc/symbols/RBTreeListIterator.html
+++ /dev/null
@@ -1,670 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - RBTreeListIterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class RBTreeListIterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class RBTreeListIterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeListIterator.html#constructor">RBTreeListIterator</a></b>(aggregate)
-            </div>
-            <div class="description">Class that implements the iterator for a red-black tree.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the fields documented in the class RBTreeListIterator.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeListIterator.html#aggregate">aggregate</a></b>
-            </div>
-            <div class="description">The aggregate relates to this iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/RBTreeListIterator.html#pointer">pointer</a></b>
-            </div>
-            <div class="description">The pointer to the position.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the methods documented in the class RBTreeListIterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeListIterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeListIterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeListIterator.html#getNode">getNode</a></b>()
-            </div>
-            <div class="description">Returns the node stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeListIterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeListIterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeListIterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/RBTreeListIterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>RBTreeListIterator</b>(aggregate)
-    </div>
-
-    <div class="description">
-        Class that implements the iterator for a red-black tree.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>aggregate</b>
-
-        </dt>
-        <dd>{RBTreeList} The aggregate to scan.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="aggregate"> </a>
-
-<div class="fixedFont">
-
-
-    <b>aggregate</b>
-
-</div>
-<div class="description">
-    The aggregate relates to this iterator.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointer"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointer</b>
-
-</div>
-<div class="description">
-    The pointer to the position.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored or undefined if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getNode"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{RBNode|null}</span>
-    <b>getNode</b>()
-
-</div>
-<div class="description">
-    Returns the node stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{RBNode|null}</span> The node stored or null if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/Set.html b/doc/symbols/Set.html
deleted file mode 100644
index fc233c5..0000000
--- a/doc/symbols/Set.html
+++ /dev/null
@@ -1,968 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - Set</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class Set
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the constructor documented in the class Set.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/Set.html#constructor">Set</a></b>()
-            </div>
-            <div class="description">Class for managing a set.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class Set.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/Set.html#elements">elements</a></b>
-            </div>
-            <div class="description">The elements stored.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/Set.html#parents">parents</a></b>
-            </div>
-            <div class="description">The parents of the set.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/Set.html#sets">sets</a></b>
-            </div>
-            <div class="description">The subsets of this set.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/Set.html#size">size</a></b>
-            </div>
-            <div class="description">The size of the set.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class Set.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#addSubset">addSubset</a></b>(set)
-            </div>
-            <div class="description">Adds the subset.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#addSubsets">addSubsets</a></b>(sets)
-            </div>
-            <div class="description">Adds the subsets.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#cartesianProduct">cartesianProduct</a></b>(set)
-            </div>
-            <div class="description">Returns the set that represents the cartesian product of two sets.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#clone">clone</a></b>()
-            </div>
-            <div class="description">Clones the set into a new set.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#difference">difference</a></b>(set)
-            </div>
-            <div class="description">Returns the set that represents the difference of two sets.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#getCardinality">getCardinality</a></b>()
-            </div>
-            <div class="description">Returns the cardinality of the set.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#getItems">getItems</a></b>()
-            </div>
-            <div class="description">Returns the items that are stored in the set.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#insert">insert</a></b>(element)
-            </div>
-            <div class="description">Adds the element to the set.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#intersect">intersect</a></b>(set)
-            </div>
-            <div class="description">Returns the set that represents the intersection of two sets.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#isEmpty">isEmpty</a></b>()
-            </div>
-            <div class="description">Checks if the set is empty.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#multiInsert">multiInsert</a></b>(elements)
-            </div>
-            <div class="description">Adds the elements to the set.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Set.html#union">union</a></b>(set)
-            </div>
-            <div class="description">Returns the set that represents the union of two sets.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>Set</b>()
-    </div>
-
-    <div class="description">
-        Class for managing a set.
-
-    </div>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="elements"> </a>
-
-<div class="fixedFont">
-
-
-    <b>elements</b>
-
-</div>
-<div class="description">
-    The elements stored.
-
-
-</div>
-
-
-<hr/>
-
-<a name="parents"> </a>
-
-<div class="fixedFont">
-
-
-    <b>parents</b>
-
-</div>
-<div class="description">
-    The parents of the set.
-
-
-</div>
-
-
-<hr/>
-
-<a name="sets"> </a>
-
-<div class="fixedFont">
-
-
-    <b>sets</b>
-
-</div>
-<div class="description">
-    The subsets of this set.
-
-
-</div>
-
-
-<hr/>
-
-<a name="size"> </a>
-
-<div class="fixedFont">
-
-
-    <b>size</b>
-
-</div>
-<div class="description">
-    The size of the set. It's equal to his cardinality.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="addSubset"> </a>
-
-<div class="fixedFont">
-
-
-    <b>addSubset</b>(set)
-
-</div>
-<div class="description">
-    Adds the subset.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>set</b>
-
-    </dt>
-    <dd>{Set} The subset.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="addSubsets"> </a>
-
-<div class="fixedFont">
-
-
-    <b>addSubsets</b>(sets)
-
-</div>
-<div class="description">
-    Adds the subsets.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>sets</b>
-
-    </dt>
-    <dd>{Array
-        <Set>} The subsets.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="cartesianProduct"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Set.html">Set</a>}</span>
-    <b>cartesianProduct</b>(set)
-
-</div>
-<div class="description">
-    Returns the set that represents the cartesian product of two sets.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>set</b>
-
-    </dt>
-    <dd>{Set} The set to make the cartesian product with this.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Set.html">Set</a>}</span> The set that represents the
-        cartesian product .
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Set.html">Set</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the set into a new set.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Set.html">Set</a>}</span> The set cloned from this set.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="difference"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Set.html">Set</a>}</span>
-    <b>difference</b>(set)
-
-</div>
-<div class="description">
-    Returns the set that represents the difference of two sets.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>set</b>
-
-    </dt>
-    <dd>{Set} The set to difference with this.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Set.html">Set</a>}</span> The set that represents the
-        difference.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getCardinality"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>getCardinality</b>()
-
-</div>
-<div class="description">
-    Returns the cardinality of the set.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The cardinality of the set.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItems"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array}</span>
-    <b>getItems</b>()
-
-</div>
-<div class="description">
-    Returns the items that are stored in the set.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array}</span> The items stored.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="insert"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>insert</b>(element)
-
-</div>
-<div class="description">
-    Adds the element to the set.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>element</b>
-
-    </dt>
-    <dd>{Element} The element to add.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="intersect"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Set.html">Set</a>}</span>
-    <b>intersect</b>(set)
-
-</div>
-<div class="description">
-    Returns the set that represents the intersection of two sets.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>set</b>
-
-    </dt>
-    <dd>{Set} The set to intersect with this.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Set.html">Set</a>}</span> The set that represents the
-        intersection.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Checks if the set is empty.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the set is empty, false otherwise.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiInsert"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>multiInsert</b>(elements)
-
-</div>
-<div class="description">
-    Adds the elements to the set.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>elements</b>
-
-    </dt>
-    <dd>{Array
-        <Element>} The elements to add.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="union"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Set.html">Set</a>}</span>
-    <b>union</b>(set)
-
-</div>
-<div class="description">
-    Returns the set that represents the union of two sets.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>set</b>
-
-    </dt>
-    <dd>{Set} The set with make the union.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Set.html">Set</a>}</span> The set that represents the union.
-    </dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/Stack.html b/doc/symbols/Stack.html
deleted file mode 100644
index 9024dc6..0000000
--- a/doc/symbols/Stack.html
+++ /dev/null
@@ -1,1166 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - Stack</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class Stack
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the constructor documented in the class Stack.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/Stack.html#constructor">Stack</a></b>(args)
-            </div>
-            <div class="description">Class for managing a stack.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class Stack.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/Stack.html#items">items</a></b>
-            </div>
-            <div class="description">The list of the items in the stack.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class Stack.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#allIndexesOf">allIndexesOf</a></b>(item, callback)
-            </div>
-            <div class="description">Returns all the position in which the item has been found in the stack.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#clear">clear</a></b>()
-            </div>
-            <div class="description">Removes all the items stored in the stack.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#clone">clone</a></b>()
-            </div>
-            <div class="description">Clones the stack into a new stack.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#cloneDistinct">cloneDistinct</a></b>()
-            </div>
-            <div class="description">Clones the stack into a new stack without cloning duplicated items.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#contains">contains</a></b>(item, callback)
-            </div>
-            <div class="description">Checks if the stack contains an item that satisfy the condition represented by the
-                callback function.
-            </div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#execute">execute</a></b>(callback)
-            </div>
-            <div class="description">Executes the callback function for each item of the stack.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#filter">filter</a></b>(callback)
-            </div>
-            <div class="description">Returns the items that satisfy the condition determined by the callback.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#getItem">getItem</a></b>(index)
-            </div>
-            <div class="description">Returns the item at the position index.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#getIterator">getIterator</a></b>()
-            </div>
-            <div class="description">Returns the iterator relative to the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#getLength">getLength</a></b>()
-            </div>
-            <div class="description">Returns the length of the stack.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#indexOf">indexOf</a></b>(item, callback)
-            </div>
-            <div class="description">Returns the first position of the item in the stack.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#isEmpty">isEmpty</a></b>()
-            </div>
-            <div class="description">Checks if the stack is empty.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#lastIndexOf">lastIndexOf</a></b>(item, callback)
-            </div>
-            <div class="description">Returns the last position of the item in the stack.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#multiPop">multiPop</a></b>(times)
-            </div>
-            <div class="description">Removes the more item at the top of the stack.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#multiPush">multiPush</a></b>(items)
-            </div>
-            <div class="description">Adds the items at the top of the stack.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#peek">peek</a></b>()
-            </div>
-            <div class="description">Returns the item at the top of the stack without remove it.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#pop">pop</a></b>()
-            </div>
-            <div class="description">Removes the item at the top of the stack.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/Stack.html#push">push</a></b>(item)
-            </div>
-            <div class="description">Adds the item at the top of the stack.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>Stack</b>(args)
-    </div>
-
-    <div class="description">
-        Class for managing a stack.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <span class="light fixedFont">{...*}</span> <b>args</b>
-            <i>Optional</i>
-        </dt>
-        <dd>The items for initializing the stack.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="items"> </a>
-
-<div class="fixedFont">
-
-
-    <b>items</b>
-
-</div>
-<div class="description">
-    The list of the items in the stack.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="allIndexesOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<number>}</span>
-    <b>allIndexesOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns all the position in which the item has been found in the stack.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<number>}</span> The positions in which the item has been found.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clear"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>clear</b>()
-
-</div>
-<div class="description">
-    Removes all the items stored in the stack.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="clone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Stack.html">Stack</a>}</span>
-    <b>clone</b>()
-
-</div>
-<div class="description">
-    Clones the stack into a new stack.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Stack.html">Stack</a>}</span> The stack cloned from this
-        stack.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="cloneDistinct"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Stack.html">Stack</a>}</span>
-    <b>cloneDistinct</b>()
-
-</div>
-<div class="description">
-    Clones the stack into a new stack without cloning duplicated items.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Stack.html">Stack</a>}</span> The stack cloned from this
-        stack.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="contains"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>contains</b>(item, callback)
-
-</div>
-<div class="description">
-    Checks if the stack contains an item that satisfy the condition represented by the callback function.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to find.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the stack contains the item that satisfy the condition,
-        false otherwise.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="execute"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>execute</b>(callback)
-
-</div>
-<div class="description">
-    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.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function to execute for each item. The function must accept the current item on which execute the
-        function.
-    </dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="filter"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>filter</b>(callback)
-
-</div>
-<div class="description">
-    Returns the items that satisfy the condition determined by the callback.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>callback</b>
-
-    </dt>
-    <dd>{function} The function that implements the condition.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The array that contains the items that satisfy the condition.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>(index)
-
-</div>
-<div class="description">
-    Returns the item at the position index.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>index</b>
-
-    </dt>
-    <dd>The position of the item.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the position. It's undefined if index isn't in the stack
-        bounds.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getIterator"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{<a href="../symbols/Iterator.html">Iterator</a>}</span>
-    <b>getIterator</b>()
-
-</div>
-<div class="description">
-    Returns the iterator relative to the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{<a href="../symbols/Iterator.html">Iterator</a>}</span> The iterator.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getLength"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Number}</span>
-    <b>getLength</b>()
-
-</div>
-<div class="description">
-    Returns the length of the stack.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Number}</span> The length of the stack.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="indexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>indexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the first position of the item in the stack.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The first position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isEmpty"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isEmpty</b>()
-
-</div>
-<div class="description">
-    Checks if the stack is empty.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> True if the stack is empty, false otherwise.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="lastIndexOf"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{number}</span>
-    <b>lastIndexOf</b>(item, callback)
-
-</div>
-<div class="description">
-    Returns the last position of the item in the stack.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to search.</dd>
-
-    <dt>
-        <b>callback</b>
-        <i>Optional, Default: function(item){return(it===item);}</i>
-    </dt>
-    <dd>The condition to satisfy. The callback must accept the current item to check.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{number}</span> The last position of the item.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiPop"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{Array<*>}</span>
-    <b>multiPop</b>(times)
-
-</div>
-<div class="description">
-    Removes the more item at the top of the stack.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>times</b>
-
-    </dt>
-    <dd>{number} The number of times to repeat the pop method.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{Array<*>}</span> The items at the top of the stack.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="multiPush"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>multiPush</b>(items)
-
-</div>
-<div class="description">
-    Adds the items at the top of the stack.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>items</b>
-
-    </dt>
-    <dd>{Array<*>} The items to add.</dd>
-
-</dl>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="peek"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>peek</b>()
-
-</div>
-<div class="description">
-    Returns the item at the top of the stack without remove it.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the top of the stack. It's undefined if the stack is empty.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="pop"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>pop</b>()
-
-</div>
-<div class="description">
-    Removes the item at the top of the stack.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item at the top of the stack. It's undefined if the stack is empty.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="push"> </a>
-
-<div class="fixedFont">
-
-
-    <b>push</b>(item)
-
-</div>
-<div class="description">
-    Adds the item at the top of the stack.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Parameters:</dt>
-
-    <dt>
-        <b>item</b>
-
-    </dt>
-    <dd>{*} The item to add.
-        return {void}
-    </dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/StackIterator.html b/doc/symbols/StackIterator.html
deleted file mode 100644
index 89c3e95..0000000
--- a/doc/symbols/StackIterator.html
+++ /dev/null
@@ -1,634 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - StackIterator</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-<!-- ============================== class title ============================ -->
-<h1 class="classTitle">
-
-    Class StackIterator
-</h1>
-
-<!-- ============================== class summary ========================== -->
-<p class="description">
-
-
-    <br/><i>Defined in: </i> <a href="../symbols/src/C__DataStructures_DataStructures.js.html">DataStructures.js</a>.
-
-</p>
-
-<!-- ============================== constructor summary ==================== -->
-
-<table class="summaryTable" cellspacing="0"
-       summary="A summary of the constructor documented in the class StackIterator.">
-    <caption>Class Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Constructor Attributes</th>
-        <th scope="col">Constructor Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/StackIterator.html#constructor">StackIterator</a></b>(aggregate)
-            </div>
-            <div class="description">Class that implements the iterator for a linked list.</div>
-        </td>
-    </tr>
-    </tbody>
-</table>
-
-
-<!-- ============================== properties summary ===================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the fields documented in the class StackIterator.">
-    <caption>Field Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Field Attributes</th>
-        <th scope="col">Field Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/StackIterator.html#aggregate">aggregate</a></b>
-            </div>
-            <div class="description">The aggregate relates to this iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont">
-                <b><a href="../symbols/StackIterator.html#pointer">pointer</a></b>
-            </div>
-            <div class="description">The pointer to the position.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== methods summary ======================== -->
-
-
-<table class="summaryTable" cellspacing="0" summary="A summary of the methods documented in the class StackIterator.">
-    <caption>Method Summary</caption>
-    <thead>
-    <tr>
-        <th scope="col">Method Attributes</th>
-        <th scope="col">Method Name and Description</th>
-    </tr>
-    </thead>
-    <tbody>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/StackIterator.html#first">first</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the first position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/StackIterator.html#getItem">getItem</a></b>()
-            </div>
-            <div class="description">Returns the item stored at the position pointed by the iterator.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/StackIterator.html#isDone">isDone</a></b>()
-            </div>
-            <div class="description">Checks if the iterator is out of the bounds of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/StackIterator.html#last">last</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the last position of the aggregate.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/StackIterator.html#next">next</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the next item.</div>
-        </td>
-    </tr>
-
-    <tr>
-        <td class="attributes">&nbsp;</td>
-        <td class="nameDescription">
-            <div class="fixedFont"><b><a href="../symbols/StackIterator.html#previous">previous</a></b>()
-            </div>
-            <div class="description">Moves the iterator to the previous item.</div>
-        </td>
-    </tr>
-
-    </tbody>
-</table>
-
-
-<!-- ============================== events summary ======================== -->
-
-
-<!-- ============================== constructor details ==================== -->
-
-<div class="details"><a name="constructor"> </a>
-
-    <div class="sectionTitle">
-        Class Detail
-    </div>
-
-    <div class="fixedFont">
-        <b>StackIterator</b>(aggregate)
-    </div>
-
-    <div class="description">
-        Class that implements the iterator for a linked list.
-
-    </div>
-
-
-    <dl class="detailList">
-        <dt class="heading">Parameters:</dt>
-
-        <dt>
-            <b>aggregate</b>
-
-        </dt>
-        <dd>{Stack} The aggregate to scan.</dd>
-
-    </dl>
-
-
-</div>
-
-
-<!-- ============================== field details ========================== -->
-
-<div class="sectionTitle">
-    Field Detail
-</div>
-
-<a name="aggregate"> </a>
-
-<div class="fixedFont">
-
-
-    <b>aggregate</b>
-
-</div>
-<div class="description">
-    The aggregate relates to this iterator.
-
-
-</div>
-
-
-<hr/>
-
-<a name="pointer"> </a>
-
-<div class="fixedFont">
-
-
-    <b>pointer</b>
-
-</div>
-<div class="description">
-    The pointer to the position.
-
-
-</div>
-
-
-<!-- ============================== method details ========================= -->
-
-<div class="sectionTitle">
-    Method Detail
-</div>
-
-<a name="first"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>first</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the first position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="getItem"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{*}</span>
-    <b>getItem</b>()
-
-</div>
-<div class="description">
-    Returns the item stored at the position pointed by the iterator.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{*}</span> The item stored or undefined if it's out of the bounds.</dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="isDone"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{boolean}</span>
-    <b>isDone</b>()
-
-</div>
-<div class="description">
-    Checks if the iterator is out of the bounds of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{boolean}</span> It return true if the iterator is out of the bounds of the
-        aggregate, otherwise false.
-    </dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="last"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>last</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the last position of the aggregate.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="next"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>next</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the next item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<hr/>
-
-<a name="previous"> </a>
-
-<div class="fixedFont">
-
-    <span class="light">{void}</span>
-    <b>previous</b>()
-
-</div>
-<div class="description">
-    Moves the iterator to the previous item.
-
-
-</div>
-
-
-<dl class="detailList">
-    <dt class="heading">Returns:</dt>
-
-    <dd><span class="light fixedFont">{void}</span></dd>
-
-</dl>
-
-
-<!-- ============================== event details ========================= -->
-
-
-<hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:59 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/_global_.html b/doc/symbols/_global_.html
deleted file mode 100644
index 199bbbb..0000000
--- a/doc/symbols/_global_.html
+++ /dev/null
@@ -1,289 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
-        "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8"/>
-    <meta name="generator" content="JsDoc Toolkit"/>
-
-    <title>JsDoc Reference - _global_</title>
-
-    <style type="text/css">
-        /* default.css */
-        body {
-            font: 12px "Lucida Grande", Tahoma, Arial, Helvetica, sans-serif;
-            width: 800px;
-        }
-
-        .header {
-            clear: both;
-            background-color: #ccc;
-            padding: 8px;
-        }
-
-        h1 {
-            font-size: 150%;
-            font-weight: bold;
-            padding: 0;
-            margin: 1em 0 0 .3em;
-        }
-
-        hr {
-            border: none 0;
-            border-top: 1px solid #7F8FB1;
-            height: 1px;
-        }
-
-        pre.code {
-            display: block;
-            padding: 8px;
-            border: 1px dashed #ccc;
-        }
-
-        #index {
-            margin-top: 24px;
-            float: left;
-            width: 160px;
-            position: absolute;
-            left: 8px;
-            background-color: #F3F3F3;
-            padding: 8px;
-        }
-
-        #content {
-            margin-left: 190px;
-            width: 600px;
-        }
-
-        .classList {
-            list-style-type: none;
-            padding: 0;
-            margin: 0 0 0 8px;
-            font-family: arial, sans-serif;
-            font-size: 1em;
-            overflow: auto;
-        }
-
-        .classList li {
-            padding: 0;
-            margin: 0 0 8px 0;
-        }
-
-        .summaryTable {
-            width: 100%;
-        }
-
-        h1.classTitle {
-            font-size: 170%;
-            line-height: 130%;
-        }
-
-        h2 {
-            font-size: 110%;
-        }
-
-        caption, div.sectionTitle {
-            background-color: #7F8FB1;
-            color: #fff;
-            font-size: 130%;
-            text-align: left;
-            padding: 2px 6px 2px 6px;
-            border: 1px #7F8FB1 solid;
-        }
-
-        div.sectionTitle {
-            margin-bottom: 8px;
-        }
-
-        .summaryTable thead {
-            display: none;
-        }
-
-        .summaryTable td {
-            vertical-align: top;
-            padding: 4px;
-            border-bottom: 1px #7F8FB1 solid;
-            border-right: 1px #7F8FB1 solid;
-        }
-
-        /*col#summaryAttributes {}*/
-        .summaryTable td.attributes {
-            border-left: 1px #7F8FB1 solid;
-            width: 140px;
-            text-align: right;
-        }
-
-        td.attributes, .fixedFont {
-            line-height: 15px;
-            color: #002EBE;
-            font-family: "Courier New", Courier, monospace;
-            font-size: 13px;
-        }
-
-        .summaryTable td.nameDescription {
-            text-align: left;
-            font-size: 13px;
-            line-height: 15px;
-        }
-
-        .summaryTable td.nameDescription, .description {
-            line-height: 15px;
-            padding: 4px;
-            padding-left: 4px;
-        }
-
-        .summaryTable {
-            margin-bottom: 8px;
-        }
-
-        ul.inheritsList {
-            list-style: square;
-            margin-left: 20px;
-            padding-left: 0;
-        }
-
-        .detailList {
-            margin-left: 20px;
-            line-height: 15px;
-        }
-
-        .detailList dt {
-            margin-left: 20px;
-        }
-
-        .detailList .heading {
-            font-weight: bold;
-            padding-bottom: 6px;
-            margin-left: 0;
-        }
-
-        .light, td.attributes, .light a:link, .light a:visited {
-            color: #777;
-            font-style: italic;
-        }
-
-        .fineprint {
-            text-align: right;
-            font-size: 10px;
-        }
-    </style>
-</head>
-
-<body>
-<!-- ============================== header ================================= -->
-<!-- begin static/header.html -->
-<div id="header">
-</div>
-<!-- end static/header.html -->
-
-<!-- ============================== classes index ============================ -->
-<div id="index">
-    <!-- begin publish.classesIndex -->
-    <div align="center"><a href="../index.html">Class Index</a>
-        | <a href="../files.html">File Index</a></div>
-    <hr/>
-    <h2>Classes</h2>
-    <ul class="classList">
-
-        <li><i><a href="../symbols/_global_.html">_global_</a></i></li>
-
-        <li><a href="../symbols/Aggregate.html">Aggregate</a></li>
-
-        <li><a href="../symbols/BSTree.html">BSTree</a></li>
-
-        <li><a href="../symbols/BSTreeIterator.html">BSTreeIterator</a></li>
-
-        <li><a href="../symbols/BTree.html">BTree</a></li>
-
-        <li><a href="../symbols/BTreeIterator.html">BTreeIterator</a></li>
-
-        <li><a href="../symbols/CircularBuffer.html">CircularBuffer</a></li>
-
-        <li><a href="../symbols/CircularBufferIterator.html">CircularBufferIterator</a></li>
-
-        <li><a href="../symbols/DoubleLinkedList.html">DoubleLinkedList</a></li>
-
-        <li><a href="../symbols/DoubleLinkedListIterator.html">DoubleLinkedListIterator</a></li>
-
-        <li><a href="../symbols/HashTable.html">HashTable</a></li>
-
-        <li><a href="../symbols/Iterator.html">Iterator</a></li>
-
-        <li><a href="../symbols/LinkedList.html">LinkedList</a></li>
-
-        <li><a href="../symbols/LinkedListIterator.html">LinkedListIterator</a></li>
-
-        <li><a href="../symbols/PriorityQueue.html">PriorityQueue</a></li>
-
-        <li><a href="../symbols/PriorityQueueIterator.html">PriorityQueueIterator</a></li>
-
-        <li><a href="../symbols/Queue.html">Queue</a></li>
-
-        <li><a href="../symbols/QueueIterator.html">QueueIterator</a></li>
-
-        <li><a href="../symbols/RBTree.html">RBTree</a></li>
-
-        <li><a href="../symbols/RBTreeIterator.html">RBTreeIterator</a></li>
-
-        <li><a href="../symbols/RBTreeList.html">RBTreeList</a></li>
-
-        <li><a href="../symbols/RBTreeListIterator.html">RBTreeListIterator</a></li>
-
-        <li><a href="../symbols/Set.html">Set</a></li>
-
-        <li><a href="../symbols/Stack.html">Stack</a></li>
-
-        <li><a href="../symbols/StackIterator.html">StackIterator</a></li>
-
-    </ul>
-    <hr/>
-    <!-- end publish.classesIndex -->
-</div>
-
-<div id="content">
-    <!-- ============================== class title ============================ -->
-    <h1 class="classTitle">
-
-        Built-In Namespace _global_
-    </h1>
-
-    <!-- ============================== class summary ========================== -->
-    <p class="description">
-
-
-    </p>
-
-    <!-- ============================== constructor summary ==================== -->
-
-
-    <!-- ============================== properties summary ===================== -->
-
-
-    <!-- ============================== methods summary ======================== -->
-
-    <!-- ============================== events summary ======================== -->
-
-
-    <!-- ============================== constructor details ==================== -->
-
-
-    <!-- ============================== field details ========================== -->
-
-
-    <!-- ============================== method details ========================= -->
-
-
-    <!-- ============================== event details ========================= -->
-
-
-    <hr/>
-</div>
-
-
-<!-- ============================== footer ================================= -->
-<div class="fineprint" style="clear:both">
-
-    Documentation generated by <a href="http://code.google.com/p/jsdoc-toolkit/" target="_blank">JsDoc Toolkit</a> 2.4.0
-    on Wed Apr 23 2014 22:40:58 GMT+0200 (CEST)
-</div>
-</body>
-</html>
diff --git a/doc/symbols/src/C__DataStructures_DataStructures.js.html b/doc/symbols/src/C__DataStructures_DataStructures.js.html
deleted file mode 100644
index c5a6ae0..0000000
--- a/doc/symbols/src/C__DataStructures_DataStructures.js.html
+++ /dev/null
@@ -1,12882 +0,0 @@
-<html>
-<head>
-    <meta http-equiv="content-type" content="text/html; charset=utf-8">
-    <style>
-        .KEYW {
-            color: #933;
-        }
-
-        .COMM {
-            color: #bbb;
-            font-style: italic;
-        }
-
-        .NUMB {
-            color: #393;
-        }
-
-        .STRN {
-            color: #393;
-        }
-
-        .REGX {
-            color: #339;
-        }
-
-        .line {
-            border-right: 1px dotted #666;
-            color: #666;
-            font-style: normal;
-        }
-    </style>
-</head>
-<body>
-<pre><span class='line'>  1</span> <span class="COMM">/**
-<span class='line'>  2</span>  * Interface for managing a generic data structure.
-<span class='line'>  3</span>  * @constructor
-<span class='line'>  4</span>  * @interface
-<span class='line'>  5</span>  */</span><span class="WHIT">
-<span class='line'>  6</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">Aggregate</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>  7</span> 
-<span class='line'>  8</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>  9</span> 
-<span class='line'> 10</span> </span><span class="COMM">/**
-<span class='line'> 11</span>  * Returns the iterator relative to the aggregate.
-<span class='line'> 12</span>  * @abstract
-<span class='line'> 13</span>  * @return {Iterator} The iterator.
-<span class='line'> 14</span>  */</span><span class="WHIT">
-<span class='line'> 15</span> </span><span class="NAME">Aggregate.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'> 16</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'> 17</span> 
-<span class='line'> 18</span> </span><span class="COMM">/**
-<span class='line'> 19</span>  * Interface for managing an iterator for an aggregate.
-<span class='line'> 20</span>  * @constructor
-<span class='line'> 21</span>  * @interface
-<span class='line'> 22</span>  */</span><span class="WHIT">
-<span class='line'> 23</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">Iterator</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'> 24</span> 
-<span class='line'> 25</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'> 26</span> 
-<span class='line'> 27</span> </span><span class="COMM">/**
-<span class='line'> 28</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'> 29</span>  * @abstract
-<span class='line'> 30</span>  * @return {void}
-<span class='line'> 31</span>  */</span><span class="WHIT">
-<span class='line'> 32</span> </span><span class="NAME">Iterator.prototype.first</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'> 33</span> 
-<span class='line'> 34</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'> 35</span> 
-<span class='line'> 36</span> </span><span class="COMM">/**
-<span class='line'> 37</span>  * Moves the iterator to the next item.
-<span class='line'> 38</span>  * @abstract
-<span class='line'> 39</span>  * @return {void}
-<span class='line'> 40</span>  */</span><span class="WHIT">
-<span class='line'> 41</span> </span><span class="NAME">Iterator.prototype.next</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'> 42</span> 
-<span class='line'> 43</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'> 44</span> 
-<span class='line'> 45</span> </span><span class="COMM">/**
-<span class='line'> 46</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'> 47</span>  * @abstract
-<span class='line'> 48</span>  * @return {void}
-<span class='line'> 49</span>  */</span><span class="WHIT">
-<span class='line'> 50</span> </span><span class="NAME">Iterator.prototype.last</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'> 51</span> 
-<span class='line'> 52</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'> 53</span> 
-<span class='line'> 54</span> </span><span class="COMM">/**
-<span class='line'> 55</span>  * Moves the iterator to the previous item.
-<span class='line'> 56</span>  * @abstract
-<span class='line'> 57</span>  * @return {void}
-<span class='line'> 58</span>  */</span><span class="WHIT">
-<span class='line'> 59</span> </span><span class="NAME">Iterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'> 60</span> 
-<span class='line'> 61</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'> 62</span> 
-<span class='line'> 63</span> </span><span class="COMM">/**
-<span class='line'> 64</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'> 65</span>  * @abstract
-<span class='line'> 66</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'> 67</span>  */</span><span class="WHIT">
-<span class='line'> 68</span> </span><span class="NAME">Iterator.prototype.isDone</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'> 69</span> 
-<span class='line'> 70</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'> 71</span> 
-<span class='line'> 72</span> </span><span class="COMM">/**
-<span class='line'> 73</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'> 74</span>  * @abstract
-<span class='line'> 75</span>  * @return {*} The item stored or undefined if it's out of the bounds.
-<span class='line'> 76</span>  */</span><span class="WHIT">
-<span class='line'> 77</span> </span><span class="NAME">Iterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'> 78</span> 
-<span class='line'> 79</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'> 80</span> 
-<span class='line'> 81</span> </span><span class="COMM">/**
-<span class='line'> 82</span>  * Class for managing a binary search tree.
-<span class='line'> 83</span>  * @constructor
-<span class='line'> 84</span>  */</span><span class="WHIT">
-<span class='line'> 85</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">BSTree</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'> 86</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'> 87</span> 	 * The root of the tree.
-<span class='line'> 88</span> 	 * @type {BSNode|null}
-<span class='line'> 89</span> 	 */</span><span class="WHIT">
-<span class='line'> 90</span> </span><span class="WHIT">	</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'> 91</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'> 92</span> 
-<span class='line'> 93</span> </span><span class="COMM">/**
-<span class='line'> 94</span>  * Returns the iterator relative to the aggregate.
-<span class='line'> 95</span>  * @return {Iterator} The iterator.
-<span class='line'> 96</span>  */</span><span class="WHIT">
-<span class='line'> 97</span> </span><span class="NAME">BSTree.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'> 98</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">BSTreeIterator</span><span class="PUNC">(</span><span class="KEYW">this</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'> 99</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>100</span> 
-<span class='line'>101</span> </span><span class="COMM">/**
-<span class='line'>102</span>  * Inserts the item relatives to the key value in the tree.
-<span class='line'>103</span>  * @param key {number} The key to store.
-<span class='line'>104</span>  * @param item {*} The item to store.
-<span class='line'>105</span>  * @return {void}
-<span class='line'>106</span>  */</span><span class="WHIT">
-<span class='line'>107</span> </span><span class="NAME">BSTree.prototype.insert</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>108</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">BSNode</span><span class="PUNC">(</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>109</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">p</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>110</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">n</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">n</span><span class="PUNC">;</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>111</span> </span><span class="WHIT">		</span><span class="NAME">p</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">n</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>112</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">n.key</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>113</span> </span><span class="WHIT">			</span><span class="NAME">n</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">n.left</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>114</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>115</span> </span><span class="WHIT">			</span><span class="NAME">n</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">n.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>116</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>117</span> </span><span class="WHIT">	</span><span class="NAME">node.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">p</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>118</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">p</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>119</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>120</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">p.key</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>121</span> </span><span class="WHIT">		</span><span class="NAME">p.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>122</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>123</span> </span><span class="WHIT">		</span><span class="NAME">p.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>124</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>125</span> 
-<span class='line'>126</span> </span><span class="COMM">/**
-<span class='line'>127</span>  * Searches the item relatives to the key.
-<span class='line'>128</span>  * @param key {Number} The key to find.
-<span class='line'>129</span>  * @param [node = root] {BSNode} The node from which start the search.
-<span class='line'>130</span>  * @return {*} The item found or undefined if there isn't the key in the tree.
-<span class='line'>131</span>  */</span><span class="WHIT">
-<span class='line'>132</span> </span><span class="NAME">BSTree.prototype.search</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>133</span> </span><span class="WHIT">	</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>134</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="NAME">node.key</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>135</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.key</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>136</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>137</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>138</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>139</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>140</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>141</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>142</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>143</span> 
-<span class='line'>144</span> </span><span class="COMM">/**
-<span class='line'>145</span>  * Gets the item relatives to the minimum key stored in the tree.
-<span class='line'>146</span>  * @param [node = root] {Node} The node from which start the search.
-<span class='line'>147</span>  * @return {BSNode} The node found.
-<span class='line'>148</span>  */</span><span class="WHIT">
-<span class='line'>149</span> </span><span class="NAME">BSTree.prototype.minimum</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>150</span> </span><span class="WHIT">	</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>151</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node.left</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>152</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>153</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>154</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>155</span> 
-<span class='line'>156</span> </span><span class="COMM">/**
-<span class='line'>157</span>  * Gets the item relatives to the maximum key stored in the tree.
-<span class='line'>158</span>  * @param [node = root] {Node} The node from which start the search.
-<span class='line'>159</span>  * @return {BSNode} The node found.
-<span class='line'>160</span>  */</span><span class="WHIT">
-<span class='line'>161</span> </span><span class="NAME">BSTree.prototype.maximum</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>162</span> </span><span class="WHIT">	</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>163</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node.right</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>164</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>165</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>166</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>167</span> 
-<span class='line'>168</span> </span><span class="COMM">/**
-<span class='line'>169</span>  * Gets the node with the key next to the param node key.
-<span class='line'>170</span>  * @param node {BSNode} The node of which search the successor.
-<span class='line'>171</span>  * @return {BSNode} The node found.
-<span class='line'>172</span>  */</span><span class="WHIT">
-<span class='line'>173</span> </span><span class="NAME">BSTree.prototype.successor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>174</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>175</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.minimum</span><span class="PUNC">(</span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>176</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>177</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">parent</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.right</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>178</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>179</span> </span><span class="WHIT">		</span><span class="NAME">parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>180</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>181</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>182</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>183</span> 
-<span class='line'>184</span> </span><span class="COMM">/**
-<span class='line'>185</span>  * Gets the node with the key previous to the param node key.
-<span class='line'>186</span>  * @param node {BSNode} The node of which search the predecessor.
-<span class='line'>187</span>  * @return {BSNode} The node found.
-<span class='line'>188</span>  */</span><span class="WHIT">
-<span class='line'>189</span> </span><span class="NAME">BSTree.prototype.predecessor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>190</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.left</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>191</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.maximum</span><span class="PUNC">(</span><span class="NAME">node.left</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>192</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>193</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">parent</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>194</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>195</span> </span><span class="WHIT">		</span><span class="NAME">parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>196</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>197</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>198</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>199</span> 
-<span class='line'>200</span> </span><span class="COMM">/**
-<span class='line'>201</span>  * Deletes the node from the tree.
-<span class='line'>202</span>  * @param node {BSNode} The node to delete.
-<span class='line'>203</span>  * @return {void}
-<span class='line'>204</span>  */</span><span class="WHIT">
-<span class='line'>205</span> </span><span class="NAME">BSTree.prototype.deleteNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>206</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">node.left</span><span class="WHIT"> </span><span class="PUNC">&&</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>207</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>208</span> </span><span class="WHIT">			</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>209</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">node.parent.left</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>210</span> </span><span class="WHIT">			</span><span
-        class="NAME">node.parent.left</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>211</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>212</span> </span><span class="WHIT">			</span><span
-        class="NAME">node.parent.right</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>213</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.left</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>214</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.successor</span><span class="PUNC">(</span><span
-        class="NAME">node</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>215</span> </span><span class="WHIT">		</span><span class="NAME">node.key</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">next.key</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>216</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">next.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>217</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">next.parent.left</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">next</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>218</span> </span><span class="WHIT">			</span><span
-        class="NAME">next.parent.left</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>219</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>220</span> </span><span class="WHIT">			</span><span
-        class="NAME">next.parent.right</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>221</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>222</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>223</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>224</span> </span><span class="WHIT">				</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>225</span> </span><span class="WHIT">				</span><span
-        class="NAME">node.right.parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>226</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>227</span> </span><span class="WHIT">				</span><span
-        class="NAME">node.parent.right</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>228</span> </span><span class="WHIT">				</span><span
-        class="NAME">node.right.parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>229</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>230</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>231</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>232</span> </span><span class="WHIT">				</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>233</span> </span><span class="WHIT">				</span><span
-        class="NAME">node.left.parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>234</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>235</span> </span><span class="WHIT">				</span><span
-        class="NAME">node.parent.left</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>236</span> </span><span class="WHIT">				</span><span
-        class="NAME">node.left.parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>237</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>238</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>239</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>240</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>241</span> 
-<span class='line'>242</span> </span><span class="COMM">/**
-<span class='line'>243</span>  * Class that implements the iterator for a binary search tree.
-<span class='line'>244</span>  * @param aggregate {BSTree} The aggregate to scan.
-<span class='line'>245</span>  * @constructor
-<span class='line'>246</span>  */</span><span class="WHIT">
-<span class='line'>247</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">BSTreeIterator</span><span
-        class="PUNC">(</span><span class="NAME">aggregate</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>248</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>249</span> 	 * The aggregate relates to this iterator.
-<span class='line'>250</span> 	 * @type {BSTree}
-<span class='line'>251</span> 	 */</span><span class="WHIT">
-<span class='line'>252</span> </span><span class="WHIT">	</span><span class="NAME">this.aggregate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">aggregate</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>253</span> 
-<span class='line'>254</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>255</span> 	 * The pointer to the position.
-<span class='line'>256</span> 	 * @type {BSNode|null}
-<span class='line'>257</span> 	 */</span><span class="WHIT">
-<span class='line'>258</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>259</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>260</span> 
-<span class='line'>261</span> </span><span class="COMM">/**
-<span class='line'>262</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'>263</span>  * @return {void}
-<span class='line'>264</span>  */</span><span class="WHIT">
-<span class='line'>265</span> </span><span class="NAME">BSTreeIterator.prototype.first</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>266</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.minimum</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>267</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>268</span> 
-<span class='line'>269</span> </span><span class="COMM">/**
-<span class='line'>270</span>  * Moves the iterator to the next item.
-<span class='line'>271</span>  * @return {void}
-<span class='line'>272</span>  */</span><span class="WHIT">
-<span class='line'>273</span> </span><span class="NAME">BSTreeIterator.prototype.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>274</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.successor</span><span
-        class="PUNC">(</span><span class="NAME">this.pointer</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>275</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>276</span> 
-<span class='line'>277</span> </span><span class="COMM">/**
-<span class='line'>278</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'>279</span>  * @return {void}
-<span class='line'>280</span>  */</span><span class="WHIT">
-<span class='line'>281</span> </span><span class="NAME">BSTreeIterator.prototype.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>282</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.maximum</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>283</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>284</span> 
-<span class='line'>285</span> </span><span class="COMM">/**
-<span class='line'>286</span>  * Moves the iterator to the previous item.
-<span class='line'>287</span>  * @return {void}
-<span class='line'>288</span>  */</span><span class="WHIT">
-<span class='line'>289</span> </span><span class="NAME">BSTreeIterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>290</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.predecessor</span><span
-        class="PUNC">(</span><span class="NAME">this.pointer</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>291</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>292</span> 
-<span class='line'>293</span> </span><span class="COMM">/**
-<span class='line'>294</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'>295</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'>296</span>  */</span><span class="WHIT">
-<span class='line'>297</span> </span><span class="NAME">BSTreeIterator.prototype.isDone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>298</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.pointer</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>299</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>300</span> 
-<span class='line'>301</span> </span><span class="COMM">/**
-<span class='line'>302</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'>303</span>  * @return {*} The item stored or undefined if it's out of the bounds.
-<span class='line'>304</span>  */</span><span class="WHIT">
-<span class='line'>305</span> </span><span class="NAME">BSTreeIterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>306</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>307</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>308</span> 
-<span class='line'>309</span> </span><span class="COMM">/**
-<span class='line'>310</span>  * Returns the node stored at the position pointed by the iterator.
-<span class='line'>311</span>  * @return {BSNode|null} The node stored or null if it's out of the bounds.
-<span class='line'>312</span>  */</span><span class="WHIT">
-<span class='line'>313</span> </span><span class="NAME">BSTreeIterator.prototype.getNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>314</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>315</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>316</span> 
-<span class='line'>317</span> </span><span class="COMM">/**
-<span class='line'>318</span>  * Class for managing a B-Tree.
-<span class='line'>319</span>  * @param minimumDegree {number} The minimum number of keys of a node.
-<span class='line'>320</span>  * @constructor
-<span class='line'>321</span>  */</span><span class="WHIT">
-<span class='line'>322</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">BTree</span><span
-        class="PUNC">(</span><span class="NAME">minimumDegree</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>323</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>324</span> 	 * The root of the tree.
-<span class='line'>325</span> 	 * @type {BNode}
-<span class='line'>326</span> 	 */</span><span class="WHIT">
-<span class='line'>327</span> </span><span class="WHIT">	</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span
-        class="WHIT"> </span><span class="NAME">BNode</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>328</span> 
-<span class='line'>329</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>330</span> 	 * The minimum number of the keys of a node.
-<span class='line'>331</span> 	 * @type {number}
-<span class='line'>332</span> 	 */</span><span class="WHIT">
-<span class='line'>333</span> </span><span class="WHIT">	</span><span class="NAME">this.t</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">minimumDegree</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>334</span> 
-<span class='line'>335</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>336</span> 	 * The number of items stored in the tree.
-<span class='line'>337</span> 	 * @type {number}
-<span class='line'>338</span> 	 */</span><span class="WHIT">
-<span class='line'>339</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>340</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>341</span> 
-<span class='line'>342</span> </span><span class="COMM">/**
-<span class='line'>343</span>  * Returns the iterator relative to the aggregate.
-<span class='line'>344</span>  * @return {Iterator} The iterator.
-<span class='line'>345</span>  */</span><span class="WHIT">
-<span class='line'>346</span> </span><span class="NAME">BTree.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>347</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">BTreeIterator</span><span class="PUNC">(</span><span class="KEYW">this</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>348</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>349</span> 
-<span class='line'>350</span> </span><span class="COMM">/**
-<span class='line'>351</span>  * Inserts the item relatives to the key value in the tree.
-<span class='line'>352</span>  * @param key {number} The key to store.
-<span class='line'>353</span>  * @param item {*} The item to store.
-<span class='line'>354</span>  * @return {void}
-<span class='line'>355</span>  */</span><span class="WHIT">
-<span class='line'>356</span> </span><span class="NAME">BTree.prototype.insert</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>357</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>358</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NUMB">2</span><span
-        class="WHIT"> </span><span class="PUNC">*</span><span class="WHIT"> </span><span class="NAME">this.t</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>359</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">newNode</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">BNode</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>360</span> </span><span class="WHIT">		</span><span
-        class="NAME">newNode.childs.push</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>361</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">newNode</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>362</span> </span><span class="WHIT">		</span><span class="NAME">this.splitChild</span><span
-        class="PUNC">(</span><span class="NAME">newNode</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>363</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">newNode</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>364</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>365</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>366</span> </span><span class="WHIT">	</span><span class="NAME">this.insertNonFull</span><span
-        class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>367</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>368</span> 
-<span class='line'>369</span> </span><span class="COMM">/**
-<span class='line'>370</span>  * Inserts the new node in the right position if the node is not full.
-<span class='line'>371</span>  * @param node {BNode} The node from which start to check the insertion.
-<span class='line'>372</span>  * @param key {number} The key to store.
-<span class='line'>373</span>  * @param item {*} The item to store.
-<span class='line'>374</span>  * @return {void}
-<span class='line'>375</span>  */</span><span class="WHIT">
-<span class='line'>376</span> </span><span class="NAME">BTree.prototype.insertNonFull</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>377</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>378</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.keys.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>379</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">node.childs.length</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>380</span> </span><span class="WHIT">			</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="NUMB">1</span><span class="WHIT"> </span><span class="PUNC">&&</span><span
-        class="WHIT"> </span><span class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span
-        class="WHIT"> </span><span class="NAME">node.keys</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>381</span> </span><span class="WHIT">				</span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>382</span> </span><span class="WHIT">				</span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>383</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>384</span> </span><span class="WHIT">			</span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>385</span> </span><span class="WHIT">			</span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>386</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>387</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>388</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>389</span> </span><span class="WHIT">			</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>390</span> </span><span class="WHIT">			</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">j</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>391</span> </span><span class="WHIT">				</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">Math.floor</span><span class="PUNC">(</span><span
-        class="PUNC">(</span><span class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">/</span><span class="WHIT"> </span><span class="NUMB">2</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>392</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;=</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">m</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>393</span> </span><span class="WHIT">					</span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>394</span> </span><span class="WHIT">				</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>395</span> </span><span class="WHIT">					</span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>396</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>397</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.childs</span><span class="PUNC">[</span><span
-        class="NAME">j</span><span class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NUMB">2</span><span
-        class="WHIT"> </span><span class="PUNC">*</span><span class="WHIT"> </span><span class="NAME">this.t</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>398</span> </span><span class="WHIT">				</span><span class="NAME">this.splitChild</span><span
-        class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>399</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>400</span> </span><span class="WHIT">					</span><span class="NAME">j</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>401</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>402</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>403</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>404</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>405</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>406</span> 
-<span class='line'>407</span> </span><span class="COMM">/**
-<span class='line'>408</span>  * Searches the item relatives to the key that satisfy the condition represented by the callback function.
-<span class='line'>409</span>  * @param key {Number} The key to find.
-<span class='line'>410</span>  * @param [node = root] {RBNode} The node from which start the search.
-<span class='line'>411</span>  * @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.
-<span class='line'>412</span>  * @return {*} The item found or undefined if there isn't the key in the tree.
-<span class='line'>413</span>  */</span><span class="WHIT">
-<span class='line'>414</span> </span><span class="NAME">BTree.prototype.search</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>415</span> </span><span class="WHIT">	</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>416</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>417</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.keys</span><span class="PUNC">[</span><span
-        class="NAME">index</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>418</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>419</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>420</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">n</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.keys.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>421</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">n</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>422</span> </span><span class="WHIT">		</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>423</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">Math.floor</span><span class="PUNC">(</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">/</span><span class="WHIT"> </span><span class="NUMB">2</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>424</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;=</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">m</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>425</span> </span><span class="WHIT">				</span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>426</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>427</span> </span><span class="WHIT">				</span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>428</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>429</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">n</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>430</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>431</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">!</span><span class="NAME">node.childs.length</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>432</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>433</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>434</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>435</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>436</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>437</span> 
-<span class='line'>438</span> </span><span class="COMM">/**
-<span class='line'>439</span>  * Splits the child of the node at the position index.
-<span class='line'>440</span>  * @param node {BNode} The parent of the child to split.
-<span class='line'>441</span>  * @param index {number} The position of the child to split.
-<span class='line'>442</span>  * @return {void}
-<span class='line'>443</span>  */</span><span class="WHIT">
-<span class='line'>444</span> </span><span class="NAME">BTree.prototype.splitChild</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>445</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">newNode</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">BNode</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>446</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.childs</span><span class="PUNC">[</span><span
-        class="NAME">index</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>447</span> </span><span class="WHIT">	</span><span class="COMM">//copy of the last t - 1 keys and items in the new node</span><span
-        class="WHIT">
-<span class='line'>448</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.t</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>449</span> </span><span class="WHIT">		</span><span class="NAME">newNode.keys</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.keys</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">this.t</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>450</span> </span><span class="WHIT">		</span><span class="NAME">newNode.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span
-        class="NAME">this.t</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>451</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>452</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">child.childs.length</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>453</span> </span><span class="WHIT">	</span><span class="COMM">//copy of the last t child in the new node</span><span
-        class="WHIT">
-<span class='line'>454</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.t</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>455</span> </span><span class="WHIT">			</span><span class="NAME">newNode.childs</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.childs</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">this.t</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>456</span> </span><span class="WHIT">	</span><span class="COMM">//shift the children from index + 1 position</span><span
-        class="WHIT">
-<span class='line'>457</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">l</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.keys.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">l</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">l</span><span
-        class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>458</span> </span><span class="WHIT">		</span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NAME">l</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.childs</span><span class="PUNC">[</span><span
-        class="NAME">l</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>459</span> </span><span class="WHIT">	</span><span class="COMM">//set the index position as the position t of the child</span><span
-        class="WHIT">
-<span class='line'>460</span> </span><span class="WHIT">	</span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">newNode</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>461</span> </span><span class="WHIT">	</span><span class="COMM">//shift the keys and the items from index position</span><span
-        class="WHIT">
-<span class='line'>462</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.keys.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">k</span><span
-        class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>463</span> </span><span class="WHIT">		</span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">k</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>464</span> </span><span class="WHIT">		</span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">k</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>465</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>466</span> </span><span class="WHIT">	</span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.keys</span><span
-        class="PUNC">[</span><span class="NAME">this.t</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>467</span> </span><span class="WHIT">	</span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.items</span><span class="PUNC">[</span><span
-        class="NAME">this.t</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>468</span> </span><span class="WHIT">	</span><span class="COMM">//remove keys, items and child in the old node.</span><span
-        class="WHIT">
-<span class='line'>469</span> </span><span class="WHIT">	</span><span class="NAME">child.keys.splice</span><span
-        class="PUNC">(</span><span class="NAME">child.keys.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">this.t</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>470</span> </span><span class="WHIT">	</span><span class="NAME">child.items.splice</span><span
-        class="PUNC">(</span><span class="NAME">child.items.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">this.t</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>471</span> </span><span class="WHIT">	</span><span class="NAME">child.childs.splice</span><span
-        class="PUNC">(</span><span class="NAME">child.childs.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NAME">this.t</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>472</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>473</span> 
-<span class='line'>474</span> </span><span class="COMM">/**
-<span class='line'>475</span>  * Deletes the key from the tree.
-<span class='line'>476</span>  * @param key {*} The key to delete.
-<span class='line'>477</span>  * @return {void}
-<span class='line'>478</span>  */</span><span class="WHIT">
-<span class='line'>479</span> </span><span class="NAME">BTree.prototype.deleteKey</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>480</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.root.keys.length</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>481</span> </span><span class="WHIT">		</span><span class="NAME">this.deleteNonMin</span><span
-        class="PUNC">(</span><span class="NAME">this.root</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>482</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">this.root.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">this.root.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>483</span> </span><span class="WHIT">			</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.root.childs</span><span class="PUNC">[</span><span class="NUMB">0</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>484</span> </span><span class="WHIT">		</span><span class="NAME">this.size</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>485</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>486</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>487</span> 
-<span class='line'>488</span> </span><span class="COMM">/**
-<span class='line'>489</span>  * Deletes a node that's a number of keys greater than the minimum for a node.
-<span class='line'>490</span>  * @param node {BNode} The node to delete.
-<span class='line'>491</span>  * @param key {number} The key to delete.
-<span class='line'>492</span>  * @return {void}
-<span class='line'>493</span>  */</span><span class="WHIT">
-<span class='line'>494</span> </span><span class="NAME">BTree.prototype.deleteNonMin</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>495</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.keys.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>496</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>497</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">Math.floor</span><span class="PUNC">(</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">/</span><span class="WHIT"> </span><span class="NUMB">2</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>498</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;=</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">m</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>499</span> </span><span class="WHIT">			</span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>500</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>501</span> </span><span class="WHIT">			</span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>502</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>503</span> </span><span class="WHIT">	</span><span class="COMM">//key is in the node</span><span
-        class="WHIT">
-<span class='line'>504</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>505</span> </span><span class="WHIT">		</span><span
-        class="COMM">//the node is a leaf</span><span class="WHIT">
-<span class='line'>506</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">node.childs.length</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>507</span> </span><span class="WHIT">			</span><span
-        class="COMM">//remove the key</span><span class="WHIT">
-<span class='line'>508</span> </span><span class="WHIT">			</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">j</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span
-        class="WHIT"> </span><span class="NAME">node.keys.length</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">++</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>509</span> </span><span class="WHIT">				</span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>510</span> </span><span class="WHIT">				</span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>511</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>512</span> </span><span class="WHIT">			</span><span class="NAME">node.keys.pop</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>513</span> </span><span class="WHIT">			</span><span class="NAME">node.items.pop</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>514</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>515</span> </span><span class="WHIT">			</span><span
-        class="COMM">//the node is not a leaf</span><span class="WHIT">
-<span class='line'>516</span> </span><span class="WHIT">			</span><span class="COMM">//the node has the minimum number of keys</span><span
-        class="WHIT">
-<span class='line'>517</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.childs</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">length</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">this.t</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>518</span> </span><span class="WHIT">				</span><span class="COMM">//increase the number of the keys of the node</span><span
-        class="WHIT">
-<span class='line'>519</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.augmentChild</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>520</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">node.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>521</span> </span><span class="WHIT">					</span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>522</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>523</span> </span><span class="WHIT">			</span><span class="COMM">//check if the key is moved in the child</span><span
-        class="WHIT">
-<span class='line'>524</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>525</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.deleteNonMin</span><span class="PUNC">(</span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>526</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>527</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.deleteMax</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>528</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>529</span> </span><span class="WHIT">		</span><span
-        class="COMM">//the key is not in the node</span><span class="WHIT">
-<span class='line'>530</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>531</span> </span><span class="WHIT">		</span><span class="COMM">//check if the child i has the minimum number of keys</span><span
-        class="WHIT">
-<span class='line'>532</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.childs</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">this.t</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>533</span> </span><span class="WHIT">			</span><span
-        class="NAME">this.augmentChild</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>534</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">node.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">2</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>535</span> </span><span class="WHIT">				</span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>536</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>537</span> </span><span class="WHIT">		</span><span class="NAME">this.deleteNonMin</span><span
-        class="PUNC">(</span><span class="NAME">node.childs</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">key</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>538</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>539</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>540</span> 
-<span class='line'>541</span> </span><span class="COMM">/**
-<span class='line'>542</span>  * Deletes a node that have the maximum number of keys for node.
-<span class='line'>543</span>  * @param node {BNode} The node to delete.
-<span class='line'>544</span>  * @param index {number} The key to delete in the node.
-<span class='line'>545</span>  * @return {void}
-<span class='line'>546</span>  */</span><span class="WHIT">
-<span class='line'>547</span> </span><span class="NAME">BTree.prototype.deleteMax</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">index</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>548</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.childs</span><span class="PUNC">[</span><span
-        class="NAME">index</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>549</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">goAhead</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">true</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>550</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">goAhead</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>551</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">child.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>552</span> </span><span class="WHIT">			</span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.keys</span><span
-        class="PUNC">[</span><span class="NAME">child.keys.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>553</span> </span><span class="WHIT">			</span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.items</span><span class="PUNC">[</span><span
-        class="NAME">child.items.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>554</span> </span><span class="WHIT">			</span><span class="NAME">child.keys.pop</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>555</span> </span><span class="WHIT">			</span><span
-        class="NAME">child.items.pop</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>556</span> </span><span class="WHIT">			</span><span class="NAME">goAhead</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">false</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>557</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>558</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">last</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">child.childs</span><span class="PUNC">[</span><span class="NAME">child.keys.length</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>559</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">last.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">this.t</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>560</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.augmentChild</span><span class="PUNC">(</span><span class="NAME">child</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">child.keys.length</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>561</span> </span><span class="WHIT">			</span><span class="NAME">child</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">child.childs</span><span class="PUNC">[</span><span class="NAME">child.keys.length</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>562</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>563</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>564</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>565</span> 
-<span class='line'>566</span> </span><span class="COMM">/**
-<span class='line'>567</span>  * Augments the number of keys stored in the node preserving the order.
-<span class='line'>568</span>  * @param node {BNode} The node to delete.
-<span class='line'>569</span>  * @param index {number} The index of the position to augment.
-<span class='line'>570</span>  * @return {void}
-<span class='line'>571</span>  */</span><span class="WHIT">
-<span class='line'>572</span> </span><span class="NAME">BTree.prototype.augmentChild</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>573</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.childs</span><span class="PUNC">[</span><span
-        class="NAME">index</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>574</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">brother</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>575</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>576</span> </span><span class="WHIT">		</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>577</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">brother.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.t</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>578</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">child.childs.length</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>579</span> </span><span class="WHIT">			</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.keys.length</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>580</span> </span><span class="WHIT">				</span><span
-        class="NAME">child.childs</span><span class="PUNC">[</span><span class="NAME">j</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">child.childs</span><span class="PUNC">[</span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>581</span> </span><span class="WHIT">			</span><span class="NAME">child.childs</span><span
-        class="PUNC">[</span><span class="NUMB">0</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">brother.childs</span><span
-        class="PUNC">[</span><span class="NAME">brother.keys.length</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>582</span> </span><span class="WHIT">			</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">child.keys.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>583</span> </span><span class="WHIT">				</span><span class="NAME">child.keys</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.keys</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>584</span> </span><span class="WHIT">				</span><span
-        class="NAME">child.items</span><span class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>585</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>586</span> </span><span class="WHIT">			</span><span class="NAME">child.keys</span><span
-        class="PUNC">[</span><span class="NUMB">0</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>587</span> </span><span class="WHIT">			</span><span class="NAME">child.items</span><span
-        class="PUNC">[</span><span class="NUMB">0</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>588</span> </span><span class="WHIT">			</span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">brother.keys</span><span
-        class="PUNC">[</span><span class="NAME">brother.keys.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>589</span> </span><span class="WHIT">			</span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">brother.items</span><span
-        class="PUNC">[</span><span class="NAME">brother.items.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>590</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>591</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>592</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.keys.length</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>593</span> </span><span class="WHIT">			</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>594</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">brother.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.t</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>595</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>596</span> </span><span class="WHIT">				</span><span
-        class="NAME">child.childs</span><span class="PUNC">[</span><span class="NAME">child.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">brother.childs</span><span class="PUNC">[</span><span class="NUMB">0</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>597</span> </span><span class="WHIT">				</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">l</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">l</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">brother.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">l</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>598</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother.childs</span><span class="PUNC">[</span><span class="NAME">l</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">brother.childs</span><span class="PUNC">[</span><span class="NAME">l</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>599</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.childs.pop</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>600</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>601</span> </span><span class="WHIT">			</span><span class="NAME">child.keys</span><span
-        class="PUNC">[</span><span class="NAME">child.keys.length</span><span class="PUNC">]</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.keys</span><span class="PUNC">[</span><span class="NAME">index</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>602</span> </span><span class="WHIT">			</span><span class="NAME">child.items</span><span
-        class="PUNC">[</span><span class="NAME">child.items.length</span><span class="PUNC">]</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.items</span><span class="PUNC">[</span><span class="NAME">index</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>603</span> </span><span class="WHIT">			</span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">brother.keys</span><span
-        class="PUNC">[</span><span class="NUMB">0</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>604</span> </span><span class="WHIT">			</span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">brother.items</span><span
-        class="PUNC">[</span><span class="NUMB">0</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>605</span> </span><span class="WHIT">			</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">k</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">brother.keys.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">k</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>606</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.keys</span><span class="PUNC">[</span><span class="NAME">k</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">brother.keys</span><span class="PUNC">[</span><span class="NAME">k</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>607</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.items</span><span class="PUNC">[</span><span class="NAME">k</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">brother.items</span><span class="PUNC">[</span><span class="NAME">k</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>608</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>609</span> </span><span class="WHIT">			</span><span
-        class="NAME">brother.keys.pop</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>610</span> </span><span class="WHIT">			</span><span
-        class="NAME">brother.items.pop</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>611</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>612</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.keys.length</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>613</span> </span><span class="WHIT">				</span><span class="NAME">child.keys</span><span
-        class="PUNC">[</span><span class="NAME">this.t</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">index</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>614</span> </span><span class="WHIT">				</span><span
-        class="NAME">child.items</span><span class="PUNC">[</span><span class="NAME">this.t</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.items</span><span class="PUNC">[</span><span class="NAME">index</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>615</span> </span><span class="WHIT">				</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span
-        class="NUMB">2</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">m</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>616</span> </span><span class="WHIT">					</span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.childs</span><span class="PUNC">[</span><span
-        class="NAME">m</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>617</span> </span><span class="WHIT">				</span><span class="NAME">node.childs.pop</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>618</span> </span><span class="WHIT">				</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">n</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">n</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.keys.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">n</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>619</span> </span><span class="WHIT">					</span><span
-        class="NAME">node.keys</span><span class="PUNC">[</span><span class="NAME">n</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.keys</span><span class="PUNC">[</span><span class="NAME">n</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>620</span> </span><span class="WHIT">					</span><span
-        class="NAME">node.items</span><span class="PUNC">[</span><span class="NAME">n</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.items</span><span class="PUNC">[</span><span class="NAME">n</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>621</span> </span><span class="WHIT">				</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>622</span> </span><span class="WHIT">				</span><span
-        class="NAME">node.keys.pop</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>623</span> </span><span class="WHIT">				</span><span
-        class="NAME">node.items.pop</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>624</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>625</span> </span><span class="WHIT">					</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">y</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">y</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">brother.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">y</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>626</span> </span><span class="WHIT">						</span><span
-        class="NAME">child.childs</span><span class="PUNC">[</span><span class="NAME">this.t</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NAME">y</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">brother.childs</span><span class="PUNC">[</span><span class="NAME">y</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>627</span> </span><span class="WHIT">				</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">x</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">x</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">brother.keys.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">x</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>628</span> </span><span class="WHIT">					</span><span
-        class="NAME">child.keys</span><span class="PUNC">[</span><span class="NAME">x</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NAME">this.t</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">brother.keys</span><span class="PUNC">[</span><span class="NAME">x</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>629</span> </span><span class="WHIT">					</span><span class="NAME">child.items</span><span
-        class="PUNC">[</span><span class="NAME">x</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">this.t</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">brother.items</span><span
-        class="PUNC">[</span><span class="NAME">x</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>630</span> </span><span class="WHIT">				</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>631</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>632</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>633</span> </span><span class="WHIT">					</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">w</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">w</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">child.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">w</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>634</span> </span><span class="WHIT">						</span><span
-        class="NAME">brother.childs</span><span class="PUNC">[</span><span class="NAME">this.t</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NAME">w</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">child.childs</span><span class="PUNC">[</span><span class="NAME">w</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>635</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.keys</span><span class="PUNC">[</span><span class="NAME">this.t</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.keys</span><span class="PUNC">[</span><span class="NAME">node.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>636</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.items</span><span class="PUNC">[</span><span class="NAME">this.t</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.items</span><span class="PUNC">[</span><span class="NAME">node.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>637</span> </span><span class="WHIT">				</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">z</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">z</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">child.keys.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">z</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>638</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother.keys</span><span class="PUNC">[</span><span class="NAME">z</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NAME">this.t</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">child.keys</span><span class="PUNC">[</span><span class="NAME">z</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>639</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother.items</span><span class="PUNC">[</span><span class="NAME">z</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NAME">this.t</span><span
-        class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">child.items</span><span class="PUNC">[</span><span class="NAME">z</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>640</span> </span><span class="WHIT">				</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>641</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>642</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>643</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>644</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>645</span> 
-<span class='line'>646</span> </span><span class="COMM">/**
-<span class='line'>647</span>  * Checks if the tree contains the key.
-<span class='line'>648</span>  * @param key {number} The key to find.
-<span class='line'>649</span>  * @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.
-<span class='line'>650</span>  * @return {boolean} True if the tree contains the key.
-<span class='line'>651</span>  */</span><span class="WHIT">
-<span class='line'>652</span> </span><span class="NAME">BTree.prototype.contains</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>653</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.search</span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">!==</span><span class="WHIT"> </span><span
-        class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>654</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>655</span> 
-<span class='line'>656</span> </span><span class="COMM">/**
-<span class='line'>657</span>  * Checks if the tree contains a node that satisfy the condition represented by the callback function.
-<span class='line'>658</span>  * This method check all the tree avoiding the binary search.
-<span class='line'>659</span>  * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
-<span class='line'>660</span>  * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
-<span class='line'>661</span>  */</span><span class="WHIT">
-<span class='line'>662</span> </span><span class="NAME">BTree.prototype.fullContains</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>663</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.minimumKey</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>664</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">!</span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">this.search</span><span
-        class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>665</span> </span><span class="WHIT">		</span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">key</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>666</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">!==</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>667</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>668</span> 
-<span class='line'>669</span> </span><span class="COMM">/**
-<span class='line'>670</span>  * Gets the key next to the param node key.
-<span class='line'>671</span>  * @param key {number} The key of which search the successor.
-<span class='line'>672</span>  * @param [node = root] The node from start the search of the successor.
-<span class='line'>673</span>  * @return {number} The key found.
-<span class='line'>674</span>  */</span><span class="WHIT">
-<span class='line'>675</span> </span><span class="NAME">BTree.prototype.successor</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>676</span> </span><span class="WHIT">	</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>677</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.keys.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>678</span> </span><span class="WHIT">	</span><span
-        class="COMM">//search the key in the node</span><span class="WHIT">
-<span class='line'>679</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>680</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">Math.floor</span><span class="PUNC">(</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">/</span><span class="WHIT"> </span><span class="NUMB">2</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>681</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;=</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">m</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>682</span> </span><span class="WHIT">			</span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>683</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>684</span> </span><span class="WHIT">			</span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>685</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>686</span> </span><span class="WHIT">	</span><span
-        class="COMM">//check if the key has been found</span><span class="WHIT">
-<span class='line'>687</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>688</span> </span><span class="WHIT">	</span><span class="COMM">//in this case the successor is the next key</span><span
-        class="WHIT">
-<span class='line'>689</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>690</span> </span><span class="WHIT">	</span><span class="COMM">//if it's a leaf</span><span
-        class="WHIT">
-<span class='line'>691</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">node.childs.length</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>692</span> </span><span class="WHIT">		</span><span class="COMM">//check if the key hasn't been found</span><span
-        class="WHIT">
-<span class='line'>693</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">node.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>694</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>695</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>696</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.keys</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>697</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>698</span> </span><span class="WHIT">	</span><span class="COMM">//if it's not a leaf check if the successor is in the i-child</span><span
-        class="WHIT">
-<span class='line'>699</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">successor</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.successor</span><span
-        class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">node.childs</span><span class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>700</span> </span><span class="WHIT">	</span><span class="COMM">//if it's not in the child and has been found a key then return it</span><span
-        class="WHIT">
-<span class='line'>701</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">successor</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.keys.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>702</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.keys</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>703</span> </span><span class="WHIT">	</span><span class="COMM">//return the value of the successor even if it's null</span><span
-        class="WHIT">
-<span class='line'>704</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">successor</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>705</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>706</span> 
-<span class='line'>707</span> </span><span class="COMM">/**
-<span class='line'>708</span>  * Gets the key previous to the param key.
-<span class='line'>709</span>  * @param key {number} The key of which search the predecessor.
-<span class='line'>710</span>  * @param [node = root] The node from start the search of the predecessor.
-<span class='line'>711</span>  * @return {number} The key found.
-<span class='line'>712</span>  */</span><span class="WHIT">
-<span class='line'>713</span> </span><span class="NAME">BTree.prototype.predecessor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>714</span> </span><span class="WHIT">	</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>715</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.keys.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>716</span> </span><span class="WHIT">	</span><span
-        class="COMM">//search the key in the node</span><span class="WHIT">
-<span class='line'>717</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>718</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">Math.floor</span><span class="PUNC">(</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">/</span><span class="WHIT"> </span><span class="NUMB">2</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>719</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;=</span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NAME">m</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>720</span> </span><span class="WHIT">			</span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>721</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>722</span> </span><span class="WHIT">			</span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>723</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>724</span> </span><span class="WHIT">	</span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>725</span> </span><span class="WHIT">	</span><span
-        class="COMM">//check if the node is a leaf</span><span class="WHIT">
-<span class='line'>726</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">node.childs.length</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>727</span> </span><span class="WHIT">		</span><span class="COMM">//check if a predecessor has been found</span><span
-        class="WHIT">
-<span class='line'>728</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>729</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>730</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>731</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.keys</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>732</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>733</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">predecessor</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.predecessor</span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">node.childs</span><span class="PUNC">[</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>734</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">predecessor</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">node.keys</span><span
-        class="PUNC">[</span><span class="NUMB">0</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>735</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.keys</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>736</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>737</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">predecessor</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>738</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>739</span> 
-<span class='line'>740</span> </span><span class="COMM">/**
-<span class='line'>741</span>  * Gets the minimum key stored in the tree.
-<span class='line'>742</span>  * @return {number} The key found.
-<span class='line'>743</span>  */</span><span class="WHIT">
-<span class='line'>744</span> </span><span class="NAME">BTree.prototype.minimumKey</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>745</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>746</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>747</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NUMB">0</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>748</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>749</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.keys</span><span class="PUNC">[</span><span
-        class="NUMB">0</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>750</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>751</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>752</span> 
-<span class='line'>753</span> </span><span class="COMM">/**
-<span class='line'>754</span>  * Gets the maximum key stored in the tree.
-<span class='line'>755</span>  * @return {number} The key found.
-<span class='line'>756</span>  */</span><span class="WHIT">
-<span class='line'>757</span> </span><span class="NAME">BTree.prototype.maximumKey</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>758</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>759</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>760</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NAME">node.childs.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>761</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>762</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.keys</span><span class="PUNC">[</span><span class="NAME">node.keys.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>763</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>764</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>765</span> 
-<span class='line'>766</span> </span><span class="COMM">/**
-<span class='line'>767</span>  * Gets the item relatives to the minimum key stored in the tree.
-<span class='line'>768</span>  * @return {number} The item found.
-<span class='line'>769</span>  */</span><span class="WHIT">
-<span class='line'>770</span> </span><span class="NAME">BTree.prototype.minimum</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>771</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>772</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>773</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NUMB">0</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>774</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.items</span><span class="PUNC">[</span><span
-        class="NUMB">0</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>775</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>776</span> 
-<span class='line'>777</span> </span><span class="COMM">/**
-<span class='line'>778</span>  * Gets the item relatives to the maximum key stored in the tree.
-<span class='line'>779</span>  * @return {node} The item found.
-<span class='line'>780</span>  */</span><span class="WHIT">
-<span class='line'>781</span> </span><span class="NAME">BTree.prototype.maximum</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>782</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>783</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>784</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.childs</span><span
-        class="PUNC">[</span><span class="NAME">node.childs.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>785</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.items</span><span class="PUNC">[</span><span class="NAME">node.items.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>786</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>787</span> 
-<span class='line'>788</span> </span><span class="COMM">/**
-<span class='line'>789</span>  * Returns the size of the tree.
-<span class='line'>790</span>  * @return {number} The size of the tree.
-<span class='line'>791</span>  */</span><span class="WHIT">
-<span class='line'>792</span> </span><span class="NAME">BTree.prototype.getSize</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>793</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>794</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>795</span> 
-<span class='line'>796</span> </span><span class="COMM">/**
-<span class='line'>797</span>  * Checks if the tree is empty.
-<span class='line'>798</span>  * @return {boolean} True if the tree is empty, false otherwise.
-<span class='line'>799</span>  */</span><span class="WHIT">
-<span class='line'>800</span> </span><span class="NAME">BTree.prototype.isEmpty</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>801</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>802</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>803</span> 
-<span class='line'>804</span> </span><span class="COMM">/**
-<span class='line'>805</span>  * Executes the callback function for each item of the tree.
-<span class='line'>806</span>  * This method modifies the tree so if you don't need to modify it you must return the same item of the array.
-<span class='line'>807</span>  * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
-<span class='line'>808</span>  * @return {void}
-<span class='line'>809</span>  */</span><span class="WHIT">
-<span class='line'>810</span> </span><span class="NAME">BTree.prototype.execute</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>811</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">arguments</span><span class="PUNC">[</span><span
-        class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>812</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.items.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>813</span> </span><span class="WHIT">		</span><span class="NAME">node.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>814</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.childs.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>815</span> </span><span class="WHIT">		</span><span class="NAME">this.execute</span><span
-        class="PUNC">(</span><span class="NAME">callback</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node.childs</span><span class="PUNC">[</span><span class="NAME">j</span><span
-        class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>816</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>817</span> 
-<span class='line'>818</span> </span><span class="COMM">/**
-<span class='line'>819</span>  * Removes all the items stored in the tree.
-<span class='line'>820</span>  * @return {void}
-<span class='line'>821</span>  */</span><span class="WHIT">
-<span class='line'>822</span> </span><span class="NAME">BTree.prototype.clear</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>823</span> </span><span class="WHIT">	</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>824</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>825</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>826</span> 
-<span class='line'>827</span> </span><span class="COMM">/**
-<span class='line'>828</span>  * Returns the items that satisfy the condition determined by the callback.
-<span class='line'>829</span>  * @param callback {function} The function that implements the condition.
-<span class='line'>830</span>  * @return {Array&lt;*>} The array that contains the items that satisfy the condition.
-<span class='line'>831</span>  */</span><span class="WHIT">
-<span class='line'>832</span> </span><span class="NAME">BTree.prototype.filter</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>833</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>834</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">arguments</span><span class="PUNC">[</span><span
-        class="NUMB">1</span><span class="PUNC">]</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>835</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.items.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>836</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>837</span> </span><span class="WHIT">			</span><span class="NAME">result</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">result.concat</span><span class="PUNC">(</span><span class="NAME">this.filter</span><span
-        class="PUNC">(</span><span class="NAME">callback</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node.childs</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>838</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>839</span> </span><span class="WHIT">			</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">node.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>840</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>841</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.childs.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>842</span> </span><span class="WHIT">		</span><span class="NAME">result</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">result.concat</span><span class="PUNC">(</span><span class="NAME">this.filter</span><span
-        class="PUNC">(</span><span class="NAME">callback</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node.childs</span><span class="PUNC">[</span><span class="NAME">node.childs.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>843</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>844</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>845</span> 
-<span class='line'>846</span> </span><span class="COMM">/**
-<span class='line'>847</span>  * Clones the tree into a new tree.
-<span class='line'>848</span>  * @return {BTree} The tree cloned from this tree.
-<span class='line'>849</span>  */</span><span class="WHIT">
-<span class='line'>850</span> </span><span class="NAME">BTree.prototype.clone</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>851</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">BTree</span><span class="PUNC">(</span><span class="NAME">this.t</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>852</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>853</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>854</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>855</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item.clone</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>856</span> </span><span class="WHIT">			</span><span class="NAME">item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">item.clone</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>857</span> </span><span class="WHIT">		</span><span class="NAME">tree.insert</span><span
-        class="PUNC">(</span><span class="NAME">it.getKey</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>858</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>859</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>860</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>861</span> 
-<span class='line'>862</span> </span><span class="COMM">/**
-<span class='line'>863</span>  * Clones the tree into a new tree without cloning duplicated items.
-<span class='line'>864</span>  * @return {BTree} The tree cloned from this tree.
-<span class='line'>865</span>  */</span><span class="WHIT">
-<span class='line'>866</span> </span><span class="NAME">BTree.prototype.cloneDistinct</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>867</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">BTree</span><span class="PUNC">(</span><span class="NAME">this.t</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>868</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>869</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>870</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>871</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>872</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>873</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">tree.fullContains</span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>874</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">cloneDistinct</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>875</span> </span><span class="WHIT">				</span><span
-        class="NAME">tree.insert</span><span class="PUNC">(</span><span class="NAME">it.getKey</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">it.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">cloneDistinct</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>876</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">it.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">clone</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>877</span> </span><span class="WHIT">				</span><span
-        class="NAME">tree.insert</span><span class="PUNC">(</span><span class="NAME">it.getKey</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">it.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">clone</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>878</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>879</span> </span><span class="WHIT">				</span><span
-        class="NAME">tree.insert</span><span class="PUNC">(</span><span class="NAME">it.getKey</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">it.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>880</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>881</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>882</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>883</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>884</span> 
-<span class='line'>885</span> </span><span class="COMM">/**
-<span class='line'>886</span>  * Transforms the tree into an array without preserving keys.
-<span class='line'>887</span>  * @return {Array&lt;*>} The array that represents the tree.
-<span class='line'>888</span>  */</span><span class="WHIT">
-<span class='line'>889</span> </span><span class="NAME">BTree.prototype.toArray</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>890</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>891</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>892</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>893</span> </span><span class="WHIT">		</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>894</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>895</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>896</span> 
-<span class='line'>897</span> </span><span class="COMM">/**
-<span class='line'>898</span>  * Returns the first position of the item in the tree.
-<span class='line'>899</span>  * @param item {*} The item to search.
-<span class='line'>900</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>901</span>  * @return {number} The first position of the item.
-<span class='line'>902</span>  */</span><span class="WHIT">
-<span class='line'>903</span> </span><span class="NAME">BTree.prototype.indexOf</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>904</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>905</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>906</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>907</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.minimumKey</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>908</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>909</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.search</span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>910</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>911</span> </span><span class="WHIT">		</span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">key</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>912</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>913</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>914</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>915</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>916</span> 
-<span class='line'>917</span> </span><span class="COMM">/**
-<span class='line'>918</span>  * Returns the last position of the item in the tree.
-<span class='line'>919</span>  * @param item {*} The item to search.
-<span class='line'>920</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>921</span>  * @return {number} The last position of the item.
-<span class='line'>922</span>  */</span><span class="WHIT">
-<span class='line'>923</span> </span><span class="NAME">BTree.prototype.lastIndexOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>924</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>925</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>926</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>927</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.maximumKey</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>928</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>929</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.search</span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>930</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>931</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>932</span> </span><span class="WHIT">		</span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.predecessor</span><span class="PUNC">(</span><span class="NAME">key</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>933</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>934</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>935</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>936</span> 
-<span class='line'>937</span> </span><span class="COMM">/**
-<span class='line'>938</span>  * Returns all the position in which the item has been found in the tree.
-<span class='line'>939</span>  * @param item {*} The item to search.
-<span class='line'>940</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>941</span>  * @return {Array&lt;number>} The positions in which the item has been found.
-<span class='line'>942</span>  */</span><span class="WHIT">
-<span class='line'>943</span> </span><span class="NAME">BTree.prototype.allIndexesOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>944</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>945</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>946</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>947</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.minimumKey</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>948</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>949</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>950</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.search</span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>951</span> </span><span class="WHIT">			</span><span class="NAME">indexes.push</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>952</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>953</span> </span><span class="WHIT">		</span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">key</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>954</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>955</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>956</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>957</span> 
-<span class='line'>958</span> </span><span class="COMM">/**
-<span class='line'>959</span>  * Returns the item at the position index.
-<span class='line'>960</span>  * @param index {number} The position of the item.
-<span class='line'>961</span>  * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
-<span class='line'>962</span>  */</span><span class="WHIT">
-<span class='line'>963</span> </span><span class="NAME">BTree.prototype.getItem</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>964</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>965</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>966</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.minimum</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>967</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>968</span> </span><span class="WHIT">		</span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">key</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>969</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.search</span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>970</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>971</span> 
-<span class='line'>972</span> </span><span class="COMM">/**
-<span class='line'>973</span>  * Class that implements the iterator for a binary search tree.
-<span class='line'>974</span>  * @param aggregate {BTree} The aggregate to scan.
-<span class='line'>975</span>  * @constructor
-<span class='line'>976</span>  */</span><span class="WHIT">
-<span class='line'>977</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">BTreeIterator</span><span
-        class="PUNC">(</span><span class="NAME">aggregate</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>978</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>979</span> 	 * The aggregate relates to this iterator.
-<span class='line'>980</span> 	 * @type {BTree}
-<span class='line'>981</span> 	 */</span><span class="WHIT">
-<span class='line'>982</span> </span><span class="WHIT">	</span><span class="NAME">this.aggregate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">aggregate</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>983</span> 
-<span class='line'>984</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>985</span> 	 * The pointer to the position.
-<span class='line'>986</span> 	 * @type {number}
-<span class='line'>987</span> 	 */</span><span class="WHIT">
-<span class='line'>988</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>989</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>990</span> 
-<span class='line'>991</span> </span><span class="COMM">/**
-<span class='line'>992</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'>993</span>  * @return {void}
-<span class='line'>994</span>  */</span><span class="WHIT">
-<span class='line'>995</span> </span><span class="NAME">BTreeIterator.prototype.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>996</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.minimumKey</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>997</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>998</span> 
-<span class='line'>999</span> </span><span class="COMM">/**
-<span class='line'>1000</span>  * Moves the iterator to the next item.
-<span class='line'>1001</span>  * @return {void}
-<span class='line'>1002</span>  */</span><span class="WHIT">
-<span class='line'>1003</span> </span><span class="NAME">BTreeIterator.prototype.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1004</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.successor</span><span
-        class="PUNC">(</span><span class="NAME">this.pointer</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1005</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1006</span> 
-<span class='line'>1007</span> </span><span class="COMM">/**
-<span class='line'>1008</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'>1009</span>  * @return {void}
-<span class='line'>1010</span>  */</span><span class="WHIT">
-<span class='line'>1011</span> </span><span class="NAME">BTreeIterator.prototype.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1012</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.maximumKey</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1013</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1014</span> 
-<span class='line'>1015</span> </span><span class="COMM">/**
-<span class='line'>1016</span>  * Moves the iterator to the previous item.
-<span class='line'>1017</span>  * @return {void}
-<span class='line'>1018</span>  */</span><span class="WHIT">
-<span class='line'>1019</span> </span><span class="NAME">BTreeIterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1020</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.predecessor</span><span
-        class="PUNC">(</span><span class="NAME">this.pointer</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1021</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1022</span> 
-<span class='line'>1023</span> </span><span class="COMM">/**
-<span class='line'>1024</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'>1025</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'>1026</span>  */</span><span class="WHIT">
-<span class='line'>1027</span> </span><span class="NAME">BTreeIterator.prototype.isDone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1028</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1029</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1030</span> 
-<span class='line'>1031</span> </span><span class="COMM">/**
-<span class='line'>1032</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'>1033</span>  * @return {*} The item stored or undefined if it's out of the bounds.
-<span class='line'>1034</span>  */</span><span class="WHIT">
-<span class='line'>1035</span> </span><span class="NAME">BTreeIterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1036</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.aggregate.search</span><span class="PUNC">(</span><span
-        class="NAME">this.pointer</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1037</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1038</span> 
-<span class='line'>1039</span> </span><span class="COMM">/**
-<span class='line'>1040</span>  * Returns the key stored at the position pointed by the iterator.
-<span class='line'>1041</span>  * @return {number} The key stored or null if it's out of the bounds.
-<span class='line'>1042</span>  */</span><span class="WHIT">
-<span class='line'>1043</span> </span><span class="NAME">BTreeIterator.prototype.getKey</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1044</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1045</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1046</span> 
-<span class='line'>1047</span> </span><span class="COMM">/**
-<span class='line'>1048</span>  * Class for managing a circular buffer.
-<span class='line'>1049</span>  * @param size {Number} The size of the buffer.
-<span class='line'>1050</span>  * @constructor
-<span class='line'>1051</span>  */</span><span class="WHIT">
-<span class='line'>1052</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">CircularBuffer</span><span
-        class="PUNC">(</span><span class="NAME">size</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1053</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1054</span> 	 * The index of the position of the head of the buffer.
-<span class='line'>1055</span> 	 * @type {number}
-<span class='line'>1056</span> 	 */</span><span class="WHIT">
-<span class='line'>1057</span> </span><span class="WHIT">	</span><span class="NAME">this.head</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1058</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1059</span> 	 * The index of the position of the tail of the buffer.
-<span class='line'>1060</span> 	 * @type {number}
-<span class='line'>1061</span> 	 */</span><span class="WHIT">
-<span class='line'>1062</span> </span><span class="WHIT">	</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1063</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1064</span> 	 * The items stored in the buffer.
-<span class='line'>1065</span> 	 * @type {Array&lt;*>}
-<span class='line'>1066</span> 	 */</span><span class="WHIT">
-<span class='line'>1067</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span
-        class="WHIT"> </span><span class="NAME">Array</span><span class="PUNC">(</span><span
-        class="NAME">size</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1068</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1069</span> 	 * Is true if buffer is empty, false otherwise.
-<span class='line'>1070</span> 	 * @type {boolean}
-<span class='line'>1071</span> 	 */</span><span class="WHIT">
-<span class='line'>1072</span> </span><span class="WHIT">	</span><span class="NAME">this.empty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">true</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1073</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1074</span> 	 * Is false if buffer is full, false otherwise.
-<span class='line'>1075</span> 	 * @type {boolean}
-<span class='line'>1076</span> 	 */</span><span class="WHIT">
-<span class='line'>1077</span> </span><span class="WHIT">	</span><span class="NAME">this.full</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">false</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1078</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1079</span> 	 * The size of the buffer.
-<span class='line'>1080</span> 	 * @type {Number}
-<span class='line'>1081</span> 	 */</span><span class="WHIT">
-<span class='line'>1082</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1083</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1084</span> 
-<span class='line'>1085</span> </span><span class="COMM">/**
-<span class='line'>1086</span>  * Returns the iterator relative to the aggregate.
-<span class='line'>1087</span>  * @return {Iterator} The iterator.
-<span class='line'>1088</span>  */</span><span class="WHIT">
-<span class='line'>1089</span> </span><span class="NAME">CircularBuffer.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1090</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span class="NAME">CircularBufferIterator</span><span
-        class="PUNC">(</span><span class="KEYW">this</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1091</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1092</span> 
-<span class='line'>1093</span> </span><span class="COMM">/**
-<span class='line'>1094</span>  * Writes the item at the head of the buffer.
-<span class='line'>1095</span>  * @param item {*} The item to write.
-<span class='line'>1096</span>  * @return {void}
-<span class='line'>1097</span>  */</span><span class="WHIT">
-<span class='line'>1098</span> </span><span class="NAME">CircularBuffer.prototype.write</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1099</span> </span><span class="WHIT">	</span><span class="NAME">this.empty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">false</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1100</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.full</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1101</span> </span><span class="WHIT">	</span><span class="COMM">//if buffer is full tail must be set forward</span><span
-        class="WHIT">
-<span class='line'>1102</span> </span><span class="WHIT">		</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">this.tail</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">%</span><span class="WHIT"> </span><span class="NAME">this.size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1103</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">this.head</span><span class="PUNC">]</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">item</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1104</span> </span><span class="WHIT">	</span><span class="COMM">//head is set forward</span><span
-        class="WHIT">
-<span class='line'>1105</span> </span><span class="WHIT">	</span><span class="NAME">this.head</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">this.head</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">%</span><span class="WHIT"> </span><span class="NAME">this.size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1106</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.head</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1107</span> </span><span class="WHIT">		</span><span class="NAME">this.full</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">true</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1108</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1109</span> 
-<span class='line'>1110</span> </span><span class="COMM">/**
-<span class='line'>1111</span>  * Frees the buffer between indexes from and to.
-<span class='line'>1112</span>  * If from > to, positions between from and the end of the buffer and between the start and to will be free.
-<span class='line'>1113</span>  * @param from {Number} The index from which start to free (inclusive index)
-<span class='line'>1114</span>  * @param to {Number} The index where stop to free (exclusive index)
-<span class='line'>1115</span>  * @return {void}
-<span class='line'>1116</span>  */</span><span class="WHIT">
-<span class='line'>1117</span> </span><span class="NAME">CircularBuffer.prototype.free</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">from</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1118</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">from</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1119</span> </span><span class="WHIT">		</span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1120</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">from</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1121</span> </span><span class="WHIT">		</span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1122</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">to</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1123</span> </span><span class="WHIT">		</span><span class="NAME">to</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1124</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">to</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1125</span> </span><span class="WHIT">		</span><span class="NAME">to</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1126</span> </span><span class="WHIT">	</span><span class="COMM">//if from &lt; to then will be free allocation between from and to</span><span
-        class="WHIT">
-<span class='line'>1127</span> </span><span class="WHIT">	</span><span class="COMM">//otherwise will be free allocations between from and the end and between the start and to</span><span
-        class="WHIT">
-<span class='line'>1128</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">%</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1129</span> </span><span class="WHIT">		</span><span class="KEYW">delete</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1130</span> 
-<span class='line'>1131</span> </span><span class="WHIT">	</span><span class="COMM">//adjust the position of the tail and of the head</span><span
-        class="WHIT">
-<span class='line'>1132</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.tail</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span
-        class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1133</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.head</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1134</span> </span><span class="WHIT">			</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">from</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">%</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1135</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1136</span> </span><span class="WHIT">			</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1137</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1138</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.head</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.head</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span
-        class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1139</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.head</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1140</span> </span><span class="WHIT">			</span><span class="NAME">this.head</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1141</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1142</span> </span><span class="WHIT">			</span><span class="NAME">this.head</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">from</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1143</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1144</span> </span><span class="WHIT">	</span><span
-        class="COMM">//check if something is free</span><span class="WHIT">
-<span class='line'>1145</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">from</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1146</span> </span><span class="WHIT">		</span><span class="NAME">this.full</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">false</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1147</span> </span><span class="WHIT">	</span><span
-        class="COMM">//free could make buffer empty</span><span class="WHIT">
-<span class='line'>1148</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1149</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1150</span> </span><span class="WHIT">			</span><span class="NAME">this.empty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">false</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1151</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1152</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1153</span> </span><span class="WHIT">	</span><span class="NAME">this.empty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">true</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1154</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1155</span> 
-<span class='line'>1156</span> </span><span class="COMM">/**
-<span class='line'>1157</span>  * Frees all the buffer.
-<span class='line'>1158</span>  * @return {void}
-<span class='line'>1159</span>  */</span><span class="WHIT">
-<span class='line'>1160</span> </span><span class="NAME">CircularBuffer.prototype.freeAll</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1161</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1162</span> </span><span class="WHIT">		</span><span class="KEYW">delete</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1163</span> </span><span class="WHIT">	</span><span class="NAME">this.empty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">true</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1164</span> </span><span class="WHIT">	</span><span class="NAME">this.head</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1165</span> </span><span class="WHIT">	</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1166</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1167</span> 
-<span class='line'>1168</span> </span><span class="COMM">/**
-<span class='line'>1169</span>  * Reads the item stored at the position index.
-<span class='line'>1170</span>  * @param index {Number} The position of the item to read.
-<span class='line'>1171</span>  * @return {*} The item read.
-<span class='line'>1172</span>  */</span><span class="WHIT">
-<span class='line'>1173</span> </span><span class="NAME">CircularBuffer.prototype.read</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1174</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">%</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1175</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1176</span> 
-<span class='line'>1177</span> </span><span class="COMM">/**
-<span class='line'>1178</span>  * Returns true if the buffer is empty, false otherwise.
-<span class='line'>1179</span>  * @return {boolean}
-<span class='line'>1180</span>  */</span><span class="WHIT">
-<span class='line'>1181</span> </span><span class="NAME">CircularBuffer.prototype.isEmpty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1182</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.empty</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1183</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1184</span> 
-<span class='line'>1185</span> </span><span class="COMM">/**
-<span class='line'>1186</span>  * Returns true if the buffer is full, false otherwise.
-<span class='line'>1187</span>  * @return {boolean}
-<span class='line'>1188</span>  */</span><span class="WHIT">
-<span class='line'>1189</span> </span><span class="NAME">CircularBuffer.prototype.isFull</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1190</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.full</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1191</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1192</span> 
-<span class='line'>1193</span> </span><span class="COMM">/**
-<span class='line'>1194</span>  * Clones the circular buffer into a new circular buffer.
-<span class='line'>1195</span>  * @return {CircularBuffer} The circular buffer cloned from this circular buffer.
-<span class='line'>1196</span>  */</span><span class="WHIT">
-<span class='line'>1197</span> </span><span class="NAME">CircularBuffer.prototype.clone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1198</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">buffer</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">CircularBuffer</span><span class="PUNC">(</span><span class="NAME">this.size</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1199</span> </span><span class="WHIT">	</span><span class="NAME">buffer.head</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.head</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1200</span> </span><span class="WHIT">	</span><span class="NAME">buffer.tail</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.tail</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1201</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1202</span> </span><span class="WHIT">		</span><span class="NAME">buffer.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1203</span> </span><span class="WHIT">	</span><span class="NAME">buffer.empty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.empty</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1204</span> </span><span class="WHIT">	</span><span class="NAME">buffer.full</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.full</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1205</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">buffer</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1206</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1207</span> 
-<span class='line'>1208</span> </span><span class="COMM">/**
-<span class='line'>1209</span>  * Resize the buffer.
-<span class='line'>1210</span>  * @param size {number} The new size of the buffer.
-<span class='line'>1211</span>  * @return {void}
-<span class='line'>1212</span>  */</span><span class="WHIT">
-<span class='line'>1213</span> </span><span class="NAME">CircularBuffer.prototype.resize</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">size</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1214</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">size</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1215</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.head</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.tail</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1216</span> </span><span class="WHIT">			</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.head</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1217</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.items</span><span class="PUNC">[</span><span class="PUNC">(</span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">%</span><span class="WHIT"> </span><span class="NAME">size</span><span class="PUNC">]</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.items</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1218</span> </span><span class="WHIT">				</span><span class="KEYW">delete</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1219</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>1220</span> </span><span class="WHIT">			</span><span class="NAME">this.head</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">this.head</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">%</span><span class="WHIT"> </span><span class="NAME">size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1221</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1222</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">size</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1223</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.head</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.tail</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1224</span> </span><span class="WHIT">			</span><span class="COMM">//check if the tail is after the size</span><span
-        class="WHIT">
-<span class='line'>1225</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">start</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1226</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">size</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1227</span> </span><span class="WHIT">				</span><span class="NAME">start</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.tail</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1228</span> </span><span class="WHIT">				</span><span class="NAME">this.tail</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1229</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>1230</span> </span><span class="WHIT">			</span><span class="COMM">//the items stored must be shift to a valid position</span><span
-        class="WHIT">
-<span class='line'>1231</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">step</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">start</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1232</span> </span><span class="WHIT">			</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.head</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NAME">step</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NAME">start</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.head</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NAME">step</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1233</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.items</span><span class="PUNC">[</span><span class="PUNC">(</span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span
-        class="NAME">step</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">%</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="PUNC">]</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.items</span><span class="PUNC">[</span><span class="NAME">j</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1234</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">j</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1235</span> </span><span class="WHIT">					</span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1236</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>1237</span> </span><span class="WHIT">			</span><span class="NAME">this.head</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">this.head</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">step</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">%</span><span class="WHIT"> </span><span class="NAME">this.size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1238</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1239</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1240</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1241</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1242</span> 
-<span class='line'>1243</span> </span><span class="COMM">/**
-<span class='line'>1244</span>  * Class that implements the iterator for a circular buffer.
-<span class='line'>1245</span>  * @param aggregate {CircularBuffer} The aggregate to scan.
-<span class='line'>1246</span>  * @constructor
-<span class='line'>1247</span>  */</span><span class="WHIT">
-<span class='line'>1248</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">CircularBufferIterator</span><span
-        class="PUNC">(</span><span class="NAME">aggregate</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1249</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1250</span> 	 * The aggregate relates to this iterator.
-<span class='line'>1251</span> 	 * @type {CircularBuffer}
-<span class='line'>1252</span> 	 */</span><span class="WHIT">
-<span class='line'>1253</span> </span><span class="WHIT">	</span><span class="NAME">this.aggregate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">aggregate</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1254</span> 
-<span class='line'>1255</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1256</span> 	 * The pointer to the position.
-<span class='line'>1257</span> 	 * @type {number|null}
-<span class='line'>1258</span> 	 */</span><span class="WHIT">
-<span class='line'>1259</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1260</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1261</span> 	 * Discriminator for full buffer
-<span class='line'>1262</span> 	 * @type {bool}
-<span class='line'>1263</span> 	 */</span><span class="WHIT">
-<span class='line'>1264</span> </span><span class="WHIT">	</span><span class="NAME">this.start</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">true</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1265</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1266</span> 
-<span class='line'>1267</span> </span><span class="COMM">/**
-<span class='line'>1268</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'>1269</span>  * @return {void}
-<span class='line'>1270</span>  */</span><span class="WHIT">
-<span class='line'>1271</span> </span><span class="NAME">CircularBufferIterator.prototype.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1272</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.tail</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1273</span> </span><span class="WHIT">	</span><span class="NAME">this.start</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">true</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1274</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1275</span> 
-<span class='line'>1276</span> </span><span class="COMM">/**
-<span class='line'>1277</span>  * Moves the iterator to the next item.
-<span class='line'>1278</span>  * @return {void}
-<span class='line'>1279</span>  */</span><span class="WHIT">
-<span class='line'>1280</span> </span><span class="NAME">CircularBufferIterator.prototype.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1281</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">this.pointer</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">%</span><span class="WHIT"> </span><span class="NAME">this.aggregate.size</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1282</span> </span><span class="WHIT">	</span><span class="NAME">this.start</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">false</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1283</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1284</span> 
-<span class='line'>1285</span> </span><span class="COMM">/**
-<span class='line'>1286</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'>1287</span>  * @return {void}
-<span class='line'>1288</span>  */</span><span class="WHIT">
-<span class='line'>1289</span> </span><span class="NAME">CircularBufferIterator.prototype.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1290</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">this.aggregate.head</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">%</span><span class="WHIT"> </span><span class="NAME">this.aggregate.size</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1291</span> </span><span class="WHIT">	</span><span class="NAME">this.start</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">true</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1292</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1293</span> 
-<span class='line'>1294</span> </span><span class="COMM">/**
-<span class='line'>1295</span>  * Moves the iterator to the previous item.
-<span class='line'>1296</span>  * @return {void}
-<span class='line'>1297</span>  */</span><span class="WHIT">
-<span class='line'>1298</span> </span><span class="NAME">CircularBufferIterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1299</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">this.pointer</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">%</span><span class="WHIT"> </span><span class="NAME">this.aggregate.size</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1300</span> </span><span class="WHIT">	</span><span class="NAME">this.start</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">false</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1301</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1302</span> 
-<span class='line'>1303</span> </span><span class="COMM">/**
-<span class='line'>1304</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'>1305</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'>1306</span>  */</span><span class="WHIT">
-<span class='line'>1307</span> </span><span class="NAME">CircularBufferIterator.prototype.isDone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1308</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.aggregate.head</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">!</span><span
-        class="NAME">this.start</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.aggregate.tail</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">%</span><span class="WHIT"> </span><span
-        class="NAME">this.aggregate.size</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="NAME">this.aggregate.isEmpty</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1309</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1310</span> 
-<span class='line'>1311</span> </span><span class="COMM">/**
-<span class='line'>1312</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'>1313</span>  * @return {*} The item stored or undefined if it's out of the bounds.
-<span class='line'>1314</span>  */</span><span class="WHIT">
-<span class='line'>1315</span> </span><span class="NAME">CircularBufferIterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1316</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.aggregate.read</span><span class="PUNC">(</span><span class="NAME">this.pointer</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1317</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1318</span> 
-<span class='line'>1319</span> </span><span class="COMM">/**
-<span class='line'>1320</span>  * Class for managing a double linked list.
-<span class='line'>1321</span>  * @param {...*} [args] The items for initializing the list.
-<span class='line'>1322</span>  * @constructor
-<span class='line'>1323</span>  */</span><span class="WHIT">
-<span class='line'>1324</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">DoubleLinkedList</span><span
-        class="PUNC">(</span><span class="NAME">args</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1325</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1326</span> 	 * The first node of the list.
-<span class='line'>1327</span> 	 * @type {DLLNode|null}
-<span class='line'>1328</span> 	 */</span><span class="WHIT">
-<span class='line'>1329</span> </span><span class="WHIT">	</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1330</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1331</span> 	 * The last node of the list.
-<span class='line'>1332</span> 	 * @type {DLLNode|null}
-<span class='line'>1333</span> 	 */</span><span class="WHIT">
-<span class='line'>1334</span> </span><span class="WHIT">	</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1335</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>1336</span> 	 * The length of the list.
-<span class='line'>1337</span> 	 * @type {number}
-<span class='line'>1338</span> 	 */</span><span class="WHIT">
-<span class='line'>1339</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1340</span> </span><span class="WHIT">	</span><span class="COMM">//builds the list from the parameters of the constructor</span><span
-        class="WHIT">
-<span class='line'>1341</span> </span><span class="WHIT">	</span><span class="NAME">this.fromArray</span><span
-        class="PUNC">(</span><span class="NAME">arguments</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1342</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1343</span> 
-<span class='line'>1344</span> </span><span class="COMM">/**
-<span class='line'>1345</span>  * Returns the iterator relative to the aggregate.
-<span class='line'>1346</span>  * @return {Iterator} The iterator.
-<span class='line'>1347</span>  */</span><span class="WHIT">
-<span class='line'>1348</span> </span><span class="NAME">DoubleLinkedList.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1349</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span class="NAME">DoubleLinkedListIterator</span><span
-        class="PUNC">(</span><span class="KEYW">this</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1350</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1351</span> 
-<span class='line'>1352</span> </span><span class="COMM">/**
-<span class='line'>1353</span>  * Adds an item at the head of the list.
-<span class='line'>1354</span>  * @param item {*} The item to add.
-<span class='line'>1355</span>  * @return {void}
-<span class='line'>1356</span>  */</span><span class="WHIT">
-<span class='line'>1357</span> </span><span class="NAME">DoubleLinkedList.prototype.pushFront</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1358</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">DLLNode</span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1359</span> </span><span class="WHIT">	</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1360</span> </span><span class="WHIT">	</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1361</span> </span><span class="WHIT">	</span><span class="COMM">//link the next node to the new node</span><span
-        class="WHIT">
-<span class='line'>1362</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.next</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1363</span> </span><span class="WHIT">		</span><span
-        class="NAME">node.next.previous</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1364</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>1365</span> </span><span class="WHIT">		</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1366</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1367</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1368</span> 
-<span class='line'>1369</span> </span><span class="COMM">/**
-<span class='line'>1370</span>  * Adds an item at the tail of the list.
-<span class='line'>1371</span>  * @param item {*} The item to add.
-<span class='line'>1372</span>  * @return {void}
-<span class='line'>1373</span>  */</span><span class="WHIT">
-<span class='line'>1374</span> </span><span class="NAME">DoubleLinkedList.prototype.pushBack</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1375</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">DLLNode</span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1376</span> </span><span class="WHIT">	</span><span class="NAME">node.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1377</span> </span><span class="WHIT">	</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1378</span> </span><span class="WHIT">	</span><span class="COMM">//link the previous node to the new node</span><span
-        class="WHIT">
-<span class='line'>1379</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.previous</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1380</span> </span><span class="WHIT">		</span><span
-        class="NAME">node.previous.next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1381</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>1382</span> </span><span class="WHIT">		</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1383</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1384</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1385</span> 
-<span class='line'>1386</span> </span><span class="COMM">/**
-<span class='line'>1387</span>  * Removes the first item of the list.
-<span class='line'>1388</span>  * @return {*} The item removed. It's undefined if the list is empty.
-<span class='line'>1389</span>  */</span><span class="WHIT">
-<span class='line'>1390</span> </span><span class="NAME">DoubleLinkedList.prototype.popFront</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1391</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.length</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1392</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1393</span> </span><span class="WHIT">		</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1394</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.next</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1395</span> </span><span class="WHIT">			</span><span class="NAME">node.next.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1396</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1397</span> </span><span class="WHIT">		</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1398</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1399</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1400</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1401</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1402</span> 
-<span class='line'>1403</span> </span><span class="COMM">/**
-<span class='line'>1404</span>  * Removes the last item of the list.
-<span class='line'>1405</span>  * @return {*} The item removed. It's undefined if the list is empty.
-<span class='line'>1406</span>  */</span><span class="WHIT">
-<span class='line'>1407</span> </span><span class="NAME">DoubleLinkedList.prototype.popBack</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1408</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.length</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1409</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1410</span> </span><span class="WHIT">		</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1411</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.previous</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1412</span> </span><span class="WHIT">			</span><span class="NAME">node.previous.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1413</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1414</span> </span><span class="WHIT">		</span><span class="NAME">node.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1415</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1416</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1417</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1418</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1419</span> 
-<span class='line'>1420</span> </span><span class="COMM">/**
-<span class='line'>1421</span>  * Removes the first times items of the list.
-<span class='line'>1422</span>  * @param times {number} The number of times to repeat the popFront method.
-<span class='line'>1423</span>  * @return {*} The item removed. It's undefined if the list is empty.
-<span class='line'>1424</span>  */</span><span class="WHIT">
-<span class='line'>1425</span> </span><span class="NAME">DoubleLinkedList.prototype.multiPopFront</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">times</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1426</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1427</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">times</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1428</span> </span><span class="WHIT">		</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">this.popFront</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1429</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1430</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1431</span> 
-<span class='line'>1432</span> </span><span class="COMM">/**
-<span class='line'>1433</span>  * Removes the last times items of the list.
-<span class='line'>1434</span>  * @param times {number} The number of times to repeat the popBack method.
-<span class='line'>1435</span>  * @return {*} The items removed.
-<span class='line'>1436</span>  */</span><span class="WHIT">
-<span class='line'>1437</span> </span><span class="NAME">DoubleLinkedList.prototype.multiPopBack</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">times</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1438</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1439</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">times</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1440</span> </span><span class="WHIT">		</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">this.popBack</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1441</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1442</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1443</span> 
-<span class='line'>1444</span> </span><span class="COMM">/**
-<span class='line'>1445</span>  * Returns the first item of the list without remove it.
-<span class='line'>1446</span>  * @return {*} The item at the top of the list. It's undefined if the list is empty.
-<span class='line'>1447</span>  */</span><span class="WHIT">
-<span class='line'>1448</span> </span><span class="NAME">DoubleLinkedList.prototype.peek</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1449</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">this.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1450</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1451</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.first.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1452</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1453</span> 
-<span class='line'>1454</span> </span><span class="COMM">/**
-<span class='line'>1455</span>  * Adds the item at the index position.
-<span class='line'>1456</span>  * @param item {*} The item to add.
-<span class='line'>1457</span>  * @param index {number} The position where to add the item. If index is negative, the item won't be added.
-<span class='line'>1458</span>  * @return {void}
-<span class='line'>1459</span>  */</span><span class="WHIT">
-<span class='line'>1460</span> </span><span class="NAME">DoubleLinkedList.prototype.addAt</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1461</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1462</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1463</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">index</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1464</span> </span><span class="WHIT">		</span><span class="NAME">this.pushFront</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1465</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1466</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1467</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1468</span> </span><span class="WHIT">		</span><span class="NAME">this.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1469</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1470</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1471</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1472</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1473</span> </span><span class="WHIT">		</span><span class="NAME">this.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">undefined</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1474</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1475</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1476</span> </span><span class="WHIT">			</span><span class="NAME">this.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">undefined</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1477</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1478</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1479</span> </span><span class="WHIT">		</span><span class="NAME">this.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1480</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1481</span> </span><span class="WHIT">		</span><span class="NAME">this.pushFront</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1482</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1483</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">newNode</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">DLLNode</span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1484</span> </span><span class="WHIT">		</span><span class="NAME">newNode.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1485</span> </span><span class="WHIT">		</span><span class="NAME">newNode.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1486</span> </span><span class="WHIT">		</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">newNode</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1487</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">newNode.next</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1488</span> </span><span class="WHIT">			</span><span
-        class="NAME">newNode.next.previous</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">newNode</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1489</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1490</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1491</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1492</span> 
-<span class='line'>1493</span> </span><span class="COMM">/**
-<span class='line'>1494</span>  * Removes the item at the position index.
-<span class='line'>1495</span>  * @param index {Number} The position of the item to remove.
-<span class='line'>1496</span>  * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
-<span class='line'>1497</span>  */</span><span class="WHIT">
-<span class='line'>1498</span> </span><span class="NAME">DoubleLinkedList.prototype.removeAt</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1499</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1500</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1501</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1502</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.popFront</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1503</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1504</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.popBack</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1505</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1506</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1507</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1508</span> </span><span class="WHIT">	</span><span
-        class="COMM">//now node is the node to remove</span><span class="WHIT">
-<span class='line'>1509</span> </span><span class="WHIT">	</span><span class="NAME">node.previous.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1510</span> </span><span class="WHIT">	</span><span class="NAME">node.next.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1511</span> </span><span class="WHIT">	</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1512</span> </span><span class="WHIT">	</span><span class="NAME">node.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1513</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1514</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1515</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1516</span> 
-<span class='line'>1517</span> </span><span class="COMM">/**
-<span class='line'>1518</span>  * Removes the item from the list.
-<span class='line'>1519</span>  * @param item {*} The item to remove.
-<span class='line'>1520</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>1521</span>  * @return {void}
-<span class='line'>1522</span>  */</span><span class="WHIT">
-<span class='line'>1523</span> </span><span class="NAME">DoubleLinkedList.prototype.remove</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1524</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1525</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1526</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1527</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1528</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">previous</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1529</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1530</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1531</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.first</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1532</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.first</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1533</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1534</span> </span><span class="WHIT">				</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1535</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">previous</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1536</span> </span><span class="WHIT">				</span><span
-        class="NAME">previous.next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1537</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.next</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1538</span> </span><span class="WHIT">					</span><span class="NAME">node.next.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1539</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>1540</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1541</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1542</span> </span><span class="WHIT">		</span><span class="NAME">previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1543</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1544</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1545</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1546</span> 
-<span class='line'>1547</span> </span><span class="COMM">/**
-<span class='line'>1548</span>  * Removes all the item from the list.
-<span class='line'>1549</span>  * @param item {*} The item to remove.
-<span class='line'>1550</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>1551</span>  * @return {void}
-<span class='line'>1552</span>  */</span><span class="WHIT">
-<span class='line'>1553</span> </span><span class="NAME">DoubleLinkedList.prototype.removeAll</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1554</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1555</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1556</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1557</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1558</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">previous</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1559</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1560</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1561</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.first</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1562</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.first</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1563</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1564</span> </span><span class="WHIT">				</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1565</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">previous</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1566</span> </span><span class="WHIT">				</span><span
-        class="NAME">previous.next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1567</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.next</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1568</span> </span><span class="WHIT">					</span><span class="NAME">node.next.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1569</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>1570</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>1571</span> </span><span class="WHIT">			</span><span class="NAME">previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1572</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1573</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1574</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1575</span> 
-<span class='line'>1576</span> </span><span class="COMM">/**
-<span class='line'>1577</span>  * Removes all the items stored from the from position to the to position.
-<span class='line'>1578</span>  * If from > to, the method will remove all the items up to the end.
-<span class='line'>1579</span>  * @param from {number} The position where start to remove the items. The from position is included.
-<span class='line'>1580</span>  * @param to {number} The position where stop to remove the items. The to position is included.
-<span class='line'>1581</span>  * @return {Array&lt;*>} The items removed.
-<span class='line'>1582</span>  */</span><span class="WHIT">
-<span class='line'>1583</span> </span><span class="NAME">DoubleLinkedList.prototype.removeSegment</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">from</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1584</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1585</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">to</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1586</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">from</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1587</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.multiPopFront</span><span class="PUNC">(</span><span class="NAME">to</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1588</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">to</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1589</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.multiPopBack</span><span class="PUNC">(</span><span class="NAME">Math.max</span><span
-        class="PUNC">(</span><span class="NAME">to</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NAME">from</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">reverse</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1590</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1591</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1592</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1593</span> </span><span class="WHIT">		</span><span class="COMM">//now node is the node before the node to remove</span><span
-        class="WHIT">
-<span class='line'>1594</span> </span><span class="WHIT">		</span><span class="COMM">//node to remove</span><span
-        class="WHIT">
-<span class='line'>1595</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1596</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1597</span> </span><span class="WHIT">			</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">next.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1598</span> </span><span class="WHIT">			</span><span class="NAME">next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">next.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1599</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1600</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">Math.min</span><span class="PUNC">(</span><span class="NAME">to</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">from</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1601</span> </span><span class="WHIT">		</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">next</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1602</span> </span><span class="WHIT">		</span><span class="NAME">next.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1603</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1604</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1605</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1606</span> 
-<span class='line'>1607</span> </span><span class="COMM">/**
-<span class='line'>1608</span>  * Changes the item stored in the index position. If the index is out of bound, the node won't be updated.
-<span class='line'>1609</span>  * @param index {number} The position of the node to modify.
-<span class='line'>1610</span>  * @param item {*} The new item stored in the node.
-<span class='line'>1611</span>  * @return {void}
-<span class='line'>1612</span>  */</span><span class="WHIT">
-<span class='line'>1613</span> </span><span class="NAME">DoubleLinkedList.prototype.modifyAt</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">item</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1614</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getNode</span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1615</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1616</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">item</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1617</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1618</span> 
-<span class='line'>1619</span> </span><span class="COMM">/**
-<span class='line'>1620</span>  * Removes all the items stored in the list.
-<span class='line'>1621</span>  * @return {void}
-<span class='line'>1622</span>  */</span><span class="WHIT">
-<span class='line'>1623</span> </span><span class="NAME">DoubleLinkedList.prototype.clear</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1624</span> </span><span class="WHIT">	</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1625</span> </span><span class="WHIT">	</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1626</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1627</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1628</span> 
-<span class='line'>1629</span> </span><span class="COMM">/**
-<span class='line'>1630</span>  * Checks if the list contains an item that satisfy the condition represented by the callback function.
-<span class='line'>1631</span>  * @param item {*} The item to find.
-<span class='line'>1632</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>1633</span>  * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
-<span class='line'>1634</span>  */</span><span class="WHIT">
-<span class='line'>1635</span> </span><span class="NAME">DoubleLinkedList.prototype.contains</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1636</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1637</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1638</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1639</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1640</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1641</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">!</span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">node.item</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1642</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1643</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1644</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1645</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span
-        class="WHIT"> </span><span class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1646</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1647</span> 
-<span class='line'>1648</span> </span><span class="COMM">/**
-<span class='line'>1649</span>  * Executes the callback function for each item of the stack.
-<span class='line'>1650</span>  * This method modifies the list so if you don't need to modify it you must return the same item of the array.
-<span class='line'>1651</span>  * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
-<span class='line'>1652</span>  * @return {void}
-<span class='line'>1653</span>  */</span><span class="WHIT">
-<span class='line'>1654</span> </span><span class="NAME">DoubleLinkedList.prototype.execute</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1655</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1656</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1657</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">node.item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1658</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1659</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1660</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1661</span> 
-<span class='line'>1662</span> </span><span class="COMM">/**
-<span class='line'>1663</span>  * Deletes the node from the list.
-<span class='line'>1664</span>  * @param node {DLLNode} The node to delete.
-<span class='line'>1665</span>  * @return {void}
-<span class='line'>1666</span>  */</span><span class="WHIT">
-<span class='line'>1667</span> </span><span class="NAME">DoubleLinkedList.prototype.deleteNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1668</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.first</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1669</span> </span><span class="WHIT">		</span><span class="NAME">this.popFront</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1670</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1671</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1672</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1673</span> </span><span class="WHIT">		</span><span class="NAME">this.popBack</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1674</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1675</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1676</span> </span><span class="WHIT">	</span><span class="NAME">node.previous.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1677</span> </span><span class="WHIT">	</span><span class="NAME">node.next.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1678</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1679</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1680</span> 
-<span class='line'>1681</span> </span><span class="COMM">/**
-<span class='line'>1682</span>  * Gets the node at the position index relative from the node.
-<span class='line'>1683</span>  * @param index {Number} The index, relative to the node, of the node to return.
-<span class='line'>1684</span>  * @param [node = first] {DLLNode} The node from which start the search.
-<span class='line'>1685</span>  * @return {DLLNode} The node at the position index.
-<span class='line'>1686</span>  */</span><span class="WHIT">
-<span class='line'>1687</span> </span><span class="NAME">DoubleLinkedList.prototype.getNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1688</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1689</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1690</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">Math.floor</span><span class="PUNC">(</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">/</span><span class="WHIT"> </span><span class="NUMB">2</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1691</span> </span><span class="WHIT">	</span><span class="COMM">//if the index is less than the middle, the search start from the head of the list, otherwise from the tail of the list</span><span
-        class="WHIT">
-<span class='line'>1692</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1693</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">this.first</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1694</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1695</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1696</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>1697</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">></span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1698</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1699</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1700</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1701</span> 
-<span class='line'>1702</span> </span><span class="COMM">/**
-<span class='line'>1703</span>  * Gets the item at the position index.
-<span class='line'>1704</span>  * @param index {Number} The position of the item.
-<span class='line'>1705</span>  * @return {*}. It's undefined if index isn't in the queue bounds.
-<span class='line'>1706</span>  */</span><span class="WHIT">
-<span class='line'>1707</span> </span><span class="NAME">DoubleLinkedList.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1708</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1709</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1710</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1711</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">Math.floor</span><span class="PUNC">(</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">/</span><span class="WHIT"> </span><span class="NUMB">2</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1712</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">m</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="COMM">//if the index is less than the middle, the search start from the head of the list, otherwise from the tail of the list</span><span
-        class="WHIT">
-<span class='line'>1713</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.first</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">index</span><span class="PUNC">--</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>1714</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1715</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>1716</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">></span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1717</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1718</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1719</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1720</span> 
-<span class='line'>1721</span> </span><span class="COMM">/**
-<span class='line'>1722</span>  * Sorts the list using web workers.
-<span class='line'>1723</span>  * Using this method is discouraged. Many web browser set a limit to the maximum number of workers instantiated.
-<span class='line'>1724</span>  * The items of the list, due to web workers implementation, will be serialized so they will lost own methods.
-<span class='line'>1725</span>  * @return {void}
-<span class='line'>1726</span>  */</span><span class="WHIT">
-<span class='line'>1727</span> </span><span class="NAME">DoubleLinkedList.prototype.parallelSort</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1728</span> 
-<span class='line'>1729</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">workers</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1730</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">_array</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.toArray</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1731</span> </span><span class="WHIT">	</span><span class="NAME">console.log</span><span
-        class="PUNC">(</span><span class="NAME">_array</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1732</span> 
-<span class='line'>1733</span> </span><span class="WHIT">	</span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="NAME">partialSort</span><span class="PUNC">(</span><span
-        class="NAME">_from</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">_to</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">_id</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1734</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">_from</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">_to</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1735</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">Math.floor</span><span class="PUNC">(</span><span
-        class="PUNC">(</span><span class="NAME">_from</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">_to</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">/</span><span class="WHIT"> </span><span class="NUMB">2</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1736</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">workerLeft</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">Worker</span><span class="PUNC">(</span><span
-        class="STRN">"DoubleLinkedList/WorkerSort.js"</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1737</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">workerRight</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">Worker</span><span class="PUNC">(</span><span
-        class="STRN">"DoubleLinkedList/WorkerSort.js"</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1738</span> </span><span class="WHIT">			</span><span class="NAME">workers.push</span><span
-        class="PUNC">(</span><span class="NAME">workerLeft</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1739</span> </span><span class="WHIT">			</span><span class="NAME">workers.push</span><span
-        class="PUNC">(</span><span class="NAME">workerRight</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1740</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">length</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">workers.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1741</span> </span><span class="WHIT">			</span><span
-        class="NAME">workerLeft.postMessage</span><span class="PUNC">(</span><span class="PUNC">{</span><span
-        class="NAME">cmd</span><span class="PUNC">:</span><span class="WHIT"> </span><span
-        class="STRN">'start'</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="PUNC">:</span><span class="WHIT"> </span><span
-        class="NAME">_from</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="PUNC">:</span><span class="WHIT"> </span><span class="NAME">m</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">worker</span><span class="PUNC">:</span><span class="WHIT"> </span><span
-        class="NAME">_id</span><span class="PUNC">}</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1742</span> </span><span class="WHIT">			</span><span
-        class="NAME">workerRight.postMessage</span><span class="PUNC">(</span><span class="PUNC">{</span><span
-        class="NAME">cmd</span><span class="PUNC">:</span><span class="WHIT"> </span><span
-        class="STRN">'start'</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="PUNC">:</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">:</span><span
-        class="WHIT"> </span><span class="NAME">_to</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">worker</span><span class="PUNC">:</span><span class="WHIT"> </span><span
-        class="NAME">_id</span><span class="PUNC">}</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1743</span> </span><span class="WHIT">			</span><span class="NAME">partialSort</span><span
-        class="PUNC">(</span><span class="NAME">_from</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">m</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">2</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1744</span> </span><span class="WHIT">			</span><span class="NAME">partialSort</span><span
-        class="PUNC">(</span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">_to</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">length</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1745</span> </span><span class="WHIT">			</span><span
-        class="NAME">workerLeft.onmessage</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">event</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1746</span> </span><span class="WHIT">				</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">data</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">event.data</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1747</span> </span><span class="WHIT">				</span><span class="KEYW">switch</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">data.cmd</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1748</span> </span><span class="WHIT">					</span><span class="KEYW">case</span><span
-        class="WHIT"> </span><span class="STRN">'finished'</span><span class="PUNC">:</span><span class="WHIT">
-<span class='line'>1749</span> </span><span class="WHIT">						</span><span
-        class="NAME">workers</span><span class="PUNC">[</span><span class="NAME">data.worker</span><span
-        class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">postMessage</span><span class="PUNC">(</span><span
-        class="PUNC">{</span><span class="NAME">cmd</span><span class="PUNC">:</span><span class="WHIT"> </span><span
-        class="STRN">'finished'</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">array</span><span class="PUNC">:</span><span class="WHIT"> </span><span
-        class="NAME">_array</span><span class="PUNC">}</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1750</span> </span><span class="WHIT">						</span><span
-        class="KEYW">break</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1751</span> </span><span class="WHIT">					</span><span class="KEYW">case</span><span
-        class="WHIT"> </span><span class="STRN">'replace'</span><span class="PUNC">:</span><span class="WHIT">
-<span class='line'>1752</span> </span><span class="WHIT">						</span><span class="NAME">_array</span><span
-        class="PUNC">[</span><span class="NAME">data.index</span><span class="PUNC">]</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">data.value</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1753</span> </span><span class="WHIT">						</span><span
-        class="KEYW">break</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1754</span> </span><span class="WHIT">				</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>1755</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1756</span> </span><span class="WHIT">			</span><span
-        class="NAME">workerRight.onmessage</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">event</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1757</span> </span><span class="WHIT">				</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">data</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">event.data</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1758</span> </span><span class="WHIT">				</span><span class="KEYW">switch</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">data.cmd</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1759</span> </span><span class="WHIT">					</span><span class="KEYW">case</span><span
-        class="WHIT"> </span><span class="STRN">'finished'</span><span class="PUNC">:</span><span class="WHIT">
-<span class='line'>1760</span> </span><span class="WHIT">						</span><span
-        class="NAME">workers</span><span class="PUNC">[</span><span class="NAME">data.worker</span><span
-        class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">postMessage</span><span class="PUNC">(</span><span
-        class="PUNC">{</span><span class="NAME">cmd</span><span class="PUNC">:</span><span class="WHIT"> </span><span
-        class="STRN">'finished'</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">array</span><span class="PUNC">:</span><span class="WHIT"> </span><span
-        class="NAME">_array</span><span class="PUNC">}</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1761</span> </span><span class="WHIT">						</span><span
-        class="KEYW">break</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1762</span> </span><span class="WHIT">					</span><span class="KEYW">case</span><span
-        class="WHIT"> </span><span class="STRN">'replace'</span><span class="PUNC">:</span><span class="WHIT">
-<span class='line'>1763</span> </span><span class="WHIT">						</span><span class="NAME">_array</span><span
-        class="PUNC">[</span><span class="NAME">data.index</span><span class="PUNC">]</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">data.value</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1764</span> </span><span class="WHIT">						</span><span
-        class="KEYW">break</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1765</span> </span><span class="WHIT">				</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>1766</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>1767</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1768</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1769</span> 
-<span class='line'>1770</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">outerThis</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">this</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1771</span> 
-<span class='line'>1772</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">mainWorker</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">Worker</span><span class="PUNC">(</span><span
-        class="STRN">"DoubleLinkedList/WorkerSort.js"</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1773</span> </span><span class="WHIT">	</span><span class="NAME">workers.push</span><span
-        class="PUNC">(</span><span class="NAME">mainWorker</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1774</span> </span><span class="WHIT">	</span><span
-        class="NAME">mainWorker.postMessage</span><span class="PUNC">(</span><span class="PUNC">{</span><span
-        class="NAME">cmd</span><span class="PUNC">:</span><span class="WHIT"> </span><span
-        class="STRN">'start'</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="PUNC">:</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">:</span><span
-        class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">worker</span><span class="PUNC">:</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="NUMB">1</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">array</span><span
-        class="PUNC">:</span><span class="WHIT"> </span><span class="NAME">_array</span><span class="PUNC">}</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1775</span> </span><span class="WHIT">	</span><span class="NAME">mainWorker.onmessage</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">event</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1776</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">data</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">event.data</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1777</span> </span><span class="WHIT">		</span><span class="KEYW">switch</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">data.cmd</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1778</span> </span><span class="WHIT">			</span><span class="KEYW">case</span><span
-        class="WHIT"> </span><span class="STRN">'finished'</span><span class="PUNC">:</span><span class="WHIT">
-<span class='line'>1779</span> </span><span class="WHIT">				</span><span
-        class="NAME">outerThis.fromArray</span><span class="PUNC">(</span><span class="NAME">_array</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1780</span> </span><span class="WHIT">				</span><span
-        class="NAME">console.log</span><span class="PUNC">(</span><span class="NAME">outerThis</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1781</span> </span><span class="WHIT">				</span><span class="KEYW">break</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1782</span> </span><span class="WHIT">			</span><span class="KEYW">case</span><span
-        class="WHIT"> </span><span class="STRN">'replace'</span><span class="PUNC">:</span><span class="WHIT">
-<span class='line'>1783</span> </span><span class="WHIT">				</span><span class="NAME">_array</span><span
-        class="PUNC">[</span><span class="NAME">data.index</span><span class="PUNC">]</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">data.value</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1784</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1785</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1786</span> </span><span class="WHIT">	</span><span class="NAME">partialSort</span><span
-        class="PUNC">(</span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1787</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1788</span> 
-<span class='line'>1789</span> </span><span class="COMM">/**
-<span class='line'>1790</span>  * Sorts the list.
-<span class='line'>1791</span>  * @param [callback = function(item){return(item);}] {function} The function invoked in order to get the value for the evaluation of the sort criteria.
-<span class='line'>1792</span>  * @example
-<span class='line'>1793</span>  * callback = function(item) {return -item.key;}
-<span class='line'>1794</span>  * 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.
-<span class='line'>1795</span>  * @return {void}
-<span class='line'>1796</span>  */</span><span class="WHIT">
-<span class='line'>1797</span> </span><span class="NAME">DoubleLinkedList.prototype.sort</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1798</span> 
-<span class='line'>1799</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1800</span> </span><span class="WHIT">		</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1801</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1802</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1803</span> 
-<span class='line'>1804</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">outerThis</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">this</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1805</span> 
-<span class='line'>1806</span> </span><span class="WHIT">	</span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="NAME">partialSort</span><span class="PUNC">(</span><span
-        class="NAME">from</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">fromNode</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">toNode</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1807</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">from</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1808</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">Math.floor</span><span class="PUNC">(</span><span
-        class="PUNC">(</span><span class="NAME">from</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">/</span><span class="WHIT"> </span><span class="NUMB">2</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1809</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">mNode</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">outerThis.getNode</span><span class="PUNC">(</span><span
-        class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">fromNode</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1810</span> </span><span class="WHIT">			</span><span class="NAME">partialSort</span><span
-        class="PUNC">(</span><span class="NAME">from</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">m</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">fromNode</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">mNode</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1811</span> </span><span class="WHIT">			</span><span class="NAME">partialSort</span><span
-        class="PUNC">(</span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">to</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">mNode.next</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">toNode</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1812</span> </span><span class="WHIT">			</span><span class="NAME">merge</span><span
-        class="PUNC">(</span><span class="NAME">from</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">m</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">fromNode</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1813</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1814</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1815</span> 
-<span class='line'>1816</span> </span><span class="WHIT">	</span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="NAME">merge</span><span class="PUNC">(</span><span
-        class="NAME">from</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">fromNode</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1817</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">left</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1818</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">right</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1819</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">fromNode</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1820</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.next</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1821</span> </span><span class="WHIT">			</span><span class="NAME">left</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.item</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1822</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">m</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span class="PUNC">++</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.next</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1823</span> </span><span class="WHIT">			</span><span class="NAME">right</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.item</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1824</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">x</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">y</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1825</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">k</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">k</span><span class="PUNC">++</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">fromNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">fromNode.next</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1826</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">y</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">to</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">left</span><span class="PUNC">[</span><span
-        class="NAME">x</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;=</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">right</span><span class="PUNC">[</span><span class="NAME">y</span><span
-        class="PUNC">]</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">&&</span><span
-        class="WHIT"> </span><span class="NAME">x</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span
-        class="WHIT"> </span><span class="NAME">m</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NAME">from</span><span class="WHIT"> </span><span class="PUNC">+</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1827</span> </span><span class="WHIT">				</span><span
-        class="NAME">fromNode.item</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">left</span><span class="PUNC">[</span><span class="NAME">x</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1828</span> </span><span class="WHIT">				</span><span class="NAME">x</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1829</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1830</span> </span><span class="WHIT">				</span><span
-        class="NAME">fromNode.item</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">right</span><span class="PUNC">[</span><span class="NAME">y</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1831</span> </span><span class="WHIT">				</span><span class="NAME">y</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1832</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>1833</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1834</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1835</span> 
-<span class='line'>1836</span> </span><span class="WHIT">	</span><span class="NAME">partialSort</span><span
-        class="PUNC">(</span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">this.last</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1837</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1838</span> 
-<span class='line'>1839</span> </span><span class="COMM">/**
-<span class='line'>1840</span>  * Transforms the list into an array.
-<span class='line'>1841</span>  * @return {Array&lt;*>} The array built.
-<span class='line'>1842</span>  */</span><span class="WHIT">
-<span class='line'>1843</span> </span><span class="NAME">DoubleLinkedList.prototype.toArray</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1844</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">array</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1845</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.next</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1846</span> </span><span class="WHIT">		</span><span class="NAME">array</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.item</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1847</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">array</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1848</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1849</span> 
-<span class='line'>1850</span> </span><span class="COMM">/**
-<span class='line'>1851</span>  * Returns the length of the list.
-<span class='line'>1852</span>  * @return {Number} The length of the list.
-<span class='line'>1853</span>  */</span><span class="WHIT">
-<span class='line'>1854</span> </span><span class="NAME">DoubleLinkedList.prototype.getLength</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1855</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1856</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1857</span> 
-<span class='line'>1858</span> </span><span class="COMM">/**
-<span class='line'>1859</span>  * Builds the list from the array.
-<span class='line'>1860</span>  * @param array {Array&lt;*>} The array from which build the list.
-<span class='line'>1861</span>  * @return {void}
-<span class='line'>1862</span>  */</span><span class="WHIT">
-<span class='line'>1863</span> </span><span class="NAME">DoubleLinkedList.prototype.fromArray</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">array</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1864</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1865</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">Math.min</span><span
-        class="PUNC">(</span><span class="NAME">this.length</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">array.length</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1866</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">array</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1867</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">array.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1868</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">array.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1869</span> </span><span class="WHIT">			</span><span class="NAME">this.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">array</span><span class="PUNC">[</span><span class="NAME">j</span><span
-        class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1870</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>1871</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">array.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>1872</span> </span><span class="WHIT">			</span><span class="NAME">this.popBack</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1873</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1874</span> 
-<span class='line'>1875</span> </span><span class="COMM">/**
-<span class='line'>1876</span>  * Returns the items that satisfy the condition determined by the callback.
-<span class='line'>1877</span>  * @param callback {function} The function that implements the condition.
-<span class='line'>1878</span>  * @return {Array&lt;Object>} The array that contains the items that satisfy the condition.
-<span class='line'>1879</span>  */</span><span class="WHIT">
-<span class='line'>1880</span> </span><span class="NAME">DoubleLinkedList.prototype.filter</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1881</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1882</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1883</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1884</span> </span><span class="WHIT">			</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1885</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1886</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1887</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1888</span> 
-<span class='line'>1889</span> </span><span class="COMM">/**
-<span class='line'>1890</span>  * Reverses the list. This method reverses only the items, not the nodes.
-<span class='line'>1891</span>  * @return {void}
-<span class='line'>1892</span>  */</span><span class="WHIT">
-<span class='line'>1893</span> </span><span class="NAME">DoubleLinkedList.prototype.reverse</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1894</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">start</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">end</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">start</span><span class="WHIT"> </span><span class="PUNC">!==</span><span
-        class="WHIT"> </span><span class="NAME">end</span><span class="WHIT"> </span><span class="PUNC">&&</span><span
-        class="WHIT"> </span><span class="NAME">start.previous</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="NAME">end</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">start</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">start.next</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">end</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">end.previous</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1895</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">start.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1896</span> </span><span class="WHIT">		</span><span class="NAME">start.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">end.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1897</span> </span><span class="WHIT">		</span><span class="NAME">end.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">item</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1898</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1899</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1900</span> 
-<span class='line'>1901</span> </span><span class="COMM">/**
-<span class='line'>1902</span>  * Checks if the list is empty.
-<span class='line'>1903</span>  * @return {boolean} True if the list is empty, false otherwise.
-<span class='line'>1904</span>  */</span><span class="WHIT">
-<span class='line'>1905</span> </span><span class="NAME">DoubleLinkedList.prototype.isEmpty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1906</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.length</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1907</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1908</span> 
-<span class='line'>1909</span> </span><span class="COMM">/**
-<span class='line'>1910</span>  * Returns the first position of the item in the list.
-<span class='line'>1911</span>  * @param item {*} The item to search.
-<span class='line'>1912</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>1913</span>  * @return {number} The first position of the item.
-<span class='line'>1914</span>  */</span><span class="WHIT">
-<span class='line'>1915</span> </span><span class="NAME">DoubleLinkedList.prototype.indexOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1916</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1917</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1918</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1919</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1920</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1921</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1922</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1923</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1924</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1925</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1926</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1927</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1928</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1929</span> 
-<span class='line'>1930</span> </span><span class="COMM">/**
-<span class='line'>1931</span>  * Returns the last position of the item in the list.
-<span class='line'>1932</span>  * @param item {*} The item to search.
-<span class='line'>1933</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>1934</span>  * @return {number} The last position of the item.
-<span class='line'>1935</span>  */</span><span class="WHIT">
-<span class='line'>1936</span> </span><span class="NAME">DoubleLinkedList.prototype.lastIndexOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1937</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1938</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1939</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1940</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1941</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1942</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1943</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1944</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1945</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1946</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1947</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1948</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1949</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1950</span> 
-<span class='line'>1951</span> </span><span class="COMM">/**
-<span class='line'>1952</span>  * Returns all the position in which the item has been found in the list.
-<span class='line'>1953</span>  * @param item {*} The item to search.
-<span class='line'>1954</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>1955</span>  * @return {Array&lt;number>} The positions in which the item has been found.
-<span class='line'>1956</span>  */</span><span class="WHIT">
-<span class='line'>1957</span> </span><span class="NAME">DoubleLinkedList.prototype.allIndexesOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1958</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>1959</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1960</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1961</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1962</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1963</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1964</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1965</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1966</span> </span><span class="WHIT">			</span><span class="NAME">indexes.push</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1967</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1968</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1969</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>1970</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1971</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1972</span> 
-<span class='line'>1973</span> </span><span class="COMM">/**
-<span class='line'>1974</span>  * Adds the list at the end of this list.
-<span class='line'>1975</span>  * @param list {DoubleLinkedList} The list to join.
-<span class='line'>1976</span>  * @return {void}
-<span class='line'>1977</span>  */</span><span class="WHIT">
-<span class='line'>1978</span> </span><span class="NAME">DoubleLinkedList.prototype.join</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">list</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>1979</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.last</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1980</span> </span><span class="WHIT">		</span><span class="NAME">this.last.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">list.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1981</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>1982</span> </span><span class="WHIT">		</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">list.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1983</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">list.first</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>1984</span> </span><span class="WHIT">		</span><span
-        class="NAME">list.first.previous</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1985</span> </span><span class="WHIT">	</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">list.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1986</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">list.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1987</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1988</span> 
-<span class='line'>1989</span> </span><span class="COMM">/**
-<span class='line'>1990</span>  * Divides the list at the index position. The node at the index position is the first new node of the list.
-<span class='line'>1991</span>  * @param index {number} The position where to divide the list.
-<span class='line'>1992</span>  * @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.
-<span class='line'>1993</span>  */</span><span class="WHIT">
-<span class='line'>1994</span> </span><span class="NAME">DoubleLinkedList.prototype.divide</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1995</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">DoubleLinkedList</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>1996</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>1997</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>1998</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">previous</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>1999</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2000</span> </span><span class="WHIT">			</span><span class="NAME">previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2001</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2002</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2003</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.first</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2004</span> </span><span class="WHIT">			</span><span class="NAME">list.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2005</span> </span><span class="WHIT">			</span><span class="NAME">list.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2006</span> </span><span class="WHIT">			</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2007</span> </span><span class="WHIT">			</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2008</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2009</span> </span><span class="WHIT">			</span><span class="NAME">list.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2010</span> </span><span class="WHIT">			</span><span class="NAME">list.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2011</span> </span><span class="WHIT">			</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2012</span> </span><span class="WHIT">			</span><span class="NAME">previous.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2013</span> </span><span class="WHIT">			</span><span class="NAME">node.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2014</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2015</span> </span><span class="WHIT">		</span><span class="NAME">list.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2016</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2017</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2018</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2019</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2020</span> 
-<span class='line'>2021</span> </span><span class="COMM">/**
-<span class='line'>2022</span>  * Clones the list into a new list.
-<span class='line'>2023</span>  * @return {DoubleLinkedList} The list cloned from this list.
-<span class='line'>2024</span>  */</span><span class="WHIT">
-<span class='line'>2025</span> </span><span class="NAME">DoubleLinkedList.prototype.clone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2026</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">DoubleLinkedList</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2027</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2028</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2029</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.item.clone</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2030</span> </span><span class="WHIT">			</span><span class="NAME">list.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">node.item.clone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2031</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>2032</span> </span><span class="WHIT">			</span><span class="NAME">list.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2033</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2034</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2035</span> 
-<span class='line'>2036</span> </span><span class="COMM">/**
-<span class='line'>2037</span>  * Clones the list into a new list without cloning duplicated items.
-<span class='line'>2038</span>  * @return {DoubleLinkedList} The list cloned from this list.
-<span class='line'>2039</span>  */</span><span class="WHIT">
-<span class='line'>2040</span> </span><span class="NAME">DoubleLinkedList.prototype.cloneDistinct</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2041</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">DoubleLinkedList</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2042</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2043</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2044</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">list.contains</span><span class="PUNC">(</span><span class="NAME">node.item</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2045</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.item.cloneDistinct</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2046</span> </span><span class="WHIT">				</span><span
-        class="NAME">list.pushBack</span><span class="PUNC">(</span><span
-        class="NAME">node.item.cloneDistinct</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2047</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">node.item.clone</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2048</span> </span><span class="WHIT">				</span><span
-        class="NAME">list.pushBack</span><span class="PUNC">(</span><span class="NAME">node.item.clone</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2049</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>2050</span> </span><span class="WHIT">				</span><span
-        class="NAME">list.pushBack</span><span class="PUNC">(</span><span class="NAME">node.item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2051</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2052</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2053</span> 
-<span class='line'>2054</span> </span><span class="COMM">/**
-<span class='line'>2055</span>  * Splits the list into lists of desired size.
-<span class='line'>2056</span>  * @param size {number} The size of the lists.
-<span class='line'>2057</span>  * @return {Array&lt;DoubleLinkedList>} The lists created by splitting the list.
-<span class='line'>2058</span>  */</span><span class="WHIT">
-<span class='line'>2059</span> </span><span class="NAME">DoubleLinkedList.prototype.split</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">size</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2060</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">length</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2061</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">lists</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="KEYW">this</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2062</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">size</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">size</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2063</span> </span><span class="WHIT">		</span><span class="NAME">lists.push</span><span
-        class="PUNC">(</span><span class="NAME">lists</span><span class="PUNC">[</span><span
-        class="NAME">lists.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">divide</span><span class="PUNC">(</span><span class="NAME">size</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2064</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">lists</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2065</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2066</span> 
-<span class='line'>2067</span> </span><span class="COMM">/**
-<span class='line'>2068</span>  * Returns the number of items that satisfy the represented by the callback function.
-<span class='line'>2069</span>  * @param callback {function} The condition to satisfy.
-<span class='line'>2070</span>  * @return {number} The number of items that satisfy the condition.
-<span class='line'>2071</span>  */</span><span class="WHIT">
-<span class='line'>2072</span> </span><span class="NAME">DoubleLinkedList.prototype.count</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2073</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">count</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2074</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2075</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2076</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2077</span> </span><span class="WHIT">			</span><span class="NAME">count</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2078</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2079</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2080</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">count</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2081</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2082</span> 
-<span class='line'>2083</span> </span><span class="COMM">/**
-<span class='line'>2084</span>  * Class that implements the iterator for a double linked list.
-<span class='line'>2085</span>  * @param aggregate {DoubleLinkedList} The aggregate to scan.
-<span class='line'>2086</span>  * @constructor
-<span class='line'>2087</span>  */</span><span class="WHIT">
-<span class='line'>2088</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">DoubleLinkedListIterator</span><span
-        class="PUNC">(</span><span class="NAME">aggregate</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2089</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2090</span> 	 * The aggregate relates to this iterator.
-<span class='line'>2091</span> 	 * @type {DoubleLinkedList}
-<span class='line'>2092</span> 	 */</span><span class="WHIT">
-<span class='line'>2093</span> </span><span class="WHIT">	</span><span class="NAME">this.aggregate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">aggregate</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2094</span> 
-<span class='line'>2095</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2096</span> 	 * The pointer to the position.
-<span class='line'>2097</span> 	 * @type {Node|null}
-<span class='line'>2098</span> 	 */</span><span class="WHIT">
-<span class='line'>2099</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2100</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2101</span> 
-<span class='line'>2102</span> </span><span class="COMM">/**
-<span class='line'>2103</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'>2104</span>  * @return {void}
-<span class='line'>2105</span>  */</span><span class="WHIT">
-<span class='line'>2106</span> </span><span class="NAME">DoubleLinkedListIterator.prototype.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2107</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.first</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2108</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2109</span> 
-<span class='line'>2110</span> </span><span class="COMM">/**
-<span class='line'>2111</span>  * Moves the iterator to the next item.
-<span class='line'>2112</span>  * @return {void}
-<span class='line'>2113</span>  */</span><span class="WHIT">
-<span class='line'>2114</span> </span><span class="NAME">DoubleLinkedListIterator.prototype.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2115</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.pointer.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2116</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2117</span> 
-<span class='line'>2118</span> </span><span class="COMM">/**
-<span class='line'>2119</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'>2120</span>  * @return {void}
-<span class='line'>2121</span>  */</span><span class="WHIT">
-<span class='line'>2122</span> </span><span class="NAME">DoubleLinkedListIterator.prototype.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2123</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.last</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2124</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2125</span> 
-<span class='line'>2126</span> </span><span class="COMM">/**
-<span class='line'>2127</span>  * Moves the iterator to the previous item.
-<span class='line'>2128</span>  * @return {void}
-<span class='line'>2129</span>  */</span><span class="WHIT">
-<span class='line'>2130</span> </span><span class="NAME">DoubleLinkedListIterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2131</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.pointer.previous</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2132</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2133</span> 
-<span class='line'>2134</span> </span><span class="COMM">/**
-<span class='line'>2135</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'>2136</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'>2137</span>  */</span><span class="WHIT">
-<span class='line'>2138</span> </span><span class="NAME">DoubleLinkedListIterator.prototype.isDone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2139</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.pointer</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2140</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2141</span> 
-<span class='line'>2142</span> </span><span class="COMM">/**
-<span class='line'>2143</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'>2144</span>  * @abstract
-<span class='line'>2145</span>  * @return {*} The item stored or undefined if it's out of the bounds.
-<span class='line'>2146</span>  */</span><span class="WHIT">
-<span class='line'>2147</span> </span><span class="NAME">DoubleLinkedListIterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2148</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2149</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2150</span> 
-<span class='line'>2151</span> </span><span class="COMM">/**
-<span class='line'>2152</span>  * Returns the node stored at the position pointed by the iterator.
-<span class='line'>2153</span>  * @abstract
-<span class='line'>2154</span>  * @return {DLLNode|null} The node stored or null if it's out of the bounds.
-<span class='line'>2155</span>  */</span><span class="WHIT">
-<span class='line'>2156</span> </span><span class="NAME">DoubleLinkedListIterator.prototype.getNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2157</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2158</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2159</span> 
-<span class='line'>2160</span> </span><span class="COMM">/**
-<span class='line'>2161</span>  * Class for managing an hash table.
-<span class='line'>2162</span>  * @param size {number} The size of the table.
-<span class='line'>2163</span>  * @constructor
-<span class='line'>2164</span>  */</span><span class="WHIT">
-<span class='line'>2165</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">HashTable</span><span
-        class="PUNC">(</span><span class="NAME">size</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2166</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2167</span> 	 * The size of the table
-<span class='line'>2168</span> 	 * @type {number}
-<span class='line'>2169</span> 	 */</span><span class="WHIT">
-<span class='line'>2170</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2171</span> 
-<span class='line'>2172</span> </span><span class="WHIT">	</span><span class="NAME">this.p</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">1000</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2173</span> 
-<span class='line'>2174</span> </span><span class="WHIT">	</span><span class="NAME">this.a</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">Math.floor</span><span class="PUNC">(</span><span class="NAME">Math.random</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">*</span><span
-        class="WHIT"> </span><span class="NAME">this.p</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2175</span> 
-<span class='line'>2176</span> </span><span class="WHIT">	</span><span class="NAME">this.b</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">Math.floor</span><span class="PUNC">(</span><span class="NAME">Math.random</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">*</span><span
-        class="WHIT"> </span><span class="NAME">this.p</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2177</span> 
-<span class='line'>2178</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2179</span> 	 * Calculate the hash of the param key.
-<span class='line'>2180</span> 	 * @param key {number} The key to hash.
-<span class='line'>2181</span> 	 * @return {number} The hash of the key.
-<span class='line'>2182</span> 	 */</span><span class="WHIT">
-<span class='line'>2183</span> </span><span class="WHIT">	</span><span class="NAME">this.hash</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2184</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">(</span><span class="NAME">this.a</span><span
-        class="WHIT"> </span><span class="PUNC">*</span><span class="WHIT"> </span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NAME">this.b</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">%</span><span class="WHIT"> </span><span
-        class="NAME">this.p</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">%</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2185</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2186</span> 
-<span class='line'>2187</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2188</span> 	 * The items stored in the hash table.
-<span class='line'>2189</span> 	 * @type {Array&lt;DoubleLinkedList>}
-<span class='line'>2190</span> 	 */</span><span class="WHIT">
-<span class='line'>2191</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2192</span> 
-<span class='line'>2193</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2194</span> 	 * The number of keys stored in the hash table.
-<span class='line'>2195</span> 	 * @type {number}
-<span class='line'>2196</span> 	 */</span><span class="WHIT">
-<span class='line'>2197</span> </span><span class="WHIT">	</span><span class="NAME">this.keyLength</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2198</span> 
-<span class='line'>2199</span> </span><span class="WHIT">	</span><span class="NAME">this.clear</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2200</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2201</span> 
-<span class='line'>2202</span> </span><span class="COMM">/**
-<span class='line'>2203</span>  * Stores the item with its key.
-<span class='line'>2204</span>  * @param key {number} The key relatives to the item.
-<span class='line'>2205</span>  * @param item {*} The item to store.
-<span class='line'>2206</span>  */</span><span class="WHIT">
-<span class='line'>2207</span> </span><span class="NAME">HashTable.prototype.insert</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2208</span> </span><span class="WHIT">	</span><span class="NAME">this.keyLength</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2209</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">this.hash</span><span class="PUNC">(</span><span class="NAME">key</span><span
-        class="PUNC">)</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">pushBack</span><span class="PUNC">(</span><span class="PUNC">{</span><span
-        class="NAME">key</span><span class="PUNC">:</span><span class="WHIT"> </span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">:</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">}</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2210</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2211</span> 
-<span class='line'>2212</span> </span><span class="COMM">/**
-<span class='line'>2213</span>  * Deletes the first item relatives to the key value.
-<span class='line'>2214</span>  * @param key {number} The key to delete.
-<span class='line'>2215</span>  * @return {void}
-<span class='line'>2216</span>  */</span><span class="WHIT">
-<span class='line'>2217</span> </span><span class="NAME">HashTable.prototype.deleteKey</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2218</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">this.hash</span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2219</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">list.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2220</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">it.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">!==</span><span
-        class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">;</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2221</span> </span><span class="WHIT">		</span><span class="NAME">it.next</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2222</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">it.isDone</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2223</span> </span><span class="WHIT">		</span><span class="NAME">list.deleteNode</span><span
-        class="PUNC">(</span><span class="NAME">it.getNode</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2224</span> </span><span class="WHIT">		</span><span class="NAME">this.keyLength</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2225</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2226</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2227</span> 
-<span class='line'>2228</span> </span><span class="COMM">/**
-<span class='line'>2229</span>  * Deletes all the items relative to the key value.
-<span class='line'>2230</span>  * @param key {number} The key to delete.
-<span class='line'>2231</span>  * @return {void}
-<span class='line'>2232</span>  */</span><span class="WHIT">
-<span class='line'>2233</span> </span><span class="NAME">HashTable.prototype.deleteAllKey</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2234</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">this.hash</span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2235</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">list.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2236</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">keysRemoved</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2237</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2238</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">key</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2239</span> </span><span class="WHIT">			</span><span
-        class="NAME">list.deleteNode</span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2240</span> </span><span class="WHIT">			</span><span class="NAME">keysRemoved</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2241</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2242</span> </span><span class="WHIT">	</span><span class="NAME">this.keyLength</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">keysRemoved</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2243</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2244</span> 
-<span class='line'>2245</span> </span><span class="COMM">/**
-<span class='line'>2246</span>  * Searches the item relative to the key value.
-<span class='line'>2247</span>  * @param key {number} The key of the item to search.
-<span class='line'>2248</span>  * @return {*|undefined} The item found or undefined if the key does not exist.
-<span class='line'>2249</span>  */</span><span class="WHIT">
-<span class='line'>2250</span> </span><span class="NAME">HashTable.prototype.search</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2251</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">this.hash</span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2252</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">list.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2253</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2254</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">key</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2255</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2256</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2257</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2258</span> 
-<span class='line'>2259</span> </span><span class="COMM">/**
-<span class='line'>2260</span>  * Checks if the hash table contains a key that satisfy the condition represented by the callback function.
-<span class='line'>2261</span>  * @param key {number} The key to find.
-<span class='line'>2262</span>  * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
-<span class='line'>2263</span>  * @return {boolean} True if the hash table contains the key that satisfy the condition, false otherwise.
-<span class='line'>2264</span>  */</span><span class="WHIT">
-<span class='line'>2265</span> </span><span class="NAME">HashTable.prototype.containsKey</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2266</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">k</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2267</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2268</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2269</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">this.hash</span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2270</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">list.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2271</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2272</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2273</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">true</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2274</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">false</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2275</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2276</span> 
-<span class='line'>2277</span> </span><span class="COMM">/**
-<span class='line'>2278</span>  * Searches all the items relative to the key value.
-<span class='line'>2279</span>  * @param key {number} The key of the items to search.
-<span class='line'>2280</span>  * @return {Array.&lt;*>} An array with the items found.
-<span class='line'>2281</span>  */</span><span class="WHIT">
-<span class='line'>2282</span> </span><span class="NAME">HashTable.prototype.searchAll</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2283</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">this.hash</span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2284</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">list.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2285</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">array</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2286</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2287</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">key</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2288</span> </span><span class="WHIT">			</span><span class="NAME">array.push</span><span
-        class="PUNC">(</span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2289</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">array</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2290</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2291</span> 
-<span class='line'>2292</span> </span><span class="COMM">/**
-<span class='line'>2293</span>  * Returns the keys stored in the hash table.
-<span class='line'>2294</span>  * @return {Array&lt;number>} The keys stored in the table.
-<span class='line'>2295</span>  */</span><span class="WHIT">
-<span class='line'>2296</span> </span><span class="NAME">HashTable.prototype.getKeys</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2297</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">keys</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2298</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2299</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">getIterator</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2300</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2301</span> </span><span class="WHIT">			</span><span class="NAME">keys.push</span><span
-        class="PUNC">(</span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2302</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2303</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">keys</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2304</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2305</span> 
-<span class='line'>2306</span> </span><span class="COMM">/**
-<span class='line'>2307</span>  * Returns the items stored in the hash table.
-<span class='line'>2308</span>  * @return {Array&lt;*>} The items stored in the table.
-<span class='line'>2309</span>  */</span><span class="WHIT">
-<span class='line'>2310</span> </span><span class="NAME">HashTable.prototype.getItems</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2311</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">items</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2312</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2313</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">getIterator</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2314</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2315</span> </span><span class="WHIT">			</span><span class="NAME">items.push</span><span
-        class="PUNC">(</span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2316</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2317</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">items</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2318</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2319</span> 
-<span class='line'>2320</span> </span><span class="COMM">/**
-<span class='line'>2321</span>  * Removes all the keys and the items stored in the hash table.
-<span class='line'>2322</span>  * @return {void}
-<span class='line'>2323</span>  */</span><span class="WHIT">
-<span class='line'>2324</span> </span><span class="NAME">HashTable.prototype.clear</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2325</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2326</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2327</span> </span><span class="WHIT">		</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">DoubleLinkedList</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2328</span> </span><span class="WHIT">	</span><span class="NAME">this.keyLength</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2329</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2330</span> 
-<span class='line'>2331</span> </span><span class="COMM">/**
-<span class='line'>2332</span>  * Returns the number of keys stored in the hash table.
-<span class='line'>2333</span>  * @return {number} The number of keys stored.
-<span class='line'>2334</span>  */</span><span class="WHIT">
-<span class='line'>2335</span> </span><span class="NAME">HashTable.prototype.getNumberOfKeys</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2336</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.keyLength</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2337</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2338</span> 
-<span class='line'>2339</span> </span><span class="COMM">/**
-<span class='line'>2340</span>  * Checks if the hash table is empty.
-<span class='line'>2341</span>  * @return {boolean} True if the hash table is empty, false otherwise.
-<span class='line'>2342</span>  */</span><span class="WHIT">
-<span class='line'>2343</span> </span><span class="NAME">HashTable.prototype.isEmpty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2344</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.keyLength</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2345</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2346</span> 
-<span class='line'>2347</span> </span><span class="COMM">/**
-<span class='line'>2348</span>  * Executes the callback function for each item of the hash table.
-<span class='line'>2349</span>  * This method modifies the hash table so if you don't need to modify it you must return the same item stored.
-<span class='line'>2350</span>  * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
-<span class='line'>2351</span>  * @return {void}
-<span class='line'>2352</span>  */</span><span class="WHIT">
-<span class='line'>2353</span> </span><span class="NAME">HashTable.prototype.execute</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2354</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2355</span> </span><span class="WHIT">		</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">execute</span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2356</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2357</span> 
-<span class='line'>2358</span> </span><span class="COMM">/**
-<span class='line'>2359</span>  * Returns the items that satisfy the condition determined by the callback.
-<span class='line'>2360</span>  * @param callback {function} The function that implements the condition.
-<span class='line'>2361</span>  * @return {Array&lt;*>} The array that contains the items that satisfy the condition.
-<span class='line'>2362</span>  */</span><span class="WHIT">
-<span class='line'>2363</span> </span><span class="NAME">HashTable.prototype.filter</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2364</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2365</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2366</span> </span><span class="WHIT">		</span><span class="NAME">result.concat</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">filter</span><span
-        class="PUNC">(</span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2367</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2368</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2369</span> 
-<span class='line'>2370</span> </span><span class="COMM">/**
-<span class='line'>2371</span>  * Returns the size of the hash table.
-<span class='line'>2372</span>  * @return {number} The size of the hash table.
-<span class='line'>2373</span>  */</span><span class="WHIT">
-<span class='line'>2374</span> </span><span class="NAME">HashTable.prototype.getSize</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2375</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2376</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2377</span> 
-<span class='line'>2378</span> </span><span class="COMM">/**
-<span class='line'>2379</span>  * Clones the hash table into a new hash table.
-<span class='line'>2380</span>  * @return {HashTable} The hash table cloned from this hash table.
-<span class='line'>2381</span>  */</span><span class="WHIT">
-<span class='line'>2382</span> </span><span class="NAME">HashTable.prototype.clone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2383</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">table</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span class="NAME">HashTable</span><span
-        class="PUNC">(</span><span class="NAME">this.size</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2384</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2385</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.items</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">first</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2386</span> </span><span class="WHIT">			</span><span class="NAME">table.insert</span><span
-        class="PUNC">(</span><span class="NAME">node.key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2387</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">table</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2388</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2389</span> 
-<span class='line'>2390</span> </span><span class="COMM">/**
-<span class='line'>2391</span>  * Class for managing a linked list.
-<span class='line'>2392</span>  * @param {...*} [args] The items for initializing the list.
-<span class='line'>2393</span>  * @constructor
-<span class='line'>2394</span>  */</span><span class="WHIT">
-<span class='line'>2395</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">LinkedList</span><span
-        class="PUNC">(</span><span class="NAME">args</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2396</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2397</span> 	 * The first node of the list.
-<span class='line'>2398</span> 	 * @type {LLNode|null}
-<span class='line'>2399</span> 	 */</span><span class="WHIT">
-<span class='line'>2400</span> </span><span class="WHIT">	</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2401</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2402</span> 	 * The last node of the list.
-<span class='line'>2403</span> 	 * @type {LLNode|null}
-<span class='line'>2404</span> 	 */</span><span class="WHIT">
-<span class='line'>2405</span> </span><span class="WHIT">	</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2406</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2407</span> 	 * The length of the list.
-<span class='line'>2408</span> 	 * @type {number}
-<span class='line'>2409</span> 	 */</span><span class="WHIT">
-<span class='line'>2410</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2411</span> </span><span class="WHIT">	</span><span class="COMM">//builds the list from the parameters of the constructor</span><span
-        class="WHIT">
-<span class='line'>2412</span> </span><span class="WHIT">	</span><span class="NAME">this.fromArray</span><span
-        class="PUNC">(</span><span class="NAME">arguments</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2413</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2414</span> 
-<span class='line'>2415</span> </span><span class="COMM">/**
-<span class='line'>2416</span>  * Returns the iterator relative to the aggregate.
-<span class='line'>2417</span>  * @return {Iterator} The iterator.
-<span class='line'>2418</span>  */</span><span class="WHIT">
-<span class='line'>2419</span> </span><span class="NAME">LinkedList.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2420</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span class="NAME">LinkedListIterator</span><span
-        class="PUNC">(</span><span class="KEYW">this</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2421</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2422</span> 
-<span class='line'>2423</span> </span><span class="COMM">/**
-<span class='line'>2424</span>  * Adds an item at the head of the list.
-<span class='line'>2425</span>  * @param item {*} The item to add.
-<span class='line'>2426</span>  * @return {void}
-<span class='line'>2427</span>  */</span><span class="WHIT">
-<span class='line'>2428</span> </span><span class="NAME">LinkedList.prototype.pushFront</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2429</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">LLNode</span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2430</span> </span><span class="WHIT">	</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2431</span> </span><span class="WHIT">	</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2432</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">this.last</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2433</span> </span><span class="WHIT">		</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2434</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2435</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2436</span> 
-<span class='line'>2437</span> </span><span class="COMM">/**
-<span class='line'>2438</span>  * Adds an item at the tail of the list.
-<span class='line'>2439</span>  * @param item {*} The item to add.
-<span class='line'>2440</span>  * @return {void}
-<span class='line'>2441</span>  */</span><span class="WHIT">
-<span class='line'>2442</span> </span><span class="NAME">LinkedList.prototype.pushBack</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2443</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">LLNode</span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2444</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.last</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2445</span> </span><span class="WHIT">		</span><span class="NAME">this.last.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2446</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>2447</span> </span><span class="WHIT">		</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2448</span> </span><span class="WHIT">	</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2449</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2450</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2451</span> 
-<span class='line'>2452</span> </span><span class="COMM">/**
-<span class='line'>2453</span>  * Removes the first item of the list.
-<span class='line'>2454</span>  * @return {*} The item removed. It's undefined if the list is empty.
-<span class='line'>2455</span>  */</span><span class="WHIT">
-<span class='line'>2456</span> </span><span class="NAME">LinkedList.prototype.popFront</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2457</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.length</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2458</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2459</span> </span><span class="WHIT">		</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2460</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2461</span> </span><span class="WHIT">		</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2462</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2463</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2464</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2465</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2466</span> 
-<span class='line'>2467</span> </span><span class="COMM">/**
-<span class='line'>2468</span>  * Removes the last item of the list.
-<span class='line'>2469</span>  * @return {*} The item removed. It's undefined if the list is empty.
-<span class='line'>2470</span>  */</span><span class="WHIT">
-<span class='line'>2471</span> </span><span class="NAME">LinkedList.prototype.popBack</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2472</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.length</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2473</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2474</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2475</span> </span><span class="WHIT">		</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">next.next</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">next.next.next</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2476</span> </span><span class="WHIT">			</span><span class="NAME">next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">next.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2477</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2478</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">next</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2479</span> </span><span class="WHIT">			</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2480</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>2481</span> </span><span class="WHIT">			</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">next</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2482</span> </span><span class="WHIT">		</span><span class="NAME">next.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2483</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2484</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2485</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2486</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2487</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2488</span> 
-<span class='line'>2489</span> </span><span class="COMM">/**
-<span class='line'>2490</span>  * Removes the first times items of the list.
-<span class='line'>2491</span>  * @param times {number} The number of times to repeat the popFront method.
-<span class='line'>2492</span>  * @return {*} The item removed. It's undefined if the list is empty.
-<span class='line'>2493</span>  */</span><span class="WHIT">
-<span class='line'>2494</span> </span><span class="NAME">LinkedList.prototype.multiPopFront</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">times</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2495</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2496</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">times</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2497</span> </span><span class="WHIT">		</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">this.popFront</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2498</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2499</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2500</span> 
-<span class='line'>2501</span> </span><span class="COMM">/**
-<span class='line'>2502</span>  * Removes the last times items of the list.
-<span class='line'>2503</span>  * @param times {number} The number of times to repeat the popBack method.
-<span class='line'>2504</span>  * @return {*} The items removed.
-<span class='line'>2505</span>  */</span><span class="WHIT">
-<span class='line'>2506</span> </span><span class="NAME">LinkedList.prototype.multiPopBack</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">times</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2507</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2508</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">times</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2509</span> </span><span class="WHIT">		</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">this.popBack</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2510</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2511</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2512</span> 
-<span class='line'>2513</span> </span><span class="COMM">/**
-<span class='line'>2514</span>  * Returns the first item of the list without remove it.
-<span class='line'>2515</span>  * @return {*} The item at the top of the list. It's undefined if the list is empty.
-<span class='line'>2516</span>  */</span><span class="WHIT">
-<span class='line'>2517</span> </span><span class="NAME">LinkedList.prototype.peek</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2518</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">this.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2519</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2520</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.first.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2521</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2522</span> 
-<span class='line'>2523</span> </span><span class="COMM">/**
-<span class='line'>2524</span>  * Adds the item at the index position.
-<span class='line'>2525</span>  * @param item {*} The item to add.
-<span class='line'>2526</span>  * @param index {number} The position where to add the item. If index is negative, the item won't be added.
-<span class='line'>2527</span>  * @return {void}
-<span class='line'>2528</span>  */</span><span class="WHIT">
-<span class='line'>2529</span> </span><span class="NAME">LinkedList.prototype.addAt</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2530</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2531</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2532</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">index</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2533</span> </span><span class="WHIT">		</span><span class="NAME">this.pushFront</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2534</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2535</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2536</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2537</span> </span><span class="WHIT">		</span><span class="NAME">this.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2538</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2539</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2540</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2541</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2542</span> </span><span class="WHIT">		</span><span class="NAME">this.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">undefined</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2543</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2544</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2545</span> </span><span class="WHIT">			</span><span class="NAME">this.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">undefined</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2546</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2547</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2548</span> </span><span class="WHIT">		</span><span class="NAME">this.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2549</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2550</span> </span><span class="WHIT">		</span><span class="NAME">this.pushFront</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2551</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2552</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">newNode</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">LLNode</span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2553</span> </span><span class="WHIT">		</span><span class="NAME">newNode.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2554</span> </span><span class="WHIT">		</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">newNode</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2555</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2556</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2557</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2558</span> 
-<span class='line'>2559</span> </span><span class="COMM">/**
-<span class='line'>2560</span>  * Removes the item at the index position.
-<span class='line'>2561</span>  * @param index {number} The position of the item to remove.
-<span class='line'>2562</span>  * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
-<span class='line'>2563</span>  */</span><span class="WHIT">
-<span class='line'>2564</span> </span><span class="NAME">LinkedList.prototype.removeAt</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2565</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2566</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2567</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2568</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.popFront</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2569</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2570</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.popBack</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2571</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2572</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2573</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2574</span> </span><span class="WHIT">	</span><span class="COMM">//now node is the node before the node to remove</span><span
-        class="WHIT">
-<span class='line'>2575</span> </span><span class="WHIT">	</span><span class="COMM">//node to remove</span><span
-        class="WHIT">
-<span class='line'>2576</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2577</span> </span><span class="WHIT">	</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">next.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2578</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2579</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">next.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2580</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2581</span> 
-<span class='line'>2582</span> </span><span class="COMM">/**
-<span class='line'>2583</span>  * Removes the item from the list.
-<span class='line'>2584</span>  * @param item {*} The item to remove.
-<span class='line'>2585</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>2586</span>  * @return {void}
-<span class='line'>2587</span>  */</span><span class="WHIT">
-<span class='line'>2588</span> </span><span class="NAME">LinkedList.prototype.remove</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2589</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2590</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2591</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2592</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2593</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">previous</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2594</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2595</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2596</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.first</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2597</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.first</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2598</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2599</span> </span><span class="WHIT">				</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2600</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">previous</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2601</span> </span><span class="WHIT">				</span><span
-        class="NAME">previous.next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2602</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2603</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2604</span> </span><span class="WHIT">		</span><span class="NAME">previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2605</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2606</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2607</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2608</span> 
-<span class='line'>2609</span> </span><span class="COMM">/**
-<span class='line'>2610</span>  * Removes all the item from the list.
-<span class='line'>2611</span>  * @param item {*} The item to remove.
-<span class='line'>2612</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>2613</span>  * @return {void}
-<span class='line'>2614</span>  */</span><span class="WHIT">
-<span class='line'>2615</span> </span><span class="NAME">LinkedList.prototype.removeAll</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2616</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2617</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2618</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2619</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2620</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">previous</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2621</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2622</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2623</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.first</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2624</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.first</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2625</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2626</span> </span><span class="WHIT">				</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2627</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">previous</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2628</span> </span><span class="WHIT">				</span><span
-        class="NAME">previous.next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2629</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>2630</span> </span><span class="WHIT">			</span><span class="NAME">previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2631</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2632</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2633</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2634</span> 
-<span class='line'>2635</span> </span><span class="COMM">/**
-<span class='line'>2636</span>  * Removes all the items stored from the from position to the to position.
-<span class='line'>2637</span>  * If from > to, the method will remove all the items up to the end.
-<span class='line'>2638</span>  * @param from {number} The position where start to remove the items. The from position is included.
-<span class='line'>2639</span>  * @param to {number} The position where stop to remove the items. The to position is included.
-<span class='line'>2640</span>  * @return {Array&lt;*>} The items removed.
-<span class='line'>2641</span>  */</span><span class="WHIT">
-<span class='line'>2642</span> </span><span class="NAME">LinkedList.prototype.removeSegment</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">from</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">to</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2643</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2644</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">to</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2645</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">from</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2646</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.multiPopFront</span><span class="PUNC">(</span><span class="NAME">to</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2647</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">to</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2648</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.multiPopBack</span><span class="PUNC">(</span><span class="NAME">Math.max</span><span
-        class="PUNC">(</span><span class="NAME">to</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NAME">from</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">reverse</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2649</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2650</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2651</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2652</span> </span><span class="WHIT">		</span><span class="COMM">//now node is the node before the node to remove</span><span
-        class="WHIT">
-<span class='line'>2653</span> </span><span class="WHIT">		</span><span class="COMM">//node to remove</span><span
-        class="WHIT">
-<span class='line'>2654</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2655</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">from</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">to</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2656</span> </span><span class="WHIT">			</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">next.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2657</span> </span><span class="WHIT">			</span><span class="NAME">next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">next.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2658</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2659</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">Math.min</span><span class="PUNC">(</span><span class="NAME">to</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">from</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">from</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2660</span> </span><span class="WHIT">		</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">next</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2661</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2662</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2663</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2664</span> 
-<span class='line'>2665</span> </span><span class="COMM">/**
-<span class='line'>2666</span>  * Changes the item stored in the index position. If the index is out of bound, the node won't be updated.
-<span class='line'>2667</span>  * @param index {number} The position of the node to modify.
-<span class='line'>2668</span>  * @param item {*} The new item stored in the node.
-<span class='line'>2669</span>  * @return {void}
-<span class='line'>2670</span>  */</span><span class="WHIT">
-<span class='line'>2671</span> </span><span class="NAME">LinkedList.prototype.modifyAt</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2672</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getNode</span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2673</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2674</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">item</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2675</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2676</span> 
-<span class='line'>2677</span> </span><span class="COMM">/**
-<span class='line'>2678</span>  * Removes all the items stored in the list.
-<span class='line'>2679</span>  * @return {void}
-<span class='line'>2680</span>  */</span><span class="WHIT">
-<span class='line'>2681</span> </span><span class="NAME">LinkedList.prototype.clear</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2682</span> </span><span class="WHIT">	</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2683</span> </span><span class="WHIT">	</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2684</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2685</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2686</span> 
-<span class='line'>2687</span> </span><span class="COMM">/**
-<span class='line'>2688</span>  * Checks if the list contains an item that satisfy the condition represented by the callback function.
-<span class='line'>2689</span>  * @param item {*} The item to find.
-<span class='line'>2690</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>2691</span>  * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
-<span class='line'>2692</span>  */</span><span class="WHIT">
-<span class='line'>2693</span> </span><span class="NAME">LinkedList.prototype.contains</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2694</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2695</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2696</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2697</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2698</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2699</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">!</span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">node.item</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2700</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2701</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2702</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2703</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span
-        class="WHIT"> </span><span class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2704</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2705</span> 
-<span class='line'>2706</span> </span><span class="COMM">/**
-<span class='line'>2707</span>  * Executes the callback function for each item of the stack.
-<span class='line'>2708</span>  * This method modifies the list so if you don't need to modify it you must return the same item of the array.
-<span class='line'>2709</span>  * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
-<span class='line'>2710</span>  * @return {void}
-<span class='line'>2711</span>  */</span><span class="WHIT">
-<span class='line'>2712</span> </span><span class="NAME">LinkedList.prototype.execute</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2713</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2714</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2715</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">node.item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2716</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2717</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2718</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2719</span> 
-<span class='line'>2720</span> </span><span class="COMM">/**
-<span class='line'>2721</span>  * Returns the node at the position index.
-<span class='line'>2722</span>  * @param index {number} The position of the node.
-<span class='line'>2723</span>  * @return {LLNode} The node stored at the position index. It's undefined if index isn't in the list bounds.
-<span class='line'>2724</span>  */</span><span class="WHIT">
-<span class='line'>2725</span> </span><span class="NAME">LinkedList.prototype.getNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2726</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2727</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2728</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2729</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2730</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2731</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2732</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2733</span> 
-<span class='line'>2734</span> </span><span class="COMM">/**
-<span class='line'>2735</span>  * Returns the item at the position index.
-<span class='line'>2736</span>  * @param index {number} The position of the item.
-<span class='line'>2737</span>  * @return {*} The item stored at the position index. It's undefined if index isn't in the list bounds.
-<span class='line'>2738</span>  */</span><span class="WHIT">
-<span class='line'>2739</span> </span><span class="NAME">LinkedList.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2740</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>2741</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2742</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2743</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2744</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2745</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2746</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2747</span> 
-<span class='line'>2748</span> </span><span class="COMM">/**
-<span class='line'>2749</span>  * Transforms the list into an array.
-<span class='line'>2750</span>  * @return {Array&lt;*>} The array built.
-<span class='line'>2751</span>  */</span><span class="WHIT">
-<span class='line'>2752</span> </span><span class="NAME">LinkedList.prototype.toArray</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2753</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">array</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2754</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.next</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2755</span> </span><span class="WHIT">		</span><span class="NAME">array</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.item</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2756</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">array</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2757</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2758</span> 
-<span class='line'>2759</span> </span><span class="COMM">/**
-<span class='line'>2760</span>  * Returns the length of the list.
-<span class='line'>2761</span>  * @return {Number} The length of the list.
-<span class='line'>2762</span>  */</span><span class="WHIT">
-<span class='line'>2763</span> </span><span class="NAME">LinkedList.prototype.getLength</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2764</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2765</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2766</span> 
-<span class='line'>2767</span> </span><span class="COMM">/**
-<span class='line'>2768</span>  * Builds the list from the array.
-<span class='line'>2769</span>  * @param array {Array&lt;*>} The array from which build the list.
-<span class='line'>2770</span>  * @return {void}
-<span class='line'>2771</span>  */</span><span class="WHIT">
-<span class='line'>2772</span> </span><span class="NAME">LinkedList.prototype.fromArray</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">array</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2773</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2774</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">Math.min</span><span
-        class="PUNC">(</span><span class="NAME">this.length</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">array.length</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2775</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">array</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2776</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.length</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">array.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2777</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">array.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2778</span> </span><span class="WHIT">			</span><span class="NAME">this.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">array</span><span class="PUNC">[</span><span class="NAME">j</span><span
-        class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2779</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>2780</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">array.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">k</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2781</span> </span><span class="WHIT">			</span><span class="NAME">this.popBack</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2782</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2783</span> 
-<span class='line'>2784</span> </span><span class="COMM">/**
-<span class='line'>2785</span>  * Returns the items that satisfy the condition determined by the callback.
-<span class='line'>2786</span>  * @param callback {function} The function that implements the condition.
-<span class='line'>2787</span>  * @return {Array&lt;*>} The array that contains the items that satisfy the condition.
-<span class='line'>2788</span>  */</span><span class="WHIT">
-<span class='line'>2789</span> </span><span class="NAME">LinkedList.prototype.filter</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2790</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2791</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2792</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2793</span> </span><span class="WHIT">			</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2794</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2795</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2796</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2797</span> 
-<span class='line'>2798</span> </span><span class="COMM">/**
-<span class='line'>2799</span>  * Checks if the list is empty.
-<span class='line'>2800</span>  * @return {boolean} True if the list is empty, false otherwise.
-<span class='line'>2801</span>  */</span><span class="WHIT">
-<span class='line'>2802</span> </span><span class="NAME">LinkedList.prototype.isEmpty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2803</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.length</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2804</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2805</span> 
-<span class='line'>2806</span> </span><span class="COMM">/**
-<span class='line'>2807</span>  * Returns the first position of the item in the list.
-<span class='line'>2808</span>  * @param item {*} The item to search.
-<span class='line'>2809</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>2810</span>  * @return {number} The first position of the item.
-<span class='line'>2811</span>  */</span><span class="WHIT">
-<span class='line'>2812</span> </span><span class="NAME">LinkedList.prototype.indexOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2813</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2814</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2815</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2816</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2817</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2818</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2819</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2820</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2821</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2822</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2823</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2824</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2825</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2826</span> 
-<span class='line'>2827</span> </span><span class="COMM">/**
-<span class='line'>2828</span>  * Returns the last position of the item in the list.
-<span class='line'>2829</span>  * @param item {*} The item to search.
-<span class='line'>2830</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>2831</span>  * @return {number} The last position of the item.
-<span class='line'>2832</span>  */</span><span class="WHIT">
-<span class='line'>2833</span> </span><span class="NAME">LinkedList.prototype.lastIndexOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2834</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2835</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2836</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2837</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2838</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2839</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2840</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2841</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2842</span> </span><span class="WHIT">			</span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2843</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2844</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2845</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2846</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">index</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2847</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2848</span> 
-<span class='line'>2849</span> </span><span class="COMM">/**
-<span class='line'>2850</span>  * Returns all the position in which the item has been found in the list.
-<span class='line'>2851</span>  * @param item {*} The item to search.
-<span class='line'>2852</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>2853</span>  * @return {Array&lt;number>} The positions in which the item has been found.
-<span class='line'>2854</span>  */</span><span class="WHIT">
-<span class='line'>2855</span> </span><span class="NAME">LinkedList.prototype.allIndexesOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2856</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2857</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2858</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2859</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2860</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2861</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2862</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2863</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2864</span> </span><span class="WHIT">			</span><span class="NAME">indexes.push</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2865</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2866</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2867</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2868</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2869</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2870</span> 
-<span class='line'>2871</span> </span><span class="COMM">/**
-<span class='line'>2872</span>  * Joins the list at the end of this list.
-<span class='line'>2873</span>  * @param list {LinkedList} The list to join.
-<span class='line'>2874</span>  * @return {void}
-<span class='line'>2875</span>  */</span><span class="WHIT">
-<span class='line'>2876</span> </span><span class="NAME">LinkedList.prototype.join</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">list</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2877</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.last</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2878</span> </span><span class="WHIT">		</span><span class="NAME">this.last.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">list.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2879</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>2880</span> </span><span class="WHIT">		</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">list.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2881</span> </span><span class="WHIT">	</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">list.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2882</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">list.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2883</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2884</span> 
-<span class='line'>2885</span> </span><span class="COMM">/**
-<span class='line'>2886</span>  * Divides the list at the index position. The node at the index position is the first new node of the list.
-<span class='line'>2887</span>  * @param index {number} The position where to divide the list.
-<span class='line'>2888</span>  * @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.
-<span class='line'>2889</span>  */</span><span class="WHIT">
-<span class='line'>2890</span> </span><span class="NAME">LinkedList.prototype.divide</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2891</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">LinkedList</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2892</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2893</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2894</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">previous</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2895</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2896</span> </span><span class="WHIT">			</span><span class="NAME">previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2897</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2898</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2899</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.first</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2900</span> </span><span class="WHIT">			</span><span class="NAME">list.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2901</span> </span><span class="WHIT">			</span><span class="NAME">list.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2902</span> </span><span class="WHIT">			</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2903</span> </span><span class="WHIT">			</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2904</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>2905</span> </span><span class="WHIT">			</span><span class="NAME">list.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2906</span> </span><span class="WHIT">			</span><span class="NAME">list.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2907</span> </span><span class="WHIT">			</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2908</span> </span><span class="WHIT">			</span><span class="NAME">previous.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2909</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2910</span> </span><span class="WHIT">		</span><span class="NAME">list.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2911</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2912</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2913</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2914</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2915</span> 
-<span class='line'>2916</span> </span><span class="COMM">/**
-<span class='line'>2917</span>  * Clones the list into a new list.
-<span class='line'>2918</span>  * @return {LinkedList} The list cloned from this list.
-<span class='line'>2919</span>  */</span><span class="WHIT">
-<span class='line'>2920</span> </span><span class="NAME">LinkedList.prototype.clone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2921</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">LinkedList</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2922</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2923</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2924</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.item.clone</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2925</span> </span><span class="WHIT">			</span><span class="NAME">list.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">node.item.clone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2926</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>2927</span> </span><span class="WHIT">			</span><span class="NAME">list.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2928</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2929</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2930</span> 
-<span class='line'>2931</span> </span><span class="COMM">/**
-<span class='line'>2932</span>  * Clones the list into a new list without cloning duplicated items.
-<span class='line'>2933</span>  * @return {LinkedList} The list cloned from this list.
-<span class='line'>2934</span>  */</span><span class="WHIT">
-<span class='line'>2935</span> </span><span class="NAME">LinkedList.prototype.cloneDistinct</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2936</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">LinkedList</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2937</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2938</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2939</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">list.contains</span><span class="PUNC">(</span><span class="NAME">node.item</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2940</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.item.cloneDistinct</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2941</span> </span><span class="WHIT">				</span><span
-        class="NAME">list.pushBack</span><span class="PUNC">(</span><span
-        class="NAME">node.item.cloneDistinct</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2942</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">node.item.clone</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2943</span> </span><span class="WHIT">				</span><span
-        class="NAME">list.pushBack</span><span class="PUNC">(</span><span class="NAME">node.item.clone</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>2944</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>2945</span> </span><span class="WHIT">				</span><span
-        class="NAME">list.pushBack</span><span class="PUNC">(</span><span class="NAME">node.item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2946</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">list</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2947</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2948</span> 
-<span class='line'>2949</span> </span><span class="COMM">/**
-<span class='line'>2950</span>  * Splits the list into lists of desired size.
-<span class='line'>2951</span>  * @param size {number} The size of the lists.
-<span class='line'>2952</span>  * @return {Array&lt;LinkedList>} The lists created by splitting the list.
-<span class='line'>2953</span>  */</span><span class="WHIT">
-<span class='line'>2954</span> </span><span class="NAME">LinkedList.prototype.split</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">size</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2955</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">length</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2956</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">lists</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="KEYW">this</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2957</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">size</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">size</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>2958</span> </span><span class="WHIT">		</span><span class="NAME">lists.push</span><span
-        class="PUNC">(</span><span class="NAME">lists</span><span class="PUNC">[</span><span
-        class="NAME">lists.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">divide</span><span class="PUNC">(</span><span class="NAME">size</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2959</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">lists</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2960</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2961</span> 
-<span class='line'>2962</span> </span><span class="COMM">/**
-<span class='line'>2963</span>  * Returns the number of items that satisfy the represented by the callback function.
-<span class='line'>2964</span>  * @param callback {function} The condition to satisfy.
-<span class='line'>2965</span>  * @return {number} The number of items that satisfy the condition.
-<span class='line'>2966</span>  */</span><span class="WHIT">
-<span class='line'>2967</span> </span><span class="NAME">LinkedList.prototype.count</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>2968</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">count</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2969</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2970</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2971</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>2972</span> </span><span class="WHIT">			</span><span class="NAME">count</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2973</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2974</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2975</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">count</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2976</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2977</span> 
-<span class='line'>2978</span> </span><span class="COMM">/**
-<span class='line'>2979</span>  * Class that implements the iterator for a linked list.
-<span class='line'>2980</span>  * @param aggregate {LinkedList} The aggregate to scan.
-<span class='line'>2981</span>  * @constructor
-<span class='line'>2982</span>  */</span><span class="WHIT">
-<span class='line'>2983</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">LinkedListIterator</span><span
-        class="PUNC">(</span><span class="NAME">aggregate</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>2984</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2985</span> 	 * The aggregate relates to this iterator.
-<span class='line'>2986</span> 	 * @type {LinkedList}
-<span class='line'>2987</span> 	 */</span><span class="WHIT">
-<span class='line'>2988</span> </span><span class="WHIT">	</span><span class="NAME">this.aggregate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">aggregate</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>2989</span> 
-<span class='line'>2990</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>2991</span> 	 * The pointer to the position.
-<span class='line'>2992</span> 	 * @type {Node|null}
-<span class='line'>2993</span> 	 */</span><span class="WHIT">
-<span class='line'>2994</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>2995</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>2996</span> 
-<span class='line'>2997</span> </span><span class="COMM">/**
-<span class='line'>2998</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'>2999</span>  * @return {void}
-<span class='line'>3000</span>  */</span><span class="WHIT">
-<span class='line'>3001</span> </span><span class="NAME">LinkedListIterator.prototype.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3002</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.first</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3003</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3004</span> 
-<span class='line'>3005</span> </span><span class="COMM">/**
-<span class='line'>3006</span>  * Moves the iterator to the next item.
-<span class='line'>3007</span>  * @return {void}
-<span class='line'>3008</span>  */</span><span class="WHIT">
-<span class='line'>3009</span> </span><span class="NAME">LinkedListIterator.prototype.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3010</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.pointer.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3011</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3012</span> 
-<span class='line'>3013</span> </span><span class="COMM">/**
-<span class='line'>3014</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'>3015</span>  * @return {void}
-<span class='line'>3016</span>  */</span><span class="WHIT">
-<span class='line'>3017</span> </span><span class="NAME">LinkedListIterator.prototype.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3018</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.last</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3019</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3020</span> 
-<span class='line'>3021</span> </span><span class="COMM">/**
-<span class='line'>3022</span>  * Moves the iterator to the previous item.
-<span class='line'>3023</span>  * @return {void}
-<span class='line'>3024</span>  */</span><span class="WHIT">
-<span class='line'>3025</span> </span><span class="NAME">LinkedListIterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3026</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3027</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">this.pointer.next</span><span
-        class="WHIT"> </span><span class="PUNC">!==</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3028</span> </span><span class="WHIT">		</span><span class="NAME">this.next</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3029</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3030</span> 
-<span class='line'>3031</span> </span><span class="COMM">/**
-<span class='line'>3032</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'>3033</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'>3034</span>  */</span><span class="WHIT">
-<span class='line'>3035</span> </span><span class="NAME">LinkedListIterator.prototype.isDone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3036</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.pointer</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3037</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3038</span> 
-<span class='line'>3039</span> </span><span class="COMM">/**
-<span class='line'>3040</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'>3041</span>  * @return {*} The item stored or undefined if it's out of the bounds.
-<span class='line'>3042</span>  */</span><span class="WHIT">
-<span class='line'>3043</span> </span><span class="NAME">LinkedListIterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3044</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3045</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3046</span> 
-<span class='line'>3047</span> </span><span class="COMM">/**
-<span class='line'>3048</span>  * Returns the node stored at the position pointed by the iterator.
-<span class='line'>3049</span>  * @abstract
-<span class='line'>3050</span>  * @return {Node|null} The node stored or null if it's out of the bounds.
-<span class='line'>3051</span>  */</span><span class="WHIT">
-<span class='line'>3052</span> </span><span class="NAME">LinkedListIterator.prototype.getNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3053</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3054</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3055</span> 
-<span class='line'>3056</span> </span><span class="COMM">/**
-<span class='line'>3057</span>  * Class for managing a priority queue.
-<span class='line'>3058</span>  * @constructor
-<span class='line'>3059</span>  */</span><span class="WHIT">
-<span class='line'>3060</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">PriorityQueue</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3061</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>3062</span> 	 * The list of the items in the queue.
-<span class='line'>3063</span> 	 * @type {RBTreeList}
-<span class='line'>3064</span> 	 */</span><span class="WHIT">
-<span class='line'>3065</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span
-        class="WHIT"> </span><span class="NAME">RBTreeList</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3066</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>3067</span> 	 * The length of the queue.
-<span class='line'>3068</span> 	 * @type {number}
-<span class='line'>3069</span> 	 */</span><span class="WHIT">
-<span class='line'>3070</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3071</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3072</span> 
-<span class='line'>3073</span> </span><span class="COMM">/**
-<span class='line'>3074</span>  * Returns the iterator relative to the aggregate.
-<span class='line'>3075</span>  * @return {Iterator} The iterator.
-<span class='line'>3076</span>  */</span><span class="WHIT">
-<span class='line'>3077</span> </span><span class="NAME">PriorityQueue.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3078</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span class="NAME">PriorityQueueIterator</span><span
-        class="PUNC">(</span><span class="KEYW">this</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3079</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3080</span> 
-<span class='line'>3081</span> </span><span class="COMM">/**
-<span class='line'>3082</span>  * Adds the item at the tail of the queue.
-<span class='line'>3083</span>  * @param priority {number} The priority of the item.
-<span class='line'>3084</span>  * @param item {*} The item to add.
-<span class='line'>3085</span>  * @return {void}
-<span class='line'>3086</span>  */</span><span class="WHIT">
-<span class='line'>3087</span> </span><span class="NAME">PriorityQueue.prototype.enqueue</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">priority</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3088</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.search</span><span class="PUNC">(</span><span class="NAME">priority</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3089</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">queue</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3090</span> </span><span class="WHIT">		</span><span class="NAME">queue</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span
-        class="WHIT"> </span><span class="NAME">Queue</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3091</span> </span><span class="WHIT">		</span><span class="NAME">this.items.insert</span><span
-        class="PUNC">(</span><span class="NAME">priority</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3092</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3093</span> </span><span class="WHIT">	</span><span class="NAME">queue.enqueue</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3094</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3095</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3096</span> 
-<span class='line'>3097</span> </span><span class="COMM">/**
-<span class='line'>3098</span>  * Adds the items with the same priority at the tail of the queue.
-<span class='line'>3099</span>  * @param priority {number} The priority of the items.
-<span class='line'>3100</span>  * @param items {Array&lt;*>} The items to add.
-<span class='line'>3101</span>  * @return {void}
-<span class='line'>3102</span>  */</span><span class="WHIT">
-<span class='line'>3103</span> </span><span class="NAME">PriorityQueue.prototype.multiEnqueue</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">priority</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">items</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3104</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">items.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3105</span> </span><span class="WHIT">		</span><span class="NAME">this.enqueue</span><span
-        class="PUNC">(</span><span class="NAME">priority</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">items</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3106</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3107</span> 
-<span class='line'>3108</span> </span><span class="COMM">/**
-<span class='line'>3109</span>  * Removes the item at the head of the queue.
-<span class='line'>3110</span>  * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
-<span class='line'>3111</span>  */</span><span class="WHIT">
-<span class='line'>3112</span> </span><span class="NAME">PriorityQueue.prototype.dequeue</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3113</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.maximum</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3114</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3115</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3116</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3117</span> </span><span class="WHIT">		</span><span class="NAME">item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">queue.dequeue</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3118</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">queue.isEmpty</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3119</span> </span><span class="WHIT">			</span><span
-        class="NAME">this.items.deleteNode</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3120</span> </span><span class="WHIT">		</span><span class="NAME">this.length</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3121</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3122</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3123</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3124</span> 
-<span class='line'>3125</span> </span><span class="COMM">/**
-<span class='line'>3126</span>  * Removes the items at the head of the queue.
-<span class='line'>3127</span>  * @param times {number} The number of times to repeat the dequeue method.
-<span class='line'>3128</span>  * @return {Array&lt;*>} The items at the head of the queue.
-<span class='line'>3129</span>  */</span><span class="WHIT">
-<span class='line'>3130</span> </span><span class="NAME">PriorityQueue.prototype.multiDequeue</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">times</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3131</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">items</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3132</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">times</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3133</span> </span><span class="WHIT">		</span><span class="NAME">items.push</span><span
-        class="PUNC">(</span><span class="NAME">this.dequeue</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3134</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">items</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3135</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3136</span> 
-<span class='line'>3137</span> </span><span class="COMM">/**
-<span class='line'>3138</span>  * Removes the first length items from the position index.
-<span class='line'>3139</span>  * @param index {number} The position where to start to remove the items.
-<span class='line'>3140</span>  * @param [length = 1] {number} The number of items to remove.
-<span class='line'>3141</span>  * @return {void}
-<span class='line'>3142</span>  */</span><span class="WHIT">
-<span class='line'>3143</span> </span><span class="NAME">PriorityQueue.prototype.remove</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">length</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3144</span> </span><span class="WHIT">	</span><span class="NAME">length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">length</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3145</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3146</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.last</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">length</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">it.previous</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3147</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3148</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">queue.getLength</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3149</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">oldLength</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">queue.getLength</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3150</span> </span><span class="WHIT">			</span><span class="NAME">queue.remove</span><span
-        class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">length</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3151</span> </span><span class="WHIT">			</span><span class="NAME">length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">oldLength</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NAME">index</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3152</span> </span><span class="WHIT">			</span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3153</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">queue.getLength</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3154</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.items.deleteNode</span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3155</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>3156</span> </span><span class="WHIT">			</span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NAME">queue.getLength</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3157</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3158</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3159</span> 
-<span class='line'>3160</span> </span><span class="COMM">/**
-<span class='line'>3161</span>  * Returns the item at the position index.
-<span class='line'>3162</span>  * @param index {number} The index of the item.
-<span class='line'>3163</span>  * @return {*} The item found. It's undefined if the position index is out of bounds.
-<span class='line'>3164</span>  */</span><span class="WHIT">
-<span class='line'>3165</span> </span><span class="NAME">PriorityQueue.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3166</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3167</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.last</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">it.previous</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3168</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3169</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">queue.getLength</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3170</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">queue.getItem</span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3171</span> </span><span class="WHIT">		</span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">index</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NAME">queue.getLength</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3172</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3173</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3174</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3175</span> 
-<span class='line'>3176</span> </span><span class="COMM">/**
-<span class='line'>3177</span>  * Returns the items relatives to the priority.
-<span class='line'>3178</span>  * @param priority {number} The priority of the items.
-<span class='line'>3179</span>  * @return {Array&lt;*>} The items found.
-<span class='line'>3180</span>  */</span><span class="WHIT">
-<span class='line'>3181</span> </span><span class="NAME">PriorityQueue.prototype.getItems</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">priority</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3182</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">items</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.search</span><span class="PUNC">(</span><span class="NAME">priority</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3183</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">items</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>3184</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">items.items</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3185</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3186</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3187</span> 
-<span class='line'>3188</span> </span><span class="COMM">/**
-<span class='line'>3189</span>  * Returns the first item in the queue. The item is not removed.
-<span class='line'>3190</span>  * @return {*} The first item. It's undefined if the queue is empty.
-<span class='line'>3191</span>  */</span><span class="WHIT">
-<span class='line'>3192</span> </span><span class="NAME">PriorityQueue.prototype.peek</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3193</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items.maximum</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item.peek</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3194</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3195</span> 
-<span class='line'>3196</span> </span><span class="COMM">/**
-<span class='line'>3197</span>  * Returns the length of the queue.
-<span class='line'>3198</span>  * @return {number} The length of the queue.
-<span class='line'>3199</span>  */</span><span class="WHIT">
-<span class='line'>3200</span> </span><span class="NAME">PriorityQueue.prototype.getLength</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3201</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3202</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3203</span> 
-<span class='line'>3204</span> </span><span class="COMM">/**
-<span class='line'>3205</span>  * Checks if the queue is empty.
-<span class='line'>3206</span>  * @return {boolean} True if the queue is empty, false otherwise.
-<span class='line'>3207</span>  */</span><span class="WHIT">
-<span class='line'>3208</span> </span><span class="NAME">PriorityQueue.prototype.isEmpty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3209</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.length</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3210</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3211</span> 
-<span class='line'>3212</span> </span><span class="COMM">/**
-<span class='line'>3213</span>  * Removes all the items stored in the queue.
-<span class='line'>3214</span>  * @return {void}
-<span class='line'>3215</span>  */</span><span class="WHIT">
-<span class='line'>3216</span> </span><span class="NAME">PriorityQueue.prototype.clear</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3217</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span
-        class="WHIT"> </span><span class="NAME">RBTreeList</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3218</span> </span><span class="WHIT">	</span><span class="NAME">this.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3219</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3220</span> 
-<span class='line'>3221</span> </span><span class="COMM">/**
-<span class='line'>3222</span>  * Checks if the queue contains a priority that satisfy the condition represented by the callback function.
-<span class='line'>3223</span>  * @param priority {number} The priority to find.
-<span class='line'>3224</span>  * @param [callback = function(p){return(p===priority);}] The condition to satisfy. The callback must accept the current priority to check.
-<span class='line'>3225</span>  * @return {boolean} True if the queue contains the priority that satisfy the condition, false otherwise.
-<span class='line'>3226</span>  */</span><span class="WHIT">
-<span class='line'>3227</span> </span><span class="NAME">PriorityQueue.prototype.containsPriority</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">priority</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3228</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3229</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items.fullContains</span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3230</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>3231</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items.contains</span><span class="PUNC">(</span><span class="NAME">priority</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3232</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3233</span> 
-<span class='line'>3234</span> </span><span class="COMM">/**
-<span class='line'>3235</span>  * Returns the queue created by the priority queue with the items in the same order but without the priority.
-<span class='line'>3236</span>  * @return {Queue} The queue created.
-<span class='line'>3237</span>  */</span><span class="WHIT">
-<span class='line'>3238</span> </span><span class="NAME">PriorityQueue.prototype.toQueue</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3239</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">Queue</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3240</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3241</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.last</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">it.previous</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3242</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3243</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">itQ</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">item.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3244</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">itQ.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">itQ.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">itQ.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3245</span> </span><span class="WHIT">			</span><span class="NAME">queue.enqueue</span><span
-        class="PUNC">(</span><span class="NAME">itQ.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3246</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3247</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3248</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3249</span> 
-<span class='line'>3250</span> </span><span class="COMM">/**
-<span class='line'>3251</span>  * Executes the callback function for each item of the queue.
-<span class='line'>3252</span>  * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
-<span class='line'>3253</span>  * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
-<span class='line'>3254</span>  * @return {void}
-<span class='line'>3255</span>  */</span><span class="WHIT">
-<span class='line'>3256</span> </span><span class="NAME">PriorityQueue.prototype.execute</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3257</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3258</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.last</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">it.previous</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3259</span> </span><span class="WHIT">		</span><span class="NAME">it.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">execute</span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3260</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3261</span> 
-<span class='line'>3262</span> </span><span class="COMM">/**
-<span class='line'>3263</span>  * Changes the priority of the item at the position index.
-<span class='line'>3264</span>  * @param index {number} The position of the item of which increase the priority.
-<span class='line'>3265</span>  * @param newPriority {number} The new priority.
-<span class='line'>3266</span>  * @return {void}
-<span class='line'>3267</span>  */</span><span class="WHIT">
-<span class='line'>3268</span> </span><span class="NAME">PriorityQueue.prototype.changePriority</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">newPriority</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3269</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getItem</span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3270</span> </span><span class="WHIT">	</span><span class="NAME">this.remove</span><span
-        class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3271</span> </span><span class="WHIT">	</span><span class="NAME">this.enqueue</span><span
-        class="PUNC">(</span><span class="NAME">newPriority</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3272</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3273</span> 
-<span class='line'>3274</span> </span><span class="COMM">/**
-<span class='line'>3275</span>  * Returns the items that satisfy the condition determined by the callback.
-<span class='line'>3276</span>  * @param callback {function} The function that implements the condition.
-<span class='line'>3277</span>  * @return {Array&lt;*>} The array that contains the items that satisfy the condition.
-<span class='line'>3278</span>  */</span><span class="WHIT">
-<span class='line'>3279</span> </span><span class="NAME">PriorityQueue.prototype.filter</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3280</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3281</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3282</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.last</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">it.previous</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3283</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">itQ</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">it.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3284</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">itQ.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">itQ.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">itQ.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3285</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">itQ.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3286</span> </span><span class="WHIT">				</span><span
-        class="NAME">result.push</span><span class="PUNC">(</span><span class="NAME">itQ.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3287</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3288</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3289</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3290</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3291</span> 
-<span class='line'>3292</span> </span><span class="COMM">/**
-<span class='line'>3293</span>  * Clones the queue into a new queue.
-<span class='line'>3294</span>  * @return {PriorityQueue} The queue cloned from this queue.
-<span class='line'>3295</span>  */</span><span class="WHIT">
-<span class='line'>3296</span> </span><span class="NAME">PriorityQueue.prototype.clone</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3297</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">PriorityQueue</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3298</span> </span><span class="WHIT">	</span><span class="NAME">queue.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.items.clone</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3299</span> </span><span class="WHIT">	</span><span class="NAME">queue.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.length</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3300</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3301</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3302</span> 
-<span class='line'>3303</span> </span><span class="COMM">/**
-<span class='line'>3304</span>  * Clones the queue into a new queue without cloning duplicated items.
-<span class='line'>3305</span>  * @return {PriorityQueue} The queue cloned from this queue.
-<span class='line'>3306</span>  */</span><span class="WHIT">
-<span class='line'>3307</span> </span><span class="NAME">PriorityQueue.prototype.cloneDistinct</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3308</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">PriorityQueue</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3309</span> </span><span class="WHIT">	</span><span class="NAME">queue.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.items.cloneDistinct</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3310</span> </span><span class="WHIT">	</span><span class="NAME">queue.length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">queue.items.getSize</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3311</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3312</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3313</span> 
-<span class='line'>3314</span> </span><span class="COMM">/**
-<span class='line'>3315</span>  * Class that implements the iterator for a priority queue.
-<span class='line'>3316</span>  * @param aggregate {PriorityQueue} The aggregate to scan.
-<span class='line'>3317</span>  * @constructor
-<span class='line'>3318</span>  */</span><span class="WHIT">
-<span class='line'>3319</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">PriorityQueueIterator</span><span
-        class="PUNC">(</span><span class="NAME">aggregate</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3320</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>3321</span> 	 * The aggregate relates to this iterator.
-<span class='line'>3322</span> 	 * @type {PriorityQueue}
-<span class='line'>3323</span> 	 */</span><span class="WHIT">
-<span class='line'>3324</span> </span><span class="WHIT">	</span><span class="NAME">this.aggregate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">aggregate</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3325</span> 
-<span class='line'>3326</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>3327</span> 	 * The pointer to the position of the node.
-<span class='line'>3328</span> 	 * @type {RBLNode|null}
-<span class='line'>3329</span> 	 */</span><span class="WHIT">
-<span class='line'>3330</span> </span><span class="WHIT">	</span><span class="NAME">this.pointerNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3331</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>3332</span> 	 * The pointer to the position in the node.
-<span class='line'>3333</span> 	 * @type {number}
-<span class='line'>3334</span> 	 */</span><span class="WHIT">
-<span class='line'>3335</span> </span><span class="WHIT">	</span><span class="NAME">this.pointerPosition</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3336</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3337</span> 
-<span class='line'>3338</span> </span><span class="COMM">/**
-<span class='line'>3339</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'>3340</span>  * @return {void}
-<span class='line'>3341</span>  */</span><span class="WHIT">
-<span class='line'>3342</span> </span><span class="NAME">PriorityQueueIterator.prototype.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3343</span> </span><span class="WHIT">	</span><span class="NAME">this.pointerNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.items.maximum</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3344</span> </span><span class="WHIT">	</span><span class="NAME">this.pointerPosition</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3345</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3346</span> 
-<span class='line'>3347</span> </span><span class="COMM">/**
-<span class='line'>3348</span>  * Moves the iterator to the next item.
-<span class='line'>3349</span>  * @return {void}
-<span class='line'>3350</span>  */</span><span class="WHIT">
-<span class='line'>3351</span> </span><span class="NAME">PriorityQueueIterator.prototype.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3352</span> </span><span class="WHIT">	</span><span class="NAME">this.pointerPosition</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3353</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.pointerPosition</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.pointerNode.item.getLength</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3354</span> </span><span class="WHIT">		</span><span class="NAME">this.pointerNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.pointerNode.previous</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3355</span> </span><span class="WHIT">		</span><span
-        class="NAME">this.pointerPosition</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3356</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3357</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3358</span> 
-<span class='line'>3359</span> </span><span class="COMM">/**
-<span class='line'>3360</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'>3361</span>  * @return {void}
-<span class='line'>3362</span>  */</span><span class="WHIT">
-<span class='line'>3363</span> </span><span class="NAME">PriorityQueueIterator.prototype.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3364</span> </span><span class="WHIT">	</span><span class="NAME">this.pointerNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.items.minimum</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3365</span> </span><span class="WHIT">	</span><span class="NAME">this.pointerPosition</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.pointerNode.item.getLength</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3366</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3367</span> 
-<span class='line'>3368</span> </span><span class="COMM">/**
-<span class='line'>3369</span>  * Moves the iterator to the previous item.
-<span class='line'>3370</span>  * @return {void}
-<span class='line'>3371</span>  */</span><span class="WHIT">
-<span class='line'>3372</span> </span><span class="NAME">PriorityQueueIterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3373</span> </span><span class="WHIT">	</span><span class="NAME">this.pointerPosition</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3374</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.pointerPosition</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3375</span> </span><span class="WHIT">		</span><span class="NAME">this.pointerNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.pointerNode.next</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3376</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.pointerNode</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3377</span> </span><span class="WHIT">			</span><span
-        class="NAME">this.pointerPosition</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.pointerNode.item.getLength</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3378</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3379</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3380</span> 
-<span class='line'>3381</span> </span><span class="COMM">/**
-<span class='line'>3382</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'>3383</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'>3384</span>  */</span><span class="WHIT">
-<span class='line'>3385</span> </span><span class="NAME">PriorityQueueIterator.prototype.isDone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3386</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.pointerNode</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3387</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3388</span> 
-<span class='line'>3389</span> </span><span class="COMM">/**
-<span class='line'>3390</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'>3391</span>  * @return {*} The item stored or undefined if it's out of the bounds.
-<span class='line'>3392</span>  */</span><span class="WHIT">
-<span class='line'>3393</span> </span><span class="NAME">PriorityQueueIterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3394</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointerNode.item.items</span><span class="PUNC">[</span><span
-        class="NAME">this.pointerPosition</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3395</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3396</span> 
-<span class='line'>3397</span> </span><span class="COMM">/**
-<span class='line'>3398</span>  * Class for managing a queue.
-<span class='line'>3399</span>  * @param {...*} [args] The items for initializing the queue.
-<span class='line'>3400</span>  * @constructor
-<span class='line'>3401</span>  */</span><span class="WHIT">
-<span class='line'>3402</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">Queue</span><span
-        class="PUNC">(</span><span class="NAME">args</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3403</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>3404</span> 	 * The list of the items in the queue.
-<span class='line'>3405</span> 	 * @type {Array&lt;*>}
-<span class='line'>3406</span> 	 */</span><span class="WHIT">
-<span class='line'>3407</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3408</span> 
-<span class='line'>3409</span> </span><span class="WHIT">	</span><span class="COMM">//builds the queue from the parameters of the constructor</span><span
-        class="WHIT">
-<span class='line'>3410</span> </span><span class="WHIT">	</span><span class="NAME">this.multiEnqueue</span><span
-        class="PUNC">(</span><span class="NAME">arguments</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3411</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3412</span> 
-<span class='line'>3413</span> </span><span class="COMM">/**
-<span class='line'>3414</span>  * Returns the iterator relative to the aggregate.
-<span class='line'>3415</span>  * @return {Iterator} The iterator.
-<span class='line'>3416</span>  */</span><span class="WHIT">
-<span class='line'>3417</span> </span><span class="NAME">Queue.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3418</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">QueueIterator</span><span class="PUNC">(</span><span class="KEYW">this</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3419</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3420</span> 
-<span class='line'>3421</span> </span><span class="COMM">/**
-<span class='line'>3422</span>  * Adds the item at the tail of the queue.
-<span class='line'>3423</span>  * @param item {*} The item to add.
-<span class='line'>3424</span>  * @return {void}
-<span class='line'>3425</span>  */</span><span class="WHIT">
-<span class='line'>3426</span> </span><span class="NAME">Queue.prototype.enqueue</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3427</span> </span><span class="WHIT">	</span><span class="NAME">this.items.push</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3428</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3429</span> 
-<span class='line'>3430</span> </span><span class="COMM">/**
-<span class='line'>3431</span>  * Adds the items at the tail of the queue.
-<span class='line'>3432</span>  * @param items {Array&lt;*>} The items to add.
-<span class='line'>3433</span>  * @return {void}
-<span class='line'>3434</span>  */</span><span class="WHIT">
-<span class='line'>3435</span> </span><span class="NAME">Queue.prototype.multiEnqueue</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">items</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3436</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">items.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3437</span> </span><span class="WHIT">		</span><span class="NAME">this.items.push</span><span
-        class="PUNC">(</span><span class="NAME">items</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3438</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3439</span> 
-<span class='line'>3440</span> </span><span class="COMM">/**
-<span class='line'>3441</span>  * Removes the item at the head of the queue.
-<span class='line'>3442</span>  * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
-<span class='line'>3443</span>  */</span><span class="WHIT">
-<span class='line'>3444</span> </span><span class="NAME">Queue.prototype.dequeue</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3445</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">this.items.length</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3446</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3447</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items.splice</span><span class="PUNC">(</span><span
-        class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="PUNC">[</span><span class="NUMB">0</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span
-        class="COMM">//remove the first item and return it</span><span class="WHIT">
-<span class='line'>3448</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3449</span> 
-<span class='line'>3450</span> </span><span class="COMM">/**
-<span class='line'>3451</span>  * Removes the items at the head of the queue.
-<span class='line'>3452</span>  * @param times {number} The number of times to repeat the dequeue method.
-<span class='line'>3453</span>  * @return {Array&lt;*>} The items at the head of the queue.
-<span class='line'>3454</span>  */</span><span class="WHIT">
-<span class='line'>3455</span> </span><span class="NAME">Queue.prototype.multiDequeue</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">times</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3456</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items.splice</span><span class="PUNC">(</span><span
-        class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">times</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="COMM">//removes the last times item and returns the array</span><span
-        class="WHIT">
-<span class='line'>3457</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3458</span> 
-<span class='line'>3459</span> </span><span class="COMM">/**
-<span class='line'>3460</span>  * Removes the first length items from the position index.
-<span class='line'>3461</span>  * @param index {number} The position where to start to remove the items.
-<span class='line'>3462</span>  * @param [length = 1] {number} The number of items to remove.
-<span class='line'>3463</span>  * @return {void}
-<span class='line'>3464</span>  */</span><span class="WHIT">
-<span class='line'>3465</span> </span><span class="NAME">Queue.prototype.remove</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">length</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3466</span> </span><span class="WHIT">	</span><span class="NAME">length</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">length</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3467</span> </span><span class="WHIT">	</span><span class="NAME">this.items.splice</span><span
-        class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">length</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3468</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3469</span> 
-<span class='line'>3470</span> </span><span class="COMM">/**
-<span class='line'>3471</span>  * Returns the item at the position index.
-<span class='line'>3472</span>  * @param index {number} The position of the item.
-<span class='line'>3473</span>  * @return {*} The item at the position. It's undefined if index isn't in the queue bounds.
-<span class='line'>3474</span>  */</span><span class="WHIT">
-<span class='line'>3475</span> </span><span class="NAME">Queue.prototype.getItem</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3476</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3477</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3478</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">index</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3479</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3480</span> 
-<span class='line'>3481</span> </span><span class="COMM">/**
-<span class='line'>3482</span>  * Returns the first item in the queue. The item is not removed.
-<span class='line'>3483</span>  * @return {*} The first item. It's undefined if the queue is empty.
-<span class='line'>3484</span>  */</span><span class="WHIT">
-<span class='line'>3485</span> </span><span class="NAME">Queue.prototype.peek</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3486</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.items.length</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3487</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NUMB">0</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3488</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="WHIT">
-<span class='line'>3489</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3490</span> 
-<span class='line'>3491</span> </span><span class="COMM">/**
-<span class='line'>3492</span>  * Removes all the items stored in the queue.
-<span class='line'>3493</span>  * @return {void}
-<span class='line'>3494</span>  */</span><span class="WHIT">
-<span class='line'>3495</span> </span><span class="NAME">Queue.prototype.clear</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3496</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3497</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3498</span> 
-<span class='line'>3499</span> </span><span class="COMM">/**
-<span class='line'>3500</span>  * Checks if the queue contains an item that satisfy the condition represented by the callback function.
-<span class='line'>3501</span>  * @param item {*} The item to find.
-<span class='line'>3502</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>3503</span>  * @return {boolean} True if the queue contains the item that satisfy the condition, false otherwise.
-<span class='line'>3504</span>  */</span><span class="WHIT">
-<span class='line'>3505</span> </span><span class="NAME">Queue.prototype.contains</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3506</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3507</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3508</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3509</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3510</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">!</span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3511</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3512</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span
-        class="WHIT"> </span><span class="NAME">this.items.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3513</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3514</span> 
-<span class='line'>3515</span> </span><span class="COMM">/**
-<span class='line'>3516</span>  * Executes the callback function for each item of the queue.
-<span class='line'>3517</span>  * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
-<span class='line'>3518</span>  * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
-<span class='line'>3519</span>  * @return {void}
-<span class='line'>3520</span>  */</span><span class="WHIT">
-<span class='line'>3521</span> </span><span class="NAME">Queue.prototype.execute</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3522</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3523</span> </span><span class="WHIT">		</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3524</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3525</span> 
-<span class='line'>3526</span> </span><span class="COMM">/**
-<span class='line'>3527</span>  * Returns the length of the queue.
-<span class='line'>3528</span>  * @return {number} The length of the queue.
-<span class='line'>3529</span>  */</span><span class="WHIT">
-<span class='line'>3530</span> </span><span class="NAME">Queue.prototype.getLength</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3531</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3532</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3533</span> 
-<span class='line'>3534</span> </span><span class="COMM">/**
-<span class='line'>3535</span>  * Checks if the queue is empty.
-<span class='line'>3536</span>  * @return {boolean} True if the queue is empty, false otherwise.
-<span class='line'>3537</span>  */</span><span class="WHIT">
-<span class='line'>3538</span> </span><span class="NAME">Queue.prototype.isEmpty</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3539</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.items.length</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3540</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3541</span> 
-<span class='line'>3542</span> </span><span class="COMM">/**
-<span class='line'>3543</span>  * Returns the items that satisfy the condition determined by the callback.
-<span class='line'>3544</span>  * @param callback {function} The function that implements the condition.
-<span class='line'>3545</span>  * @return {Array&lt;*>} The array that contains the items that satisfy the condition.
-<span class='line'>3546</span>  */</span><span class="WHIT">
-<span class='line'>3547</span> </span><span class="NAME">Queue.prototype.filter</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3548</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3549</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3550</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>3551</span> </span><span class="WHIT">			</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3552</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3553</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3554</span> 
-<span class='line'>3555</span> </span><span class="COMM">/**
-<span class='line'>3556</span>  * Returns the first position of the item in the queue.
-<span class='line'>3557</span>  * @param item {*} The item to search.
-<span class='line'>3558</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>3559</span>  * @return {number} The first position of the item.
-<span class='line'>3560</span>  */</span><span class="WHIT">
-<span class='line'>3561</span> </span><span class="NAME">Queue.prototype.indexOf</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3562</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3563</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3564</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3565</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3566</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3567</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>3568</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3569</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3570</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3571</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3572</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3573</span> 
-<span class='line'>3574</span> </span><span class="COMM">/**
-<span class='line'>3575</span>  * Returns the last position of the item in the queue.
-<span class='line'>3576</span>  * @param item {*} The item to search.
-<span class='line'>3577</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>3578</span>  * @return {number} The last position of the item.
-<span class='line'>3579</span>  */</span><span class="WHIT">
-<span class='line'>3580</span> </span><span class="NAME">Queue.prototype.lastIndexOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3581</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3582</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3583</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3584</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3585</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3586</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>3587</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3588</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3589</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3590</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3591</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3592</span> 
-<span class='line'>3593</span> </span><span class="COMM">/**
-<span class='line'>3594</span>  * Returns all the position in which the item has been found in the queue.
-<span class='line'>3595</span>  * @param item {*} The item to search.
-<span class='line'>3596</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>3597</span>  * @return {Array&lt;number>} The positions in which the item has been found.
-<span class='line'>3598</span>  */</span><span class="WHIT">
-<span class='line'>3599</span> </span><span class="NAME">Queue.prototype.allIndexesOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3600</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3601</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3602</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3603</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3604</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3605</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3606</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>3607</span> </span><span class="WHIT">			</span><span class="NAME">indexes.push</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3608</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3609</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3610</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3611</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3612</span> 
-<span class='line'>3613</span> </span><span class="COMM">/**
-<span class='line'>3614</span>  * Clones the queue into a new queue.
-<span class='line'>3615</span>  * @return {Queue} The queue cloned from this queue.
-<span class='line'>3616</span>  */</span><span class="WHIT">
-<span class='line'>3617</span> </span><span class="NAME">Queue.prototype.clone</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3618</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">Queue</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3619</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3620</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">clone</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3621</span> </span><span class="WHIT">			</span><span class="NAME">queue.enqueue</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">clone</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3622</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>3623</span> </span><span class="WHIT">			</span><span class="NAME">queue.enqueue</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3624</span> 
-<span class='line'>3625</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3626</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3627</span> 
-<span class='line'>3628</span> </span><span class="COMM">/**
-<span class='line'>3629</span>  * Clones the queue into a new queue without cloning duplicated items.
-<span class='line'>3630</span>  * @return {Queue} The queue cloned from this queue.
-<span class='line'>3631</span>  */</span><span class="WHIT">
-<span class='line'>3632</span> </span><span class="NAME">Queue.prototype.cloneDistinct</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3633</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">Queue</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3634</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3635</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">queue.contains</span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3636</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">cloneDistinct</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3637</span> </span><span class="WHIT">				</span><span
-        class="NAME">queue.enqueue</span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">cloneDistinct</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3638</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">this.items</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">clone</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>3639</span> </span><span class="WHIT">				</span><span
-        class="NAME">queue.enqueue</span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">clone</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3640</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>3641</span> </span><span class="WHIT">				</span><span
-        class="NAME">queue.enqueue</span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3642</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">queue</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3643</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3644</span> 
-<span class='line'>3645</span> </span><span class="COMM">/**
-<span class='line'>3646</span>  * Class that implements the iterator for a linked list.
-<span class='line'>3647</span>  * @param aggregate {Queue} The aggregate to scan.
-<span class='line'>3648</span>  * @constructor
-<span class='line'>3649</span>  */</span><span class="WHIT">
-<span class='line'>3650</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">QueueIterator</span><span
-        class="PUNC">(</span><span class="NAME">aggregate</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3651</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>3652</span> 	 * The aggregate relates to this iterator.
-<span class='line'>3653</span> 	 * @type {Queue}
-<span class='line'>3654</span> 	 */</span><span class="WHIT">
-<span class='line'>3655</span> </span><span class="WHIT">	</span><span class="NAME">this.aggregate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">aggregate</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3656</span> 
-<span class='line'>3657</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>3658</span> 	 * The pointer to the position.
-<span class='line'>3659</span> 	 * @type {number}
-<span class='line'>3660</span> 	 */</span><span class="WHIT">
-<span class='line'>3661</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3662</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3663</span> 
-<span class='line'>3664</span> </span><span class="COMM">/**
-<span class='line'>3665</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'>3666</span>  * @return {void}
-<span class='line'>3667</span>  */</span><span class="WHIT">
-<span class='line'>3668</span> </span><span class="NAME">QueueIterator.prototype.first</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3669</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3670</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3671</span> 
-<span class='line'>3672</span> </span><span class="COMM">/**
-<span class='line'>3673</span>  * Moves the iterator to the next item.
-<span class='line'>3674</span>  * @return {void}
-<span class='line'>3675</span>  */</span><span class="WHIT">
-<span class='line'>3676</span> </span><span class="NAME">QueueIterator.prototype.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3677</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3678</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3679</span> 
-<span class='line'>3680</span> </span><span class="COMM">/**
-<span class='line'>3681</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'>3682</span>  * @return {void}
-<span class='line'>3683</span>  */</span><span class="WHIT">
-<span class='line'>3684</span> </span><span class="NAME">QueueIterator.prototype.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3685</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.items.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3686</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3687</span> 
-<span class='line'>3688</span> </span><span class="COMM">/**
-<span class='line'>3689</span>  * Moves the iterator to the previous item.
-<span class='line'>3690</span>  * @return {void}
-<span class='line'>3691</span>  */</span><span class="WHIT">
-<span class='line'>3692</span> </span><span class="NAME">QueueIterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3693</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3694</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3695</span> 
-<span class='line'>3696</span> </span><span class="COMM">/**
-<span class='line'>3697</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'>3698</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'>3699</span>  */</span><span class="WHIT">
-<span class='line'>3700</span> </span><span class="NAME">QueueIterator.prototype.isDone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3701</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.aggregate.items.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3702</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3703</span> 
-<span class='line'>3704</span> </span><span class="COMM">/**
-<span class='line'>3705</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'>3706</span>  * @return {*} The item stored or undefined if it's out of the bounds.
-<span class='line'>3707</span>  */</span><span class="WHIT">
-<span class='line'>3708</span> </span><span class="NAME">QueueIterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3709</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.aggregate.getItem</span><span class="PUNC">(</span><span
-        class="NAME">this.pointer</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3710</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3711</span> 
-<span class='line'>3712</span> </span><span class="COMM">/**
-<span class='line'>3713</span>  * Class for managing a red-black tree.
-<span class='line'>3714</span>  * @constructor
-<span class='line'>3715</span>  */</span><span class="WHIT">
-<span class='line'>3716</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">RBTree</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3717</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>3718</span> 	 * The root of the tree.
-<span class='line'>3719</span> 	 * @type {RBNode|null}
-<span class='line'>3720</span> 	 */</span><span class="WHIT">
-<span class='line'>3721</span> </span><span class="WHIT">	</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3722</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>3723</span> 	 * The number of items stored in the tree.
-<span class='line'>3724</span> 	 * @type {number}
-<span class='line'>3725</span> 	 */</span><span class="WHIT">
-<span class='line'>3726</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3727</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3728</span> 
-<span class='line'>3729</span> </span><span class="COMM">/**
-<span class='line'>3730</span>  * Returns the iterator relative to the aggregate.
-<span class='line'>3731</span>  * @return {Iterator} The iterator.
-<span class='line'>3732</span>  */</span><span class="WHIT">
-<span class='line'>3733</span> </span><span class="NAME">RBTree.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3734</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">RBTreeIterator</span><span class="PUNC">(</span><span class="KEYW">this</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3735</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3736</span> 
-<span class='line'>3737</span> </span><span class="COMM">/**
-<span class='line'>3738</span>  * Inserts the item relatives to the key value in the tree.
-<span class='line'>3739</span>  * @param key {number} The key to store.
-<span class='line'>3740</span>  * @param item {*} The item to store.
-<span class='line'>3741</span>  * @return {void}
-<span class='line'>3742</span>  */</span><span class="WHIT">
-<span class='line'>3743</span> </span><span class="NAME">RBTree.prototype.insert</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3744</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">RBNode</span><span class="PUNC">(</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3745</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3746</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">this.root</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3747</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3748</span> </span><span class="WHIT">		</span><span class="NAME">node.type</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3749</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3750</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3751</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">p</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3752</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">n</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">n</span><span class="PUNC">;</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3753</span> </span><span class="WHIT">		</span><span class="NAME">p</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">n</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3754</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">n.key</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3755</span> </span><span class="WHIT">			</span><span class="NAME">n</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">n.left</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3756</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>3757</span> </span><span class="WHIT">			</span><span class="NAME">n</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">n.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3758</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3759</span> </span><span class="WHIT">	</span><span class="NAME">node.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">p</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3760</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">p</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3761</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3762</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">p.key</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3763</span> </span><span class="WHIT">		</span><span class="NAME">p.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3764</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>3765</span> </span><span class="WHIT">		</span><span class="NAME">p.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3766</span> 
-<span class='line'>3767</span> </span><span class="WHIT">	</span><span class="NAME">this.insertFixUp</span><span
-        class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3768</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3769</span> 
-<span class='line'>3770</span> </span><span class="COMM">/**
-<span class='line'>3771</span>  * Preserves the properties of the tree after an insert.
-<span class='line'>3772</span>  * @param node {RBNode} The node to insert.
-<span class='line'>3773</span>  * @return {void}
-<span class='line'>3774</span>  */</span><span class="WHIT">
-<span class='line'>3775</span> </span><span class="NAME">RBTree.prototype.insertFixUp</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3776</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.parent</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">&&</span><span
-        class="WHIT"> </span><span class="NAME">parent.type</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.parent</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3777</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">parent</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.parent.left</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3778</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">uncle</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.parent.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3779</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">uncle</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">uncle.type</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3780</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3781</span> </span><span class="WHIT">				</span><span
-        class="NAME">uncle.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3782</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3783</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3784</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.right</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3785</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3786</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.leftRotate</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3787</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3788</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3789</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3790</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.rightRotate</span><span class="PUNC">(</span><span class="NAME">parent.parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3791</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>3792</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3793</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">uncle</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.parent.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3794</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">uncle</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">uncle.type</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3795</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3796</span> </span><span class="WHIT">				</span><span
-        class="NAME">uncle.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3797</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3798</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3799</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3800</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3801</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.rightRotate</span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3802</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3803</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3804</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3805</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.leftRotate</span><span class="PUNC">(</span><span class="NAME">parent.parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3806</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>3807</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3808</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3809</span> </span><span class="WHIT">	</span><span class="NAME">this.root.type</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3810</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3811</span> 
-<span class='line'>3812</span> </span><span class="COMM">/**
-<span class='line'>3813</span>  * Deletes the node from the tree.
-<span class='line'>3814</span>  * @param node {RBNode} The node to delete.
-<span class='line'>3815</span>  * @return {void}
-<span class='line'>3816</span>  */</span><span class="WHIT">
-<span class='line'>3817</span> </span><span class="NAME">RBTree.prototype.deleteNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3818</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">successor</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3819</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3820</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">node.left</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3821</span> </span><span class="WHIT">		</span><span class="NAME">successor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3822</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3823</span> </span><span class="WHIT">		</span><span class="NAME">successor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3824</span> </span><span class="WHIT">		</span><span class="NAME">node.key</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.key</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3825</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3826</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3827</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3828</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">successor.left</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3829</span> </span><span class="WHIT">		</span><span class="NAME">child</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3830</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>3831</span> </span><span class="WHIT">		</span><span class="NAME">child</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3832</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">child</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>3833</span> </span><span class="WHIT">		</span><span class="NAME">child.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3834</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">successor.parent</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3835</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3836</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">successor</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">successor.parent.left</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3837</span> </span><span class="WHIT">		</span><span
-        class="NAME">successor.parent.left</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3838</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>3839</span> </span><span class="WHIT">		</span><span class="NAME">successor.parent.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3840</span> 
-<span class='line'>3841</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">successor.type</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3842</span> </span><span class="WHIT">		</span><span class="NAME">this.deleteFixUp</span><span
-        class="PUNC">(</span><span class="NAME">child</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">successor.parent</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3843</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3844</span> 
-<span class='line'>3845</span> </span><span class="COMM">/**
-<span class='line'>3846</span>  * Preserves the properties of the tree after a deletion.
-<span class='line'>3847</span>  * @param node {RBNode} The node to delete.
-<span class='line'>3848</span>  * @param parent {RBNode} The parent of the node.
-<span class='line'>3849</span>  * @return {void}
-<span class='line'>3850</span>  */</span><span class="WHIT">
-<span class='line'>3851</span> </span><span class="NAME">RBTree.prototype.deleteFixUp</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3852</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="NAME">this.root</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">node.type</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3853</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3854</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">brother</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent.right</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3855</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3856</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3857</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3858</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.leftRotate</span><span class="PUNC">(</span><span class="NAME">parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3859</span> </span><span class="WHIT">				</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3860</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>3861</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">!</span><span class="NAME">brother.left</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">brother.left.type</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">brother.right</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">brother.right.type</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3862</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3863</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3864</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3865</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">brother.right</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="NAME">brother.right.type</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3866</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother.left.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3867</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3868</span> </span><span class="WHIT">					</span><span
-        class="NAME">this.rightRotate</span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3869</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3870</span> </span><span class="WHIT">				</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>3871</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.type</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3872</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3873</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.right.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3874</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.leftRotate</span><span class="PUNC">(</span><span class="NAME">parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3875</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3876</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>3877</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3878</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">brother</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3879</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3880</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3881</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3882</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.rightRotate</span><span class="PUNC">(</span><span class="NAME">parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3883</span> </span><span class="WHIT">				</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3884</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>3885</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">!</span><span class="NAME">brother.left</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">brother.left.type</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">brother.right</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">brother.right.type</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3886</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3887</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3888</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>3889</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">brother.left</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="NAME">brother.left.type</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3890</span> </span><span class="WHIT">					</span><span class="NAME">brother.right.type</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3891</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3892</span> </span><span class="WHIT">					</span><span
-        class="NAME">this.leftRotate</span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3893</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3894</span> </span><span class="WHIT">				</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>3895</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.type</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3896</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3897</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.left.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3898</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.rightRotate</span><span class="PUNC">(</span><span class="NAME">parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3899</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3900</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>3901</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3902</span> </span><span class="WHIT">		</span><span class="NAME">parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3903</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3904</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>3905</span> </span><span class="WHIT">		</span><span class="NAME">node.type</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3906</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3907</span> 
-<span class='line'>3908</span> </span><span class="COMM">/**
-<span class='line'>3909</span>  * Gets the node with the key next to the param node key.
-<span class='line'>3910</span>  * @param node {RBNode} The node of which search the successor.
-<span class='line'>3911</span>  * @return {RBNode} The node found.
-<span class='line'>3912</span>  */</span><span class="WHIT">
-<span class='line'>3913</span> </span><span class="NAME">RBTree.prototype.successor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3914</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3915</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.minimum</span><span class="PUNC">(</span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3916</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3917</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">parent</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.right</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3918</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3919</span> </span><span class="WHIT">		</span><span class="NAME">parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3920</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3921</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3922</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3923</span> 
-<span class='line'>3924</span> </span><span class="COMM">/**
-<span class='line'>3925</span>  * Gets the node with the key previous to the param node key.
-<span class='line'>3926</span>  * @param node {RBNode} The node of which search the predecessor.
-<span class='line'>3927</span>  * @return {RBNode} The node found.
-<span class='line'>3928</span>  */</span><span class="WHIT">
-<span class='line'>3929</span> </span><span class="NAME">RBTree.prototype.predecessor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3930</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.left</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3931</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.maximum</span><span class="PUNC">(</span><span class="NAME">node.left</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3932</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3933</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">parent</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3934</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3935</span> </span><span class="WHIT">		</span><span class="NAME">parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3936</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>3937</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3938</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3939</span> 
-<span class='line'>3940</span> </span><span class="COMM">/**
-<span class='line'>3941</span>  * Searches the item relatives to the key and to the nodes that satisfy the condition represented by the callback function.
-<span class='line'>3942</span>  * @param key {number} The key to find.
-<span class='line'>3943</span>  * @param [node = root] {RBNode} The node from which start the search.
-<span class='line'>3944</span>  * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
-<span class='line'>3945</span>  * @return {*} The item found or undefined if there isn't the key in the tree.
-<span class='line'>3946</span>  */</span><span class="WHIT">
-<span class='line'>3947</span> </span><span class="NAME">RBTree.prototype.search</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3948</span> </span><span class="WHIT">	</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3949</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3950</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.key</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>3951</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>3952</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">!</span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3953</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.key</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>3954</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3955</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>3956</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3957</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>3958</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3959</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3960</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3961</span> 
-<span class='line'>3962</span> </span><span class="COMM">/**
-<span class='line'>3963</span>  * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
-<span class='line'>3964</span>  * This method avoid to search in branches where the key won't be found.
-<span class='line'>3965</span>  * @param key {*} The key to find.
-<span class='line'>3966</span>  * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
-<span class='line'>3967</span>  * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
-<span class='line'>3968</span>  */</span><span class="WHIT">
-<span class='line'>3969</span> </span><span class="NAME">RBTree.prototype.contains</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>3970</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.search</span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">!==</span><span class="WHIT"> </span><span
-        class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3971</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3972</span> 
-<span class='line'>3973</span> </span><span class="COMM">/**
-<span class='line'>3974</span>  * Checks if the tree contains a node that satisfy the condition represented by the callback function.
-<span class='line'>3975</span>  * This method check all the tree avoiding the binary search.
-<span class='line'>3976</span>  * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
-<span class='line'>3977</span>  * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
-<span class='line'>3978</span>  */</span><span class="WHIT">
-<span class='line'>3979</span> </span><span class="NAME">RBTree.prototype.fullContains</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3980</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.minimum</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3981</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">!</span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">node.key</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>3982</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3983</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">!==</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3984</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3985</span> 
-<span class='line'>3986</span> </span><span class="COMM">/**
-<span class='line'>3987</span>  * Gets the item relatives to the minimum key stored in the tree.
-<span class='line'>3988</span>  * @param [node = root] {Node} The node from which start the search.
-<span class='line'>3989</span>  * @return {RBNode} The node found.
-<span class='line'>3990</span>  */</span><span class="WHIT">
-<span class='line'>3991</span> </span><span class="NAME">RBTree.prototype.minimum</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>3992</span> </span><span class="WHIT">	</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3993</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node.left</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>3994</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3995</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3996</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>3997</span> 
-<span class='line'>3998</span> </span><span class="COMM">/**
-<span class='line'>3999</span>  * Gets the item relatives to the maximum key stored in the tree.
-<span class='line'>4000</span>  * @param [node = root] {Node} The node from which start the search.
-<span class='line'>4001</span>  * @return {RBNode} The node found.
-<span class='line'>4002</span>  */</span><span class="WHIT">
-<span class='line'>4003</span> </span><span class="NAME">RBTree.prototype.maximum</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4004</span> </span><span class="WHIT">	</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4005</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node.right</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4006</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4007</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4008</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4009</span> 
-<span class='line'>4010</span> </span><span class="COMM">/**
-<span class='line'>4011</span>  * Rotates the node with its right child.
-<span class='line'>4012</span>  * @param node {RBNode} The node to rotate.
-<span class='line'>4013</span>  * @return {void}
-<span class='line'>4014</span>  */</span><span class="WHIT">
-<span class='line'>4015</span> </span><span class="NAME">RBTree.prototype.leftRotate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4016</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4017</span> </span><span class="WHIT">	</span><span class="NAME">node.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">child.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4018</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">child.left</span><span
-        class="WHIT"> </span><span class="PUNC">!==</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4019</span> </span><span class="WHIT">		</span><span class="NAME">child.left.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4020</span> </span><span class="WHIT">	</span><span class="NAME">child.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4021</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.parent</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4022</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4023</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">node.parent.left</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4024</span> </span><span class="WHIT">		</span><span class="NAME">node.parent.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4025</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4026</span> </span><span class="WHIT">		</span><span class="NAME">node.parent.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4027</span> </span><span class="WHIT">	</span><span class="NAME">node.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4028</span> </span><span class="WHIT">	</span><span class="NAME">child.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4029</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4030</span> 
-<span class='line'>4031</span> </span><span class="COMM">/**
-<span class='line'>4032</span>  * Rotates the node with its left child.
-<span class='line'>4033</span>  * @param node {RBNode} The node to rotate.
-<span class='line'>4034</span>  * @return {void}
-<span class='line'>4035</span>  */</span><span class="WHIT">
-<span class='line'>4036</span> </span><span class="NAME">RBTree.prototype.rightRotate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4037</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4038</span> </span><span class="WHIT">	</span><span class="NAME">node.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.right</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4039</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">child.right</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4040</span> </span><span class="WHIT">		</span><span
-        class="NAME">child.right.parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4041</span> </span><span class="WHIT">	</span><span class="NAME">child.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4042</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.parent</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4043</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4044</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">node.parent.left</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4045</span> </span><span class="WHIT">		</span><span class="NAME">node.parent.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4046</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4047</span> </span><span class="WHIT">		</span><span class="NAME">node.parent.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4048</span> </span><span class="WHIT">	</span><span class="NAME">node.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4049</span> </span><span class="WHIT">	</span><span class="NAME">child.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4050</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4051</span> 
-<span class='line'>4052</span> </span><span class="COMM">/**
-<span class='line'>4053</span>  * Returns the size of the tree.
-<span class='line'>4054</span>  * @return {number} The size of the tree.
-<span class='line'>4055</span>  */</span><span class="WHIT">
-<span class='line'>4056</span> </span><span class="NAME">RBTree.prototype.getSize</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4057</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4058</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4059</span> 
-<span class='line'>4060</span> </span><span class="COMM">/**
-<span class='line'>4061</span>  * Clones the queue into a new queue.
-<span class='line'>4062</span>  * @return {RBTree} The tree cloned from this queue.
-<span class='line'>4063</span>  */</span><span class="WHIT">
-<span class='line'>4064</span> </span><span class="NAME">RBTree.prototype.clone</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4065</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">RBTree</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4066</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4067</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4068</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">item.clone</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4069</span> </span><span class="WHIT">			</span><span class="NAME">tree.insert</span><span
-        class="PUNC">(</span><span class="NAME">it.getNode</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">it.getNode</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item.clone</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4070</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>4071</span> </span><span class="WHIT">			</span><span class="NAME">tree.insert</span><span
-        class="PUNC">(</span><span class="NAME">it.getNode</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">it.getNode</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4072</span> 
-<span class='line'>4073</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4074</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4075</span> 
-<span class='line'>4076</span> </span><span class="COMM">/**
-<span class='line'>4077</span>  * Clones the tree into a new tree without cloning duplicated items.
-<span class='line'>4078</span>  * @return {RBTree} The tree cloned from this tree.
-<span class='line'>4079</span>  */</span><span class="WHIT">
-<span class='line'>4080</span> </span><span class="NAME">RBTree.prototype.cloneDistinct</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4081</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">RBTree</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4082</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4083</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4084</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4085</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.key</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">node.item</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">it.getNode</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4086</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4087</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">tree.contains</span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4088</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">item.cloneDistinct</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4089</span> </span><span class="WHIT">				</span><span
-        class="NAME">tree.insert</span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">item.cloneDistinct</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4090</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">it.getNode</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">item.clone</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4091</span> </span><span class="WHIT">				</span><span
-        class="NAME">tree.insert</span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">item.clone</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4092</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>4093</span> </span><span class="WHIT">				</span><span
-        class="NAME">tree.insert</span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4094</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4095</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4096</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4097</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4098</span> 
-<span class='line'>4099</span> </span><span class="COMM">/**
-<span class='line'>4100</span>  * Transforms the tree into an array without preserving keys.
-<span class='line'>4101</span>  * @return {Array&lt;*>} The array that represents the tree.
-<span class='line'>4102</span>  */</span><span class="WHIT">
-<span class='line'>4103</span> </span><span class="NAME">RBTree.prototype.toArray</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4104</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4105</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.minimum</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.successor</span><span class="PUNC">(</span><span
-        class="NAME">node</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4106</span> </span><span class="WHIT">		</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4107</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4108</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4109</span> 
-<span class='line'>4110</span> </span><span class="COMM">/**
-<span class='line'>4111</span>  * Removes all the items stored in the tree.
-<span class='line'>4112</span>  * @return {void}
-<span class='line'>4113</span>  */</span><span class="WHIT">
-<span class='line'>4114</span> </span><span class="NAME">RBTree.prototype.clear</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4115</span> </span><span class="WHIT">	</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4116</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4117</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4118</span> 
-<span class='line'>4119</span> </span><span class="COMM">/**
-<span class='line'>4120</span>  * Checks if the tree is empty.
-<span class='line'>4121</span>  * @return {boolean} True if the tree is empty, false otherwise.
-<span class='line'>4122</span>  */</span><span class="WHIT">
-<span class='line'>4123</span> </span><span class="NAME">RBTree.prototype.isEmpty</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4124</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4125</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4126</span> 
-<span class='line'>4127</span> </span><span class="COMM">/**
-<span class='line'>4128</span>  * Executes the callback function for each item of the tree.
-<span class='line'>4129</span>  * This method modifies the tree so if you don't need to modify it you must return the same item stored.
-<span class='line'>4130</span>  * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
-<span class='line'>4131</span>  * @return {void}
-<span class='line'>4132</span>  */</span><span class="WHIT">
-<span class='line'>4133</span> </span><span class="NAME">RBTree.prototype.execute</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4134</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.minimum</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.successor</span><span class="PUNC">(</span><span
-        class="NAME">node</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4135</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">node.item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4136</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4137</span> 
-<span class='line'>4138</span> </span><span class="COMM">/**
-<span class='line'>4139</span>  * Returns the items that satisfy the condition determined by the callback.
-<span class='line'>4140</span>  * @param callback {function} The function that implements the condition.
-<span class='line'>4141</span>  * @return {Array&lt;*>} The array that contains the items that satisfy the condition.
-<span class='line'>4142</span>  */</span><span class="WHIT">
-<span class='line'>4143</span> </span><span class="NAME">RBTree.prototype.filter</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4144</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4145</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.minimum</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.successor</span><span class="PUNC">(</span><span
-        class="NAME">node</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4146</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4147</span> </span><span class="WHIT">			</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4148</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4149</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4150</span> 
-<span class='line'>4151</span> </span><span class="COMM">/**
-<span class='line'>4152</span>  * Returns the first position of the item in the tree.
-<span class='line'>4153</span>  * @param item {*} The item to search.
-<span class='line'>4154</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>4155</span>  * @return {number} The first position of the item.
-<span class='line'>4156</span>  */</span><span class="WHIT">
-<span class='line'>4157</span> </span><span class="NAME">RBTree.prototype.indexOf</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4158</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4159</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4160</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4161</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.minimum</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4162</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4163</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4164</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4165</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4166</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4167</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4168</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4169</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4170</span> 
-<span class='line'>4171</span> </span><span class="COMM">/**
-<span class='line'>4172</span>  * Returns the last position of the item in the tree.
-<span class='line'>4173</span>  * @param item {*} The item to search.
-<span class='line'>4174</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>4175</span>  * @return {number} The last position of the item.
-<span class='line'>4176</span>  */</span><span class="WHIT">
-<span class='line'>4177</span> </span><span class="NAME">RBTree.prototype.lastIndexOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4178</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4179</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4180</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4181</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.maximum</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4182</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4183</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4184</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4185</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4186</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.predecessor</span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4187</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4188</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4189</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4190</span> 
-<span class='line'>4191</span> </span><span class="COMM">/**
-<span class='line'>4192</span>  * Returns all the position in which the item has been found in the tree.
-<span class='line'>4193</span>  * @param item {*} The item to search.
-<span class='line'>4194</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>4195</span>  * @return {Array&lt;number>} The positions in which the item has been found.
-<span class='line'>4196</span>  */</span><span class="WHIT">
-<span class='line'>4197</span> </span><span class="NAME">RBTree.prototype.allIndexesOf</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4198</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4199</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4200</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4201</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.minimum</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4202</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4203</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4204</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4205</span> </span><span class="WHIT">			</span><span class="NAME">indexes.push</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4206</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4207</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4208</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4209</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4210</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4211</span> 
-<span class='line'>4212</span> </span><span class="COMM">/**
-<span class='line'>4213</span>  * Returns the item at the position index.
-<span class='line'>4214</span>  * @param index {number} The position of the item.
-<span class='line'>4215</span>  * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
-<span class='line'>4216</span>  */</span><span class="WHIT">
-<span class='line'>4217</span> </span><span class="NAME">RBTree.prototype.getItem</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4218</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4219</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4220</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.minimum</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span
-        class="WHIT"> </span><span class="NAME">index</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4221</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4222</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4223</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4224</span> 
-<span class='line'>4225</span> </span><span class="COMM">/**
-<span class='line'>4226</span>  * Class that implements the iterator for a red-black tree.
-<span class='line'>4227</span>  * @param aggregate {RBTree} The aggregate to scan.
-<span class='line'>4228</span>  * @constructor
-<span class='line'>4229</span>  */</span><span class="WHIT">
-<span class='line'>4230</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">RBTreeIterator</span><span
-        class="PUNC">(</span><span class="NAME">aggregate</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4231</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4232</span> 	 * The aggregate relates to this iterator.
-<span class='line'>4233</span> 	 * @type {RBTree}
-<span class='line'>4234</span> 	 */</span><span class="WHIT">
-<span class='line'>4235</span> </span><span class="WHIT">	</span><span class="NAME">this.aggregate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">aggregate</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4236</span> 
-<span class='line'>4237</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4238</span> 	 * The pointer to the position.
-<span class='line'>4239</span> 	 * @type {RBNode|null}
-<span class='line'>4240</span> 	 */</span><span class="WHIT">
-<span class='line'>4241</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4242</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4243</span> 
-<span class='line'>4244</span> </span><span class="COMM">/**
-<span class='line'>4245</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'>4246</span>  * @return {void}
-<span class='line'>4247</span>  */</span><span class="WHIT">
-<span class='line'>4248</span> </span><span class="NAME">RBTreeIterator.prototype.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4249</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.minimum</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4250</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4251</span> 
-<span class='line'>4252</span> </span><span class="COMM">/**
-<span class='line'>4253</span>  * Moves the iterator to the next item.
-<span class='line'>4254</span>  * @return {void}
-<span class='line'>4255</span>  */</span><span class="WHIT">
-<span class='line'>4256</span> </span><span class="NAME">RBTreeIterator.prototype.next</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4257</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.successor</span><span
-        class="PUNC">(</span><span class="NAME">this.pointer</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4258</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4259</span> 
-<span class='line'>4260</span> </span><span class="COMM">/**
-<span class='line'>4261</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'>4262</span>  * @return {void}
-<span class='line'>4263</span>  */</span><span class="WHIT">
-<span class='line'>4264</span> </span><span class="NAME">RBTreeIterator.prototype.last</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4265</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.maximum</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4266</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4267</span> 
-<span class='line'>4268</span> </span><span class="COMM">/**
-<span class='line'>4269</span>  * Moves the iterator to the previous item.
-<span class='line'>4270</span>  * @return {void}
-<span class='line'>4271</span>  */</span><span class="WHIT">
-<span class='line'>4272</span> </span><span class="NAME">RBTreeIterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4273</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.predecessor</span><span
-        class="PUNC">(</span><span class="NAME">this.pointer</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4274</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4275</span> 
-<span class='line'>4276</span> </span><span class="COMM">/**
-<span class='line'>4277</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'>4278</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'>4279</span>  */</span><span class="WHIT">
-<span class='line'>4280</span> </span><span class="NAME">RBTreeIterator.prototype.isDone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4281</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.pointer</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4282</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4283</span> 
-<span class='line'>4284</span> </span><span class="COMM">/**
-<span class='line'>4285</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'>4286</span>  * @return {Object|undefined} The item stored or undefined if it's out of the bounds.
-<span class='line'>4287</span>  */</span><span class="WHIT">
-<span class='line'>4288</span> </span><span class="NAME">RBTreeIterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4289</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4290</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4291</span> 
-<span class='line'>4292</span> </span><span class="COMM">/**
-<span class='line'>4293</span>  * Returns the node stored at the position pointed by the iterator.
-<span class='line'>4294</span>  * @return {RBNode|null} The node stored or null if it's out of the bounds.
-<span class='line'>4295</span>  */</span><span class="WHIT">
-<span class='line'>4296</span> </span><span class="NAME">RBTreeIterator.prototype.getNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4297</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4298</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4299</span> 
-<span class='line'>4300</span> </span><span class="COMM">/**
-<span class='line'>4301</span>  * Class for managing a red-black tree where nodes are also in a list.
-<span class='line'>4302</span>  * @constructor
-<span class='line'>4303</span>  */</span><span class="WHIT">
-<span class='line'>4304</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">RBTreeList</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4305</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4306</span> 	 * The root of the tree.
-<span class='line'>4307</span> 	 * @type {RBLNode|null}
-<span class='line'>4308</span> 	 */</span><span class="WHIT">
-<span class='line'>4309</span> </span><span class="WHIT">	</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4310</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4311</span> 	 * The first node of the tree.
-<span class='line'>4312</span> 	 * @type {RBLNode|null}
-<span class='line'>4313</span> 	 */</span><span class="WHIT">
-<span class='line'>4314</span> </span><span class="WHIT">	</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4315</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4316</span> 	 * The last node of the tree.
-<span class='line'>4317</span> 	 * @type {RBLNode|null}
-<span class='line'>4318</span> 	 */</span><span class="WHIT">
-<span class='line'>4319</span> </span><span class="WHIT">	</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4320</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4321</span> 	 * The size of the tree.
-<span class='line'>4322</span> 	 * @type {number}
-<span class='line'>4323</span> 	 */</span><span class="WHIT">
-<span class='line'>4324</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4325</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4326</span> 
-<span class='line'>4327</span> </span><span class="COMM">/**
-<span class='line'>4328</span>  * Returns the iterator relative to the aggregate.
-<span class='line'>4329</span>  * @return {Iterator} The iterator.
-<span class='line'>4330</span>  */</span><span class="WHIT">
-<span class='line'>4331</span> </span><span class="NAME">RBTreeList.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4332</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span class="NAME">RBTreeListIterator</span><span
-        class="PUNC">(</span><span class="KEYW">this</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4333</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4334</span> 
-<span class='line'>4335</span> </span><span class="COMM">/**
-<span class='line'>4336</span>  * Inserts the item relatives to the key value in the tree.
-<span class='line'>4337</span>  * @param key {number} The key to store.
-<span class='line'>4338</span>  * @param item {*} The item to store.
-<span class='line'>4339</span>  * @return {void}
-<span class='line'>4340</span>  */</span><span class="WHIT">
-<span class='line'>4341</span> </span><span class="NAME">RBTreeList.prototype.insert</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4342</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">RBLNode</span><span class="PUNC">(</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4343</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4344</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">this.root</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4345</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4346</span> </span><span class="WHIT">		</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4347</span> </span><span class="WHIT">		</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4348</span> </span><span class="WHIT">		</span><span class="NAME">node.type</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4349</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4350</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4351</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">p</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4352</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">n</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">n</span><span class="PUNC">;</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4353</span> </span><span class="WHIT">		</span><span class="NAME">p</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">n</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4354</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">n.key</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4355</span> </span><span class="WHIT">			</span><span class="NAME">n</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">n.left</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4356</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>4357</span> </span><span class="WHIT">			</span><span class="NAME">n</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">n.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4358</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4359</span> </span><span class="WHIT">	</span><span class="NAME">node.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">p</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4360</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">p</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4361</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4362</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">p.key</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4363</span> </span><span class="WHIT">		</span><span class="NAME">p.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4364</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4365</span> </span><span class="WHIT">		</span><span class="NAME">p.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4366</span> 
-<span class='line'>4367</span> </span><span class="WHIT">	</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4368</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.next</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4369</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.next.previous</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4370</span> </span><span class="WHIT">			</span><span
-        class="NAME">node.next.previous.next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4371</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>4372</span> </span><span class="WHIT">			</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4373</span> </span><span class="WHIT">		</span><span class="NAME">node.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4374</span> </span><span class="WHIT">		</span><span
-        class="NAME">node.next.previous</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4375</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4376</span> </span><span class="WHIT">		</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4377</span> </span><span class="WHIT">		</span><span class="NAME">node.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.predecessor</span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4378</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.previous</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4379</span> </span><span class="WHIT">			</span><span class="NAME">node.previous.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4380</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>4381</span> </span><span class="WHIT">			</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4382</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4383</span> 
-<span class='line'>4384</span> </span><span class="WHIT">	</span><span class="NAME">this.insertFixUp</span><span
-        class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4385</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4386</span> 
-<span class='line'>4387</span> </span><span class="COMM">/**
-<span class='line'>4388</span>  * Preserves the properties of the tree after an insert.
-<span class='line'>4389</span>  * @param node {RBLNode} The node to insert.
-<span class='line'>4390</span>  * @return {void}
-<span class='line'>4391</span>  */</span><span class="WHIT">
-<span class='line'>4392</span> </span><span class="NAME">RBTreeList.prototype.insertFixUp</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4393</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.parent</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">&&</span><span
-        class="WHIT"> </span><span class="NAME">parent.type</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.parent</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4394</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">parent</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.parent.left</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4395</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">uncle</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.parent.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4396</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">uncle</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">uncle.type</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4397</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4398</span> </span><span class="WHIT">				</span><span
-        class="NAME">uncle.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4399</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4400</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4401</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.right</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4402</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4403</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.leftRotate</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4404</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4405</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4406</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4407</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.rightRotate</span><span class="PUNC">(</span><span class="NAME">parent.parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4408</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>4409</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4410</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">uncle</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.parent.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4411</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">uncle</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">uncle.type</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4412</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4413</span> </span><span class="WHIT">				</span><span
-        class="NAME">uncle.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4414</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4415</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4416</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4417</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4418</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.rightRotate</span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4419</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4420</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4421</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4422</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.leftRotate</span><span class="PUNC">(</span><span class="NAME">parent.parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4423</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>4424</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4425</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4426</span> </span><span class="WHIT">	</span><span class="NAME">this.root.type</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4427</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4428</span> 
-<span class='line'>4429</span> </span><span class="COMM">/**
-<span class='line'>4430</span>  * Deletes the node from the tree.
-<span class='line'>4431</span>  * @param node {RBLNode} The node to delete.
-<span class='line'>4432</span>  * @return {void}
-<span class='line'>4433</span>  */</span><span class="WHIT">
-<span class='line'>4434</span> </span><span class="NAME">RBTreeList.prototype.deleteNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4435</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4436</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">successor</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4437</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">node.left</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4438</span> </span><span class="WHIT">		</span><span class="NAME">successor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4439</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4440</span> </span><span class="WHIT">		</span><span class="NAME">successor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.successor</span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4441</span> </span><span class="WHIT">		</span><span class="NAME">node.key</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.key</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4442</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4443</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4444</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4445</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">successor.left</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4446</span> </span><span class="WHIT">		</span><span class="NAME">child</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4447</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4448</span> </span><span class="WHIT">		</span><span class="NAME">child</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4449</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">child</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4450</span> </span><span class="WHIT">		</span><span class="NAME">child.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4451</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">successor.parent</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4452</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4453</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">successor</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">successor.parent.left</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4454</span> </span><span class="WHIT">		</span><span
-        class="NAME">successor.parent.left</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4455</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4456</span> </span><span class="WHIT">		</span><span class="NAME">successor.parent.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4457</span> 
-<span class='line'>4458</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">successor.next</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4459</span> </span><span class="WHIT">		</span><span
-        class="NAME">successor.next.previous</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">successor.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4460</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4461</span> </span><span class="WHIT">		</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4462</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">successor.previous</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4463</span> </span><span class="WHIT">		</span><span
-        class="NAME">successor.previous.next</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">successor.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4464</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4465</span> </span><span class="WHIT">		</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">successor.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4466</span> 
-<span class='line'>4467</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">successor.type</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4468</span> </span><span class="WHIT">		</span><span class="NAME">this.deleteFixUp</span><span
-        class="PUNC">(</span><span class="NAME">child</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">successor.parent</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4469</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4470</span> 
-<span class='line'>4471</span> </span><span class="COMM">/**
-<span class='line'>4472</span>  * Preserves the properties of the tree after a deletion.
-<span class='line'>4473</span>  * @param node {RBLNode} The node to delete.
-<span class='line'>4474</span>  * @param parent {RBLNode} The parent of the node.
-<span class='line'>4475</span>  * @return {void}
-<span class='line'>4476</span>  */</span><span class="WHIT">
-<span class='line'>4477</span> </span><span class="NAME">RBTreeList.prototype.deleteFixUp</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4478</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="NAME">this.root</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">node.type</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4479</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4480</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">brother</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent.right</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4481</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4482</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4483</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4484</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.leftRotate</span><span class="PUNC">(</span><span class="NAME">parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4485</span> </span><span class="WHIT">				</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4486</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>4487</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">!</span><span class="NAME">brother.left</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">brother.left.type</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">brother.right</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">brother.right.type</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4488</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4489</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4490</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4491</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">brother.right</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="NAME">brother.right.type</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4492</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother.left.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4493</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4494</span> </span><span class="WHIT">					</span><span
-        class="NAME">this.rightRotate</span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4495</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4496</span> </span><span class="WHIT">				</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>4497</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.type</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4498</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4499</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.right.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4500</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.leftRotate</span><span class="PUNC">(</span><span class="NAME">parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4501</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4502</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>4503</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4504</span> </span><span class="WHIT">			</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">brother</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4505</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4506</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4507</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4508</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.rightRotate</span><span class="PUNC">(</span><span class="NAME">parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4509</span> </span><span class="WHIT">				</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4510</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>4511</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">!</span><span class="NAME">brother.left</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">brother.left.type</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="PUNC">!</span><span class="NAME">brother.right</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">brother.right.type</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4512</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4513</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4514</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT"> </span><span class="KEYW">else</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4515</span> </span><span class="WHIT">				</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">brother.left</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="NAME">brother.left.type</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4516</span> </span><span class="WHIT">					</span><span class="NAME">brother.right.type</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4517</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'r'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4518</span> </span><span class="WHIT">					</span><span
-        class="NAME">this.leftRotate</span><span class="PUNC">(</span><span class="NAME">brother</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4519</span> </span><span class="WHIT">					</span><span
-        class="NAME">brother</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4520</span> </span><span class="WHIT">				</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>4521</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">parent.type</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4522</span> </span><span class="WHIT">				</span><span
-        class="NAME">parent.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4523</span> </span><span class="WHIT">				</span><span
-        class="NAME">brother.left.type</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="STRN">'b'</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4524</span> </span><span class="WHIT">				</span><span
-        class="NAME">this.rightRotate</span><span class="PUNC">(</span><span class="NAME">parent</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4525</span> </span><span class="WHIT">				</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4526</span> </span><span class="WHIT">			</span><span class="PUNC">}</span><span
-        class="WHIT">
-<span class='line'>4527</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4528</span> </span><span class="WHIT">		</span><span class="NAME">parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4529</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4530</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4531</span> </span><span class="WHIT">		</span><span class="NAME">node.type</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="STRN">'b'</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4532</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4533</span> 
-<span class='line'>4534</span> </span><span class="COMM">/**
-<span class='line'>4535</span>  * Gets the node with the key next to the param node key.
-<span class='line'>4536</span>  * @param node {RBLNode} The node of which search the successor.
-<span class='line'>4537</span>  * @return {RBLNode} The node found.
-<span class='line'>4538</span>  */</span><span class="WHIT">
-<span class='line'>4539</span> </span><span class="NAME">RBTreeList.prototype.successor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4540</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.next</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">this.last</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4541</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4542</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4543</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.minimum</span><span class="PUNC">(</span><span class="NAME">node.right</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4544</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4545</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">parent</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.right</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4546</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4547</span> </span><span class="WHIT">		</span><span class="NAME">parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4548</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4549</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4550</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4551</span> 
-<span class='line'>4552</span> </span><span class="COMM">/**
-<span class='line'>4553</span>  * Gets the node with the key previous to the param node key.
-<span class='line'>4554</span>  * @param node {RBLNode} The node of which search the predecessor.
-<span class='line'>4555</span>  * @return {RBLNode} The node found.
-<span class='line'>4556</span>  */</span><span class="WHIT">
-<span class='line'>4557</span> </span><span class="NAME">RBTreeList.prototype.predecessor</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4558</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.previous</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4559</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4560</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.left</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4561</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.maximum</span><span class="PUNC">(</span><span class="NAME">node.left</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4562</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4563</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">parent</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">parent.left</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4564</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4565</span> </span><span class="WHIT">		</span><span class="NAME">parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">parent.parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4566</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4567</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4568</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4569</span> 
-<span class='line'>4570</span> </span><span class="COMM">/**
-<span class='line'>4571</span>  * Searches the item relatives to the key that satisfy the condition represented by the callback function.
-<span class='line'>4572</span>  * @param key {number} The key to find.
-<span class='line'>4573</span>  * @param [node = root] {RBNode} The node from which start the search.
-<span class='line'>4574</span>  * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
-<span class='line'>4575</span>  * @return {*} The item found or undefined if there isn't the key in the tree.
-<span class='line'>4576</span>  */</span><span class="WHIT">
-<span class='line'>4577</span> </span><span class="NAME">RBTreeList.prototype.search</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4578</span> </span><span class="WHIT">	</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">||</span><span class="WHIT"> </span><span
-        class="NAME">this.root</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4579</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4580</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.key</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">key</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4581</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4582</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">!</span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4583</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">node.key</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4584</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4585</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>4586</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4587</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4588</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4589</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4590</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4591</span> 
-<span class='line'>4592</span> </span><span class="COMM">/**
-<span class='line'>4593</span>  * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
-<span class='line'>4594</span>  * This method avoid to search in branches where the key won't be found.
-<span class='line'>4595</span>  * @param key {*} The key to find.
-<span class='line'>4596</span>  * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
-<span class='line'>4597</span>  * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
-<span class='line'>4598</span>  */</span><span class="WHIT">
-<span class='line'>4599</span> </span><span class="NAME">RBTreeList.prototype.contains</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4600</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.search</span><span class="PUNC">(</span><span
-        class="NAME">key</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">!==</span><span class="WHIT"> </span><span
-        class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4601</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4602</span> 
-<span class='line'>4603</span> </span><span class="COMM">/**
-<span class='line'>4604</span>  * Checks if the tree contains a node that satisfy the condition represented by the callback function.
-<span class='line'>4605</span>  * This method check all the tree avoiding the binary search.
-<span class='line'>4606</span>  * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
-<span class='line'>4607</span>  * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
-<span class='line'>4608</span>  */</span><span class="WHIT">
-<span class='line'>4609</span> </span><span class="NAME">RBTreeList.prototype.fullContains</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4610</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4611</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">!</span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">node.key</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4612</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4613</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">!==</span><span
-        class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4614</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4615</span> 
-<span class='line'>4616</span> </span><span class="COMM">/**
-<span class='line'>4617</span>  * Gets the item relatives to the minimum key stored in the tree.
-<span class='line'>4618</span>  * @param [node = root] {Node} The node from which start the search.
-<span class='line'>4619</span>  * @return {RBLNode} The node found.
-<span class='line'>4620</span>  */</span><span class="WHIT">
-<span class='line'>4621</span> </span><span class="NAME">RBTreeList.prototype.minimum</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4622</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4623</span> </span><span class="WHIT">		</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node.left</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4624</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4625</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4626</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4627</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4628</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4629</span> 
-<span class='line'>4630</span> </span><span class="COMM">/**
-<span class='line'>4631</span>  * Gets the item relatives to the maximum key stored in the tree.
-<span class='line'>4632</span>  * @param [node = root] {Node} The node from which start the search.
-<span class='line'>4633</span>  * @return {RBLNode} The node found.
-<span class='line'>4634</span>  */</span><span class="WHIT">
-<span class='line'>4635</span> </span><span class="NAME">RBTreeList.prototype.maximum</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4636</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4637</span> </span><span class="WHIT">		</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="WHIT"> </span><span
-        class="PUNC">&&</span><span class="WHIT"> </span><span class="NAME">node.right</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4638</span> </span><span class="WHIT">			</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4639</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4640</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4641</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4642</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4643</span> 
-<span class='line'>4644</span> </span><span class="COMM">/**
-<span class='line'>4645</span>  * Rotates the node with its right child.
-<span class='line'>4646</span>  * @param node {RBLNode} The node to rotate.
-<span class='line'>4647</span>  * @return {void}
-<span class='line'>4648</span>  */</span><span class="WHIT">
-<span class='line'>4649</span> </span><span class="NAME">RBTreeList.prototype.leftRotate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4650</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.right</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4651</span> </span><span class="WHIT">	</span><span class="NAME">node.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">child.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4652</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">child.left</span><span
-        class="WHIT"> </span><span class="PUNC">!==</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4653</span> </span><span class="WHIT">		</span><span class="NAME">child.left.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4654</span> </span><span class="WHIT">	</span><span class="NAME">child.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4655</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.parent</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4656</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4657</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">node.parent.left</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4658</span> </span><span class="WHIT">		</span><span class="NAME">node.parent.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4659</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4660</span> </span><span class="WHIT">		</span><span class="NAME">node.parent.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4661</span> </span><span class="WHIT">	</span><span class="NAME">node.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4662</span> </span><span class="WHIT">	</span><span class="NAME">child.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4663</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4664</span> 
-<span class='line'>4665</span> </span><span class="COMM">/**
-<span class='line'>4666</span>  * Rotates the node with its left child.
-<span class='line'>4667</span>  * @param node {RBLNode} The node to rotate.
-<span class='line'>4668</span>  * @return {void}
-<span class='line'>4669</span>  */</span><span class="WHIT">
-<span class='line'>4670</span> </span><span class="NAME">RBTreeList.prototype.rightRotate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4671</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">child</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node.left</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4672</span> </span><span class="WHIT">	</span><span class="NAME">node.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child.right</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4673</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">child.right</span><span class="WHIT"> </span><span
-        class="PUNC">!==</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4674</span> </span><span class="WHIT">		</span><span
-        class="NAME">child.right.parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4675</span> </span><span class="WHIT">	</span><span class="NAME">child.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node.parent</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4676</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node.parent</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="KEYW">null</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4677</span> </span><span class="WHIT">		</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4678</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">node.parent.left</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4679</span> </span><span class="WHIT">		</span><span class="NAME">node.parent.left</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4680</span> </span><span class="WHIT">	</span><span class="KEYW">else</span><span class="WHIT">
-<span class='line'>4681</span> </span><span class="WHIT">		</span><span class="NAME">node.parent.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4682</span> </span><span class="WHIT">	</span><span class="NAME">node.parent</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">child</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4683</span> </span><span class="WHIT">	</span><span class="NAME">child.right</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">node</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4684</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4685</span> 
-<span class='line'>4686</span> </span><span class="COMM">/**
-<span class='line'>4687</span>  * Returns the size of the tree.
-<span class='line'>4688</span>  * @return {number} The size of the tree.
-<span class='line'>4689</span>  */</span><span class="WHIT">
-<span class='line'>4690</span> </span><span class="NAME">RBTreeList.prototype.getSize</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4691</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4692</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4693</span> 
-<span class='line'>4694</span> </span><span class="COMM">/**
-<span class='line'>4695</span>  * Clones the tree into a new tree.
-<span class='line'>4696</span>  * @return {RBTreeList} The tree cloned from this tree.
-<span class='line'>4697</span>  */</span><span class="WHIT">
-<span class='line'>4698</span> </span><span class="NAME">RBTreeList.prototype.clone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4699</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">RBTreeList</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4700</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4701</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4702</span> </span><span class="WHIT">		</span><span class="NAME">tree.insert</span><span
-        class="PUNC">(</span><span class="NAME">it.getNode</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">it.getNode</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4703</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4704</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4705</span> 
-<span class='line'>4706</span> </span><span class="COMM">/**
-<span class='line'>4707</span>  * Clones the tree into a new tree without cloning duplicated items.
-<span class='line'>4708</span>  * @return {RBTreeList} The tree cloned from this tree.
-<span class='line'>4709</span>  */</span><span class="WHIT">
-<span class='line'>4710</span> </span><span class="NAME">RBTreeList.prototype.cloneDistinct</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4711</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">RBTreeList</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4712</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4713</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4714</span> </span><span class="WHIT">		</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4715</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.key</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">node.item</span><span class="WHIT"> </span><span class="PUNC">===</span><span class="WHIT"> </span><span
-        class="NAME">it.getNode</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4716</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4717</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">tree.contains</span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4718</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">item.cloneDistinct</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4719</span> </span><span class="WHIT">				</span><span
-        class="NAME">tree.insert</span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">item.cloneDistinct</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4720</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">it.getNode</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">item.clone</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4721</span> </span><span class="WHIT">				</span><span
-        class="NAME">tree.insert</span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">item.clone</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4722</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>4723</span> </span><span class="WHIT">				</span><span
-        class="NAME">tree.insert</span><span class="PUNC">(</span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">key</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">it.getNode</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4724</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4725</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4726</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">tree</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4727</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4728</span> 
-<span class='line'>4729</span> </span><span class="COMM">/**
-<span class='line'>4730</span>  * Transforms the tree into an array without preserving keys.
-<span class='line'>4731</span>  * @return {Array&lt;*>} The array that represents the tree.
-<span class='line'>4732</span>  */</span><span class="WHIT">
-<span class='line'>4733</span> </span><span class="NAME">RBTreeList.prototype.toArray</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4734</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4735</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4736</span> </span><span class="WHIT">		</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4737</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4738</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4739</span> 
-<span class='line'>4740</span> </span><span class="COMM">/**
-<span class='line'>4741</span>  * Removes all the items stored in the tree.
-<span class='line'>4742</span>  * @return {void}
-<span class='line'>4743</span>  */</span><span class="WHIT">
-<span class='line'>4744</span> </span><span class="NAME">RBTreeList.prototype.clear</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4745</span> </span><span class="WHIT">	</span><span class="NAME">this.root</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4746</span> </span><span class="WHIT">	</span><span class="NAME">this.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4747</span> </span><span class="WHIT">	</span><span class="NAME">this.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4748</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4749</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4750</span> 
-<span class='line'>4751</span> </span><span class="COMM">/**
-<span class='line'>4752</span>  * Checks if the tree is empty.
-<span class='line'>4753</span>  * @return {boolean} True if the tree is empty, false otherwise.
-<span class='line'>4754</span>  */</span><span class="WHIT">
-<span class='line'>4755</span> </span><span class="NAME">RBTreeList.prototype.isEmpty</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4756</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4757</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4758</span> 
-<span class='line'>4759</span> </span><span class="COMM">/**
-<span class='line'>4760</span>  * Executes the callback function for each item of the tree.
-<span class='line'>4761</span>  * This method modifies the tree so if you don't need to modify it you must return the same item stored.
-<span class='line'>4762</span>  * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
-<span class='line'>4763</span>  * @return {void}
-<span class='line'>4764</span>  */</span><span class="WHIT">
-<span class='line'>4765</span> </span><span class="NAME">RBTreeList.prototype.execute</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4766</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4767</span> </span><span class="WHIT">		</span><span class="NAME">node.item</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">node.item</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4768</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4769</span> 
-<span class='line'>4770</span> </span><span class="COMM">/**
-<span class='line'>4771</span>  * Returns the items that satisfy the condition determined by the callback.
-<span class='line'>4772</span>  * @param callback {function} The function that implements the condition.
-<span class='line'>4773</span>  * @return {Array&lt;*>} The array that contains the items that satisfy the condition.
-<span class='line'>4774</span>  */</span><span class="WHIT">
-<span class='line'>4775</span> </span><span class="NAME">RBTreeList.prototype.filter</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">callback</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4776</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4777</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4778</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4779</span> </span><span class="WHIT">			</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4780</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4781</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4782</span> 
-<span class='line'>4783</span> </span><span class="COMM">/**
-<span class='line'>4784</span>  * Returns the first position of the item in the tree.
-<span class='line'>4785</span>  * @param item {*} The item to search.
-<span class='line'>4786</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>4787</span>  * @return {number} The first position of the item.
-<span class='line'>4788</span>  */</span><span class="WHIT">
-<span class='line'>4789</span> </span><span class="NAME">RBTreeList.prototype.indexOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4790</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4791</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4792</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4793</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4794</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4795</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4796</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4797</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4798</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4799</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4800</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4801</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4802</span> 
-<span class='line'>4803</span> </span><span class="COMM">/**
-<span class='line'>4804</span>  * Returns the last position of the item in the tree.
-<span class='line'>4805</span>  * @param item {*} The item to search.
-<span class='line'>4806</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>4807</span>  * @return {number} The last position of the item.
-<span class='line'>4808</span>  */</span><span class="WHIT">
-<span class='line'>4809</span> </span><span class="NAME">RBTreeList.prototype.lastIndexOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4810</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4811</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4812</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4813</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.last</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4814</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4815</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4816</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4817</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4818</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.previous</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4819</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4820</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4821</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4822</span> 
-<span class='line'>4823</span> </span><span class="COMM">/**
-<span class='line'>4824</span>  * Returns all the position in which the item has been found in the tree.
-<span class='line'>4825</span>  * @param item {*} The item to search.
-<span class='line'>4826</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>4827</span>  * @return {Array&lt;number>} The positions in which the item has been found.
-<span class='line'>4828</span>  */</span><span class="WHIT">
-<span class='line'>4829</span> </span><span class="NAME">RBTreeList.prototype.allIndexesOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4830</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4831</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4832</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4833</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4834</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4835</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">node</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4836</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">node.item</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4837</span> </span><span class="WHIT">			</span><span class="NAME">indexes.push</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4838</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4839</span> </span><span class="WHIT">		</span><span class="NAME">node</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4840</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4841</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4842</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4843</span> 
-<span class='line'>4844</span> </span><span class="COMM">/**
-<span class='line'>4845</span>  * Returns the item at the position index.
-<span class='line'>4846</span>  * @param index {number} The position of the item.
-<span class='line'>4847</span>  * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
-<span class='line'>4848</span>  */</span><span class="WHIT">
-<span class='line'>4849</span> </span><span class="NAME">RBTreeList.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">index</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4850</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>4851</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4852</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.first</span><span class="PUNC">,</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">index</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">node</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">node.next</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>4853</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4854</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">node.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4855</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4856</span> 
-<span class='line'>4857</span> </span><span class="COMM">/**
-<span class='line'>4858</span>  * Class that implements the iterator for a red-black tree.
-<span class='line'>4859</span>  * @param aggregate {RBTreeList} The aggregate to scan.
-<span class='line'>4860</span>  * @constructor
-<span class='line'>4861</span>  */</span><span class="WHIT">
-<span class='line'>4862</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">RBTreeListIterator</span><span
-        class="PUNC">(</span><span class="NAME">aggregate</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4863</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4864</span> 	 * The aggregate relates to this iterator.
-<span class='line'>4865</span> 	 * @type {RBTreeList}
-<span class='line'>4866</span> 	 */</span><span class="WHIT">
-<span class='line'>4867</span> </span><span class="WHIT">	</span><span class="NAME">this.aggregate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">aggregate</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4868</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4869</span> 	 * The pointer to the position.
-<span class='line'>4870</span> 	 * @type {RBLNode|null}
-<span class='line'>4871</span> 	 */</span><span class="WHIT">
-<span class='line'>4872</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">null</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4873</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4874</span> 
-<span class='line'>4875</span> </span><span class="COMM">/**
-<span class='line'>4876</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'>4877</span>  * @return {void}
-<span class='line'>4878</span>  */</span><span class="WHIT">
-<span class='line'>4879</span> </span><span class="NAME">RBTreeListIterator.prototype.first</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4880</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.first</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4881</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4882</span> 
-<span class='line'>4883</span> </span><span class="COMM">/**
-<span class='line'>4884</span>  * Moves the iterator to the next item.
-<span class='line'>4885</span>  * @return {void}
-<span class='line'>4886</span>  */</span><span class="WHIT">
-<span class='line'>4887</span> </span><span class="NAME">RBTreeListIterator.prototype.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4888</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.pointer.next</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4889</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4890</span> 
-<span class='line'>4891</span> </span><span class="COMM">/**
-<span class='line'>4892</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'>4893</span>  * @return {void}
-<span class='line'>4894</span>  */</span><span class="WHIT">
-<span class='line'>4895</span> </span><span class="NAME">RBTreeListIterator.prototype.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4896</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.last</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4897</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4898</span> 
-<span class='line'>4899</span> </span><span class="COMM">/**
-<span class='line'>4900</span>  * Moves the iterator to the previous item.
-<span class='line'>4901</span>  * @return {void}
-<span class='line'>4902</span>  */</span><span class="WHIT">
-<span class='line'>4903</span> </span><span class="NAME">RBTreeListIterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4904</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.pointer.previous</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4905</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4906</span> 
-<span class='line'>4907</span> </span><span class="COMM">/**
-<span class='line'>4908</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'>4909</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'>4910</span>  */</span><span class="WHIT">
-<span class='line'>4911</span> </span><span class="NAME">RBTreeListIterator.prototype.isDone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4912</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.pointer</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4913</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4914</span> 
-<span class='line'>4915</span> </span><span class="COMM">/**
-<span class='line'>4916</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'>4917</span>  * @return {*} The item stored or undefined if it's out of the bounds.
-<span class='line'>4918</span>  */</span><span class="WHIT">
-<span class='line'>4919</span> </span><span class="NAME">RBTreeListIterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4920</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer.item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4921</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4922</span> 
-<span class='line'>4923</span> </span><span class="COMM">/**
-<span class='line'>4924</span>  * Returns the node stored at the position pointed by the iterator.
-<span class='line'>4925</span>  * @abstract
-<span class='line'>4926</span>  * @return {RBNode|null} The node stored or null if it's out of the bounds.
-<span class='line'>4927</span>  */</span><span class="WHIT">
-<span class='line'>4928</span> </span><span class="NAME">RBTreeListIterator.prototype.getNode</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4929</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4930</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4931</span> 
-<span class='line'>4932</span> </span><span class="COMM">/**
-<span class='line'>4933</span>  * Class for managing a set.
-<span class='line'>4934</span>  * @constructor
-<span class='line'>4935</span>  */</span><span class="WHIT">
-<span class='line'>4936</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">Set</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>4937</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4938</span> 	 * The parents of the set.
-<span class='line'>4939</span> 	 * @type {DoubleLinkedList}
-<span class='line'>4940</span> 	 */</span><span class="WHIT">
-<span class='line'>4941</span> </span><span class="WHIT">	</span><span class="NAME">this.parents</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span
-        class="WHIT"> </span><span class="NAME">DoubleLinkedList</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4942</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4943</span> 	 * The elements stored.
-<span class='line'>4944</span> 	 * @type {DoubleLinkedList}
-<span class='line'>4945</span> 	 */</span><span class="WHIT">
-<span class='line'>4946</span> </span><span class="WHIT">	</span><span class="NAME">this.elements</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span
-        class="WHIT"> </span><span class="NAME">DoubleLinkedList</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4947</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4948</span> 	 * The subsets of this set.
-<span class='line'>4949</span> 	 * @type {DoubleLinkedList}
-<span class='line'>4950</span> 	 */</span><span class="WHIT">
-<span class='line'>4951</span> </span><span class="WHIT">	</span><span class="NAME">this.sets</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span
-        class="WHIT"> </span><span class="NAME">DoubleLinkedList</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4952</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>4953</span> 	 * The size of the set. It's equal to his cardinality.
-<span class='line'>4954</span> 	 * @type {number}
-<span class='line'>4955</span> 	 */</span><span class="WHIT">
-<span class='line'>4956</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4957</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4958</span> 
-<span class='line'>4959</span> </span><span class="COMM">/**
-<span class='line'>4960</span>  * Adds the element to the set.
-<span class='line'>4961</span>  * @param element {Element} The element to add.
-<span class='line'>4962</span>  * @return {void}
-<span class='line'>4963</span>  */</span><span class="WHIT">
-<span class='line'>4964</span> </span><span class="NAME">Set.prototype.insert</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">element</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4965</span> </span><span class="WHIT">	</span><span
-        class="NAME">this.elements.pushBack</span><span class="PUNC">(</span><span class="NAME">element</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4966</span> </span><span class="WHIT">	</span><span
-        class="NAME">element.parents.pushBack</span><span class="PUNC">(</span><span class="KEYW">this</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4967</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4968</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4969</span> 
-<span class='line'>4970</span> </span><span class="COMM">/**
-<span class='line'>4971</span>  * Adds the elements to the set.
-<span class='line'>4972</span>  * @param elements {Array&lt;Element>} The elements to add.
-<span class='line'>4973</span>  * @return {void}
-<span class='line'>4974</span>  */</span><span class="WHIT">
-<span class='line'>4975</span> </span><span class="NAME">Set.prototype.multiInsert</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">elements</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4976</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">elements.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4977</span> </span><span class="WHIT">		</span><span class="NAME">this.elements.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">elements</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4978</span> </span><span class="WHIT">		</span><span class="NAME">elements</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">parents.pushBack</span><span class="PUNC">(</span><span class="KEYW">this</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4979</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>4980</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">elements.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4981</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4982</span> 
-<span class='line'>4983</span> </span><span class="COMM">/**
-<span class='line'>4984</span>  * Returns the set that represents the union of two sets.
-<span class='line'>4985</span>  * @param set {Set} The set with make the union.
-<span class='line'>4986</span>  * @return {Set} The set that represents the union.
-<span class='line'>4987</span>  */</span><span class="WHIT">
-<span class='line'>4988</span> </span><span class="NAME">Set.prototype.union</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">set</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>4989</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span class="NAME">Set</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4990</span> </span><span class="WHIT">	</span><span class="NAME">parent.addSubsets</span><span
-        class="PUNC">(</span><span class="PUNC">[</span><span class="KEYW">this</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">set</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4991</span> </span><span class="WHIT">	</span><span class="NAME">this.parents.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">parent</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4992</span> </span><span class="WHIT">	</span><span class="NAME">set.parents.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">parent</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>4993</span> </span><span class="WHIT">	</span><span
-        class="COMM">//change the parent of the subset</span><span class="WHIT">
-<span class='line'>4994</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">that</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">this</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4995</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">f</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>4996</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">that</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>4997</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>4998</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>4999</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.sets.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5000</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5001</span> </span><span class="WHIT">		</span><span class="NAME">it.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">parents.execute</span><span class="PUNC">(</span><span class="NAME">f</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5002</span> </span><span class="WHIT">	</span><span class="NAME">f</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5003</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="WHIT"> </span><span
-        class="PUNC">===</span><span class="WHIT"> </span><span class="NAME">set</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>5004</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5005</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5006</span> </span><span class="WHIT">	</span><span class="NAME">it</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">set.sets.getIterator</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5007</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5008</span> </span><span class="WHIT">		</span><span class="NAME">it.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">parents.execute</span><span class="PUNC">(</span><span class="NAME">f</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5009</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">parent</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5010</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5011</span> 
-<span class='line'>5012</span> </span><span class="COMM">/**
-<span class='line'>5013</span>  * Returns the set that represents the intersection of two sets.
-<span class='line'>5014</span>  * @param set {Set} The set to intersect with this.
-<span class='line'>5015</span>  * @return {Set} The set that represents the intersection.
-<span class='line'>5016</span>  */</span><span class="WHIT">
-<span class='line'>5017</span> </span><span class="NAME">Set.prototype.intersect</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">set</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5018</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">intersection</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">Set</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5019</span> </span><span class="WHIT">	</span><span
-        class="COMM">//intersect this set with the set</span><span class="WHIT">
-<span class='line'>5020</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">el</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.elements.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5021</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">el.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">el.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">el.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5022</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">el.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">parents.contains</span><span class="PUNC">(</span><span class="NAME">set</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5023</span> </span><span class="WHIT">			</span><span
-        class="NAME">intersection.insert</span><span class="PUNC">(</span><span class="NAME">el.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5024</span> 
-<span class='line'>5025</span> </span><span class="WHIT">	</span><span class="COMM">//intersect the subsets with the set</span><span
-        class="WHIT">
-<span class='line'>5026</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.sets.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5027</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5028</span> </span><span class="WHIT">		</span><span class="NAME">el</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">it.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">getIterator</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5029</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">el.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">el.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">el.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5030</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">el.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">.</span><span
-        class="NAME">parents.contains</span><span class="PUNC">(</span><span class="NAME">set</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5031</span> </span><span class="WHIT">				</span><span
-        class="NAME">intersection.insert</span><span class="PUNC">(</span><span class="NAME">el.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5032</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>5033</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">intersection</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5034</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5035</span> 
-<span class='line'>5036</span> </span><span class="COMM">/**
-<span class='line'>5037</span>  * Returns the set that represents the difference of two sets.
-<span class='line'>5038</span>  * @param set {Set} The set to difference with this.
-<span class='line'>5039</span>  * @return {Set} The set that represents the difference.
-<span class='line'>5040</span>  */</span><span class="WHIT">
-<span class='line'>5041</span> </span><span class="NAME">Set.prototype.difference</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">set</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5042</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">diff</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span class="NAME">Set</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5043</span> </span><span class="WHIT">	</span><span
-        class="COMM">//intersect this set with the set</span><span class="WHIT">
-<span class='line'>5044</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">el</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.elements.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5045</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">el.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">el.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">el.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5046</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">el.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">parents.contains</span><span class="PUNC">(</span><span
-        class="NAME">set</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5047</span> </span><span class="WHIT">			</span><span class="NAME">diff.insert</span><span
-        class="PUNC">(</span><span class="NAME">el.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5048</span> 
-<span class='line'>5049</span> </span><span class="WHIT">	</span><span class="COMM">//intersect the subsets with the set</span><span
-        class="WHIT">
-<span class='line'>5050</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.sets.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5051</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5052</span> </span><span class="WHIT">		</span><span class="NAME">el</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">it.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">getIterator</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5053</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">el.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">el.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">el.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5054</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">el.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">parents.contains</span><span class="PUNC">(</span><span
-        class="NAME">set</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5055</span> </span><span class="WHIT">				</span><span
-        class="NAME">diff.insert</span><span class="PUNC">(</span><span class="NAME">el.getItem</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5056</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>5057</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">diff</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5058</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5059</span> 
-<span class='line'>5060</span> </span><span class="COMM">/**
-<span class='line'>5061</span>  * Returns the set that represents the cartesian product of two sets.
-<span class='line'>5062</span>  * @param set {Set} The set to make the cartesian product with this.
-<span class='line'>5063</span>  * @return {Set} The set that represents the cartesian product .
-<span class='line'>5064</span>  */</span><span class="WHIT">
-<span class='line'>5065</span> </span><span class="NAME">Set.prototype.cartesianProduct</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">set</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>5066</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">el1</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.getItems</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5067</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">el2</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">set.getItems</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5068</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">product</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">Set</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5069</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">el1.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5070</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">j</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">el2.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">j</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5071</span> </span><span class="WHIT">			</span><span
-        class="NAME">product.insert</span><span class="PUNC">(</span><span class="KEYW">new</span><span
-        class="WHIT"> </span><span class="NAME">Element</span><span class="PUNC">(</span><span
-        class="PUNC">[</span><span class="NAME">el1</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">el2</span><span
-        class="PUNC">[</span><span class="NAME">j</span><span class="PUNC">]</span><span class="PUNC">]</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5072</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">product</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5073</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5074</span> 
-<span class='line'>5075</span> </span><span class="COMM">/**
-<span class='line'>5076</span>  * Adds the subset.
-<span class='line'>5077</span>  * @param set {Set} The subset.
-<span class='line'>5078</span>  */</span><span class="WHIT">
-<span class='line'>5079</span> </span><span class="NAME">Set.prototype.addSubset</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">set</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5080</span> </span><span class="WHIT">	</span><span class="NAME">this.sets.pushBack</span><span
-        class="PUNC">(</span><span class="NAME">set</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5081</span> </span><span class="WHIT">	</span><span class="NAME">this.size</span><span
-        class="WHIT"> </span><span class="PUNC">+</span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">set.size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5082</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5083</span> 
-<span class='line'>5084</span> </span><span class="COMM">/**
-<span class='line'>5085</span>  * Adds the subsets.
-<span class='line'>5086</span>  * @param sets {Array&lt;Set>} The subsets.
-<span class='line'>5087</span>  */</span><span class="WHIT">
-<span class='line'>5088</span> </span><span class="NAME">Set.prototype.addSubsets</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">sets</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5089</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">sets.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5090</span> </span><span class="WHIT">		</span><span class="NAME">this.addSubset</span><span
-        class="PUNC">(</span><span class="NAME">sets</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5091</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5092</span> 
-<span class='line'>5093</span> </span><span class="COMM">/**
-<span class='line'>5094</span>  * Returns the items that are stored in the set.
-<span class='line'>5095</span>  * @return {Array} The items stored.
-<span class='line'>5096</span>  */</span><span class="WHIT">
-<span class='line'>5097</span> </span><span class="NAME">Set.prototype.getItems</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5098</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">array</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5099</span> </span><span class="WHIT">	</span><span
-        class="COMM">//get the items stored in the set</span><span class="WHIT">
-<span class='line'>5100</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">el</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.elements.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5101</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">el.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">el.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">el.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5102</span> </span><span class="WHIT">		</span><span class="NAME">array.push</span><span
-        class="PUNC">(</span><span class="NAME">el.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5103</span> 
-<span class='line'>5104</span> </span><span class="WHIT">	</span><span class="COMM">//get the items stored in the subsets</span><span
-        class="WHIT">
-<span class='line'>5105</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.sets.getIterator</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5106</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">it.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">it.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">it.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5107</span> </span><span class="WHIT">		</span><span class="NAME">el</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">it.getItem</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">.</span><span class="NAME">getIterator</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5108</span> </span><span class="WHIT">		</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">el.first</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="PUNC">!</span><span class="NAME">el.isDone</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">el.next</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5109</span> </span><span class="WHIT">			</span><span class="NAME">array.push</span><span
-        class="PUNC">(</span><span class="NAME">el.getItem</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">.</span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5110</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>5111</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">array</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5112</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5113</span> 
-<span class='line'>5114</span> </span><span class="COMM">/**
-<span class='line'>5115</span>  * Returns the cardinality of the set.
-<span class='line'>5116</span>  * @return {number} The cardinality of the set.
-<span class='line'>5117</span>  */</span><span class="WHIT">
-<span class='line'>5118</span> </span><span class="NAME">Set.prototype.getCardinality</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5119</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5120</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5121</span> 
-<span class='line'>5122</span> </span><span class="COMM">/**
-<span class='line'>5123</span>  * Checks if the set is empty.
-<span class='line'>5124</span>  * @return {boolean} True if the set is empty, false otherwise.
-<span class='line'>5125</span>  */</span><span class="WHIT">
-<span class='line'>5126</span> </span><span class="NAME">Set.prototype.isEmpty</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5127</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.size</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5128</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5129</span> 
-<span class='line'>5130</span> </span><span class="COMM">/**
-<span class='line'>5131</span>  * Clones the set into a new set.
-<span class='line'>5132</span>  * @return {Set} The set cloned from this set.
-<span class='line'>5133</span>  */</span><span class="WHIT">
-<span class='line'>5134</span> </span><span class="NAME">Set.prototype.clone</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5135</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">s</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span class="NAME">Set</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5136</span> </span><span class="WHIT">	</span><span class="NAME">s.parents</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.parents.clone</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5137</span> </span><span class="WHIT">	</span><span class="NAME">s.elements</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.elements.clone</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5138</span> </span><span class="WHIT">	</span><span class="NAME">s.sets</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.sets.clone</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5139</span> </span><span class="WHIT">	</span><span class="NAME">s.size</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.size</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5140</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">s</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5141</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5142</span> 
-<span class='line'>5143</span> </span><span class="COMM">/**
-<span class='line'>5144</span>  * Class for managing a stack.
-<span class='line'>5145</span>  * @param {...*} [args] The items for initializing the stack.
-<span class='line'>5146</span>  * @constructor
-<span class='line'>5147</span>  */</span><span class="WHIT">
-<span class='line'>5148</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">Stack</span><span
-        class="PUNC">(</span><span class="NAME">args</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5149</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>5150</span> 	 * The list of the items in the stack.
-<span class='line'>5151</span> 	 * @type {Array&lt;*>}
-<span class='line'>5152</span> 	 */</span><span class="WHIT">
-<span class='line'>5153</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5154</span> 
-<span class='line'>5155</span> </span><span class="WHIT">	</span><span class="COMM">//builds the stack from the parameters of the constructor</span><span
-        class="WHIT">
-<span class='line'>5156</span> </span><span class="WHIT">	</span><span class="NAME">this.multiPush</span><span
-        class="PUNC">(</span><span class="NAME">arguments</span><span class="PUNC">)</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5157</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>5158</span> 
-<span class='line'>5159</span> </span><span class="COMM">/**
-<span class='line'>5160</span>  * Returns the iterator relative to the aggregate.
-<span class='line'>5161</span>  * @return {Iterator} The iterator.
-<span class='line'>5162</span>  */</span><span class="WHIT">
-<span class='line'>5163</span> </span><span class="NAME">Stack.prototype.getIterator</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5164</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">StackIterator</span><span class="PUNC">(</span><span class="KEYW">this</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5165</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5166</span> 
-<span class='line'>5167</span> </span><span class="COMM">/**
-<span class='line'>5168</span>  * Adds the item at the top of the stack.
-<span class='line'>5169</span>  * @param item {*} The item to add.
-<span class='line'>5170</span>  * return {void}
-<span class='line'>5171</span>  */</span><span class="WHIT">
-<span class='line'>5172</span> </span><span class="NAME">Stack.prototype.push</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5173</span> </span><span class="WHIT">	</span><span class="NAME">this.items.push</span><span
-        class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5174</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5175</span> 
-<span class='line'>5176</span> </span><span class="COMM">/**
-<span class='line'>5177</span>  * Adds the items at the top of the stack.
-<span class='line'>5178</span>  * @param items {Array&lt;*>} The items to add.
-<span class='line'>5179</span>  * @return {void}
-<span class='line'>5180</span>  */</span><span class="WHIT">
-<span class='line'>5181</span> </span><span class="NAME">Stack.prototype.multiPush</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">items</span><span class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span
-        class="WHIT">
-<span class='line'>5182</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">items.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5183</span> </span><span class="WHIT">		</span><span class="NAME">this.push</span><span
-        class="PUNC">(</span><span class="NAME">items</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5184</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5185</span> 
-<span class='line'>5186</span> </span><span class="COMM">/**
-<span class='line'>5187</span>  * Removes the item at the top of the stack.
-<span class='line'>5188</span>  * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
-<span class='line'>5189</span>  */</span><span class="WHIT">
-<span class='line'>5190</span> </span><span class="NAME">Stack.prototype.pop</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5191</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">this.items.length</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5192</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5193</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items.pop</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5194</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5195</span> 
-<span class='line'>5196</span> </span><span class="COMM">/**
-<span class='line'>5197</span>  * Removes the more item at the top of the stack.
-<span class='line'>5198</span>  * @param times {number} The number of times to repeat the pop method.
-<span class='line'>5199</span>  * @return {Array&lt;*>} The items at the top of the stack.
-<span class='line'>5200</span>  */</span><span class="WHIT">
-<span class='line'>5201</span> </span><span class="NAME">Stack.prototype.multiPop</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">times</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5202</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5203</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span
-        class="NAME">times</span><span class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span
-        class="NAME">this.items.length</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">++</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5204</span> </span><span class="WHIT">		</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">this.pop</span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5205</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5206</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5207</span> 
-<span class='line'>5208</span> </span><span class="COMM">/**
-<span class='line'>5209</span>  * Returns the item at the top of the stack without remove it.
-<span class='line'>5210</span>  * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
-<span class='line'>5211</span>  */</span><span class="WHIT">
-<span class='line'>5212</span> </span><span class="NAME">Stack.prototype.peek</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5213</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">this.items.length</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5214</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5215</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span class="NAME">this.items.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5216</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5217</span> 
-<span class='line'>5218</span> </span><span class="COMM">/**
-<span class='line'>5219</span>  * Removes all the items stored in the stack.
-<span class='line'>5220</span>  * @return {void}
-<span class='line'>5221</span>  */</span><span class="WHIT">
-<span class='line'>5222</span> </span><span class="NAME">Stack.prototype.clear</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5223</span> </span><span class="WHIT">	</span><span class="NAME">this.items</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span
-        class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5224</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5225</span> 
-<span class='line'>5226</span> </span><span class="COMM">/**
-<span class='line'>5227</span>  * Checks if the stack contains an item that satisfy the condition represented by the callback function.
-<span class='line'>5228</span>  * @param item {*} The item to find.
-<span class='line'>5229</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>5230</span>  * @return {boolean} True if the stack contains the item that satisfy the condition, false otherwise.
-<span class='line'>5231</span>  */</span><span class="WHIT">
-<span class='line'>5232</span> </span><span class="NAME">Stack.prototype.contains</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5233</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5234</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5235</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5236</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5237</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="WHIT"> </span><span class="PUNC">&&</span><span class="WHIT"> </span><span class="PUNC">!</span><span
-        class="NAME">callback</span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5238</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5239</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">&lt;</span><span
-        class="WHIT"> </span><span class="NAME">this.items.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5240</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5241</span> 
-<span class='line'>5242</span> </span><span class="COMM">/**
-<span class='line'>5243</span>  * Executes the callback function for each item of the stack.
-<span class='line'>5244</span>  * This method modifies the stack so if you don't need to modify it you must return the same item of the array.
-<span class='line'>5245</span>  * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
-<span class='line'>5246</span>  * @return {void}
-<span class='line'>5247</span>  */</span><span class="WHIT">
-<span class='line'>5248</span> </span><span class="NAME">Stack.prototype.execute</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5249</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.items.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5250</span> </span><span class="WHIT">		</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5251</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5252</span> 
-<span class='line'>5253</span> </span><span class="COMM">/**
-<span class='line'>5254</span>  * Returns the item at the position index.
-<span class='line'>5255</span>  * @param index The position of the item.
-<span class='line'>5256</span>  * @return {*} The item at the position. It's undefined if index isn't in the stack bounds.
-<span class='line'>5257</span>  */</span><span class="WHIT">
-<span class='line'>5258</span> </span><span class="NAME">Stack.prototype.getItem</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5259</span> </span><span class="WHIT">	</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">index</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5260</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">undefined</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5261</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">index</span><span class="PUNC">]</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5262</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5263</span> 
-<span class='line'>5264</span> </span><span class="COMM">/**
-<span class='line'>5265</span>  * Returns the length of the stack.
-<span class='line'>5266</span>  * @return {Number} The length of the stack.
-<span class='line'>5267</span>  */</span><span class="WHIT">
-<span class='line'>5268</span> </span><span class="NAME">Stack.prototype.getLength</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5269</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.items.length</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5270</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5271</span> 
-<span class='line'>5272</span> </span><span class="COMM">/**
-<span class='line'>5273</span>  * Checks if the stack is empty.
-<span class='line'>5274</span>  * @return {boolean} True if the stack is empty, false otherwise.
-<span class='line'>5275</span>  */</span><span class="WHIT">
-<span class='line'>5276</span> </span><span class="NAME">Stack.prototype.isEmpty</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5277</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">!</span><span class="NAME">this.items.length</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5278</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5279</span> 
-<span class='line'>5280</span> </span><span class="COMM">/**
-<span class='line'>5281</span>  * Returns the items that satisfy the condition determined by the callback.
-<span class='line'>5282</span>  * @param callback {function} The function that implements the condition.
-<span class='line'>5283</span>  * @return {Array&lt;*>} The array that contains the items that satisfy the condition.
-<span class='line'>5284</span>  */</span><span class="WHIT">
-<span class='line'>5285</span> </span><span class="NAME">Stack.prototype.filter</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5286</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5287</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">this.items.length</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="PUNC">--</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5288</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>5289</span> </span><span class="WHIT">			</span><span class="NAME">result.push</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5290</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>5291</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">result</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5292</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5293</span> 
-<span class='line'>5294</span> </span><span class="COMM">/**
-<span class='line'>5295</span>  * Returns the first position of the item in the stack.
-<span class='line'>5296</span>  * @param item {*} The item to search.
-<span class='line'>5297</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>5298</span>  * @return {number} The first position of the item.
-<span class='line'>5299</span>  */</span><span class="WHIT">
-<span class='line'>5300</span> </span><span class="NAME">Stack.prototype.indexOf</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span class="PUNC">,</span><span
-        class="WHIT"> </span><span class="NAME">callback</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5301</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5302</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5303</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5304</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5305</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5306</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>5307</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5308</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5309</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>5310</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5311</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5312</span> 
-<span class='line'>5313</span> </span><span class="COMM">/**
-<span class='line'>5314</span>  * Returns the last position of the item in the stack.
-<span class='line'>5315</span>  * @param item {*} The item to search.
-<span class='line'>5316</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>5317</span>  * @return {number} The last position of the item.
-<span class='line'>5318</span>  */</span><span class="WHIT">
-<span class='line'>5319</span> </span><span class="NAME">Stack.prototype.lastIndexOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5320</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5321</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5322</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5323</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5324</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5325</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>5326</span> </span><span class="WHIT">			</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5327</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5328</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>5329</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5330</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5331</span> 
-<span class='line'>5332</span> </span><span class="COMM">/**
-<span class='line'>5333</span>  * Returns all the position in which the item has been found in the stack.
-<span class='line'>5334</span>  * @param item {*} The item to search.
-<span class='line'>5335</span>  * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
-<span class='line'>5336</span>  * @return {Array&lt;number>} The positions in which the item has been found.
-<span class='line'>5337</span>  */</span><span class="WHIT">
-<span class='line'>5338</span> </span><span class="NAME">Stack.prototype.allIndexesOf</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">item</span><span
-        class="PUNC">,</span><span class="WHIT"> </span><span class="NAME">callback</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5339</span> </span><span class="WHIT">	</span><span class="NAME">callback</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">callback</span><span class="WHIT"> </span><span class="PUNC">||</span><span
-        class="WHIT"> </span><span class="KEYW">function</span><span class="WHIT"> </span><span
-        class="PUNC">(</span><span class="NAME">it</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5340</span> </span><span class="WHIT">		</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">it</span><span class="WHIT"> </span><span class="PUNC">===</span><span
-        class="WHIT"> </span><span class="NAME">item</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5341</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5342</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="NAME">this.items.length</span><span class="WHIT"> </span><span
-        class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5343</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">[</span><span class="PUNC">]</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5344</span> </span><span class="WHIT">	</span><span class="KEYW">while</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">i</span><span class="WHIT"> </span><span
-        class="PUNC">></span><span class="WHIT"> </span><span class="PUNC">-</span><span class="NUMB">1</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5345</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">callback</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>5346</span> </span><span class="WHIT">			</span><span class="NAME">indexes.push</span><span
-        class="PUNC">(</span><span class="NAME">i</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5347</span> </span><span class="WHIT">		</span><span class="NAME">i</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5348</span> </span><span class="WHIT">	</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>5349</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">indexes</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5350</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5351</span> 
-<span class='line'>5352</span> </span><span class="COMM">/**
-<span class='line'>5353</span>  * Clones the stack into a new stack.
-<span class='line'>5354</span>  * @return {Stack} The stack cloned from this stack.
-<span class='line'>5355</span>  */</span><span class="WHIT">
-<span class='line'>5356</span> </span><span class="NAME">Stack.prototype.clone</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5357</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">stack</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">Stack</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5358</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5359</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">clone</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5360</span> </span><span class="WHIT">			</span><span class="NAME">stack.push</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">clone</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5361</span> </span><span class="WHIT">		</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>5362</span> </span><span class="WHIT">			</span><span class="NAME">stack.push</span><span
-        class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5363</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">stack</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5364</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5365</span> 
-<span class='line'>5366</span> </span><span class="COMM">/**
-<span class='line'>5367</span>  * Clones the stack into a new stack without cloning duplicated items.
-<span class='line'>5368</span>  * @return {Stack} The stack cloned from this stack.
-<span class='line'>5369</span>  */</span><span class="WHIT">
-<span class='line'>5370</span> </span><span class="NAME">Stack.prototype.cloneDistinct</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5371</span> </span><span class="WHIT">	</span><span class="KEYW">var</span><span
-        class="WHIT"> </span><span class="NAME">stack</span><span class="WHIT"> </span><span class="PUNC">=</span><span
-        class="WHIT"> </span><span class="KEYW">new</span><span class="WHIT"> </span><span
-        class="NAME">Stack</span><span class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5372</span> </span><span class="WHIT">	</span><span class="KEYW">for</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="KEYW">var</span><span class="WHIT"> </span><span
-        class="NAME">i</span><span class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NUMB">0</span><span class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span
-        class="WHIT"> </span><span class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NAME">this.items.length</span><span
-        class="PUNC">;</span><span class="WHIT"> </span><span class="NAME">i</span><span class="PUNC">++</span><span
-        class="PUNC">)</span><span class="WHIT">
-<span class='line'>5373</span> </span><span class="WHIT">		</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">!</span><span
-        class="NAME">stack.contains</span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5374</span> </span><span class="WHIT">			</span><span class="KEYW">if</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="NAME">this.items</span><span
-        class="PUNC">[</span><span class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">cloneDistinct</span><span class="PUNC">)</span><span class="WHIT">
-<span class='line'>5375</span> </span><span class="WHIT">				</span><span
-        class="NAME">stack.push</span><span class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span
-        class="NAME">cloneDistinct</span><span class="PUNC">(</span><span class="PUNC">)</span><span
-        class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5376</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT"> </span><span class="KEYW">if</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="NAME">this.items</span><span class="PUNC">[</span><span class="NAME">i</span><span
-        class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">clone</span><span class="PUNC">)</span><span
-        class="WHIT">
-<span class='line'>5377</span> </span><span class="WHIT">				</span><span
-        class="NAME">stack.push</span><span class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">.</span><span class="NAME">clone</span><span
-        class="PUNC">(</span><span class="PUNC">)</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5378</span> </span><span class="WHIT">			</span><span class="KEYW">else</span><span
-        class="WHIT">
-<span class='line'>5379</span> </span><span class="WHIT">				</span><span
-        class="NAME">stack.push</span><span class="PUNC">(</span><span class="NAME">this.items</span><span class="PUNC">[</span><span
-        class="NAME">i</span><span class="PUNC">]</span><span class="PUNC">)</span><span class="PUNC">;</span><span
-        class="WHIT">
-<span class='line'>5380</span> </span><span class="WHIT">		</span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>5381</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">stack</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5382</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5383</span> 
-<span class='line'>5384</span> </span><span class="COMM">/**
-<span class='line'>5385</span>  * Class that implements the iterator for a linked list.
-<span class='line'>5386</span>  * @param aggregate {Stack} The aggregate to scan.
-<span class='line'>5387</span>  * @constructor
-<span class='line'>5388</span>  */</span><span class="WHIT">
-<span class='line'>5389</span> </span><span class="KEYW">function</span><span class="WHIT"> </span><span class="NAME">StackIterator</span><span
-        class="PUNC">(</span><span class="NAME">aggregate</span><span class="PUNC">)</span><span
-        class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5390</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>5391</span> 	 * The aggregate relates to this iterator.
-<span class='line'>5392</span> 	 * @type {Stack}
-<span class='line'>5393</span> 	 */</span><span class="WHIT">
-<span class='line'>5394</span> </span><span class="WHIT">	</span><span class="NAME">this.aggregate</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="NAME">aggregate</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5395</span> 
-<span class='line'>5396</span> </span><span class="WHIT">	</span><span class="COMM">/**
-<span class='line'>5397</span> 	 * The pointer to the position.
-<span class='line'>5398</span> 	 * @type {number}
-<span class='line'>5399</span> 	 */</span><span class="WHIT">
-<span class='line'>5400</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="PUNC">-</span><span
-        class="NUMB">1</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5401</span> </span><span class="PUNC">}</span><span class="WHIT">
-<span class='line'>5402</span> 
-<span class='line'>5403</span> </span><span class="COMM">/**
-<span class='line'>5404</span>  * Moves the iterator to the first position of the aggregate.
-<span class='line'>5405</span>  * @return {void}
-<span class='line'>5406</span>  */</span><span class="WHIT">
-<span class='line'>5407</span> </span><span class="NAME">StackIterator.prototype.first</span><span class="WHIT"> </span><span
-        class="PUNC">=</span><span class="WHIT"> </span><span class="KEYW">function</span><span
-        class="WHIT"> </span><span class="PUNC">(</span><span class="PUNC">)</span><span class="WHIT"> </span><span
-        class="PUNC">{</span><span class="WHIT">
-<span class='line'>5408</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NAME">this.aggregate.items.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5409</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5410</span> 
-<span class='line'>5411</span> </span><span class="COMM">/**
-<span class='line'>5412</span>  * Moves the iterator to the next item.
-<span class='line'>5413</span>  * @return {void}
-<span class='line'>5414</span>  */</span><span class="WHIT">
-<span class='line'>5415</span> </span><span class="NAME">StackIterator.prototype.next</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5416</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="PUNC">--</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5417</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5418</span> 
-<span class='line'>5419</span> </span><span class="COMM">/**
-<span class='line'>5420</span>  * Moves the iterator to the last position of the aggregate.
-<span class='line'>5421</span>  * @return {void}
-<span class='line'>5422</span>  */</span><span class="WHIT">
-<span class='line'>5423</span> </span><span class="NAME">StackIterator.prototype.last</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5424</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span class="NUMB">0</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5425</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5426</span> 
-<span class='line'>5427</span> </span><span class="COMM">/**
-<span class='line'>5428</span>  * Moves the iterator to the previous item.
-<span class='line'>5429</span>  * @return {void}
-<span class='line'>5430</span>  */</span><span class="WHIT">
-<span class='line'>5431</span> </span><span class="NAME">StackIterator.prototype.previous</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5432</span> </span><span class="WHIT">	</span><span class="NAME">this.pointer</span><span
-        class="PUNC">++</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5433</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5434</span> 
-<span class='line'>5435</span> </span><span class="COMM">/**
-<span class='line'>5436</span>  * Checks if the iterator is out of the bounds of the aggregate.
-<span class='line'>5437</span>  * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
-<span class='line'>5438</span>  */</span><span class="WHIT">
-<span class='line'>5439</span> </span><span class="NAME">StackIterator.prototype.isDone</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5440</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.pointer</span><span class="WHIT"> </span><span
-        class="PUNC">&lt;</span><span class="WHIT"> </span><span class="NUMB">0</span><span class="WHIT"> </span><span
-        class="PUNC">||</span><span class="WHIT"> </span><span class="NAME">this.pointer</span><span
-        class="WHIT"> </span><span class="PUNC">></span><span class="WHIT"> </span><span class="NAME">this.aggregate.items.length</span><span
-        class="WHIT"> </span><span class="PUNC">-</span><span class="WHIT"> </span><span class="NUMB">1</span><span
-        class="PUNC">;</span><span class="WHIT">
-<span class='line'>5441</span> </span><span class="PUNC">}</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5442</span> 
-<span class='line'>5443</span> </span><span class="COMM">/**
-<span class='line'>5444</span>  * Returns the item stored at the position pointed by the iterator.
-<span class='line'>5445</span>  * @return {*} The item stored or undefined if it's out of the bounds.
-<span class='line'>5446</span>  */</span><span class="WHIT">
-<span class='line'>5447</span> </span><span class="NAME">StackIterator.prototype.getItem</span><span
-        class="WHIT"> </span><span class="PUNC">=</span><span class="WHIT"> </span><span
-        class="KEYW">function</span><span class="WHIT"> </span><span class="PUNC">(</span><span
-        class="PUNC">)</span><span class="WHIT"> </span><span class="PUNC">{</span><span class="WHIT">
-<span class='line'>5448</span> </span><span class="WHIT">	</span><span class="KEYW">return</span><span
-        class="WHIT"> </span><span class="NAME">this.aggregate.getItem</span><span class="PUNC">(</span><span
-        class="NAME">this.pointer</span><span class="PUNC">)</span><span class="PUNC">;</span><span class="WHIT">
-<span class='line'>5449</span> </span><span class="PUNC">}</span><span class="PUNC">;</span></pre>
-</body>
-</html>
\ No newline at end of file
diff --git a/fonts/OpenSans-Bold-webfont.eot b/fonts/OpenSans-Bold-webfont.eot
new file mode 100644
index 0000000..e1c7674
Binary files /dev/null and b/fonts/OpenSans-Bold-webfont.eot differ
diff --git a/fonts/OpenSans-Bold-webfont.svg b/fonts/OpenSans-Bold-webfont.svg
new file mode 100644
index 0000000..364b368
--- /dev/null
+++ b/fonts/OpenSans-Bold-webfont.svg
@@ -0,0 +1,146 @@
+<?xml version="1.0" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
+<svg xmlns="http://www.w3.org/2000/svg">
+<metadata>
+This is a custom SVG webfont generated by Font Squirrel.
+Copyright   : Digitized data copyright  20102011 Google Corporation
+Foundry     : Ascender Corporation
+Foundry URL : httpwwwascendercorpcom
+</metadata>
+<defs>
+<font id="OpenSansBold" horiz-adv-x="1169" >
+<font-face units-per-em="2048" ascent="1638" descent="-410" />
+<missing-glyph horiz-adv-x="532" />
+<glyph unicode=" "  horiz-adv-x="532" />
+<glyph unicode="&#x09;" horiz-adv-x="532" />
+<glyph unicode="&#xa0;" horiz-adv-x="532" />
+<glyph unicode="!" horiz-adv-x="586" d="M117 143q0 84 45 127t131 43q83 0 128.5 -44t45.5 -126q0 -79 -46 -124.5t-128 -45.5q-84 0 -130 44.5t-46 125.5zM121 1462h346l-51 -977h-244z" />
+<glyph unicode="&#x22;" horiz-adv-x="967" d="M133 1462h279l-41 -528h-197zM555 1462h279l-41 -528h-197z" />
+<glyph unicode="#" horiz-adv-x="1323" d="M45 406v206h277l47 232h-252v209h289l77 407h219l-77 -407h198l78 407h215l-78 -407h240v-209h-279l-47 -232h258v-206h-297l-77 -406h-220l78 406h-194l-76 -406h-215l74 406h-238zM539 612h196l47 232h-196z" />
+<glyph unicode="$" d="M88 1049q0 145 113.5 238.5t316.5 113.5v153h137v-149q229 -10 414 -92l-94 -234q-156 64 -320 78v-295q195 -75 277.5 -130t121 -121t38.5 -154q0 -159 -115 -255.5t-322 -115.5v-205h-137v201q-244 5 -428 86v264q87 -43 209.5 -76t218.5 -39v310l-67 26 q-198 78 -280.5 169.5t-82.5 226.5zM389 1049q0 -44 30.5 -72.5t98.5 -58.5v235q-129 -19 -129 -104zM655 324q136 23 136 118q0 42 -34 71t-102 60v-249z" />
+<glyph unicode="%" horiz-adv-x="1845" d="M63 1026q0 457 345 457q169 0 259.5 -118.5t90.5 -338.5q0 -230 -89 -345.5t-261 -115.5q-165 0 -255 118.5t-90 342.5zM315 1024q0 -127 22.5 -189.5t72.5 -62.5q96 0 96 252q0 250 -96 250q-50 0 -72.5 -61.5t-22.5 -188.5zM395 0l811 1462h240l-811 -1462h-240z M1087 442q0 457 345 457q169 0 259.5 -118.5t90.5 -338.5q0 -229 -89 -344.5t-261 -115.5q-165 0 -255 118.5t-90 341.5zM1339 440q0 -127 22.5 -189.5t72.5 -62.5q96 0 96 252q0 250 -96 250q-50 0 -72.5 -61.5t-22.5 -188.5z" />
+<glyph unicode="&#x26;" horiz-adv-x="1536" d="M82 395q0 137 60.5 233.5t207.5 180.5q-75 86 -109 164.5t-34 171.5q0 152 116.5 245t311.5 93q186 0 297.5 -86.5t111.5 -231.5q0 -119 -69 -217.5t-223 -187.5l284 -277q71 117 123 301h318q-36 -135 -99 -263.5t-143 -227.5l301 -293h-377l-115 113 q-191 -133 -432 -133q-244 0 -387 112t-143 303zM403 424q0 -86 64.5 -137t165.5 -51q126 0 227 61l-332 330q-58 -44 -91.5 -92t-33.5 -111zM489 1124q0 -88 95 -194q86 48 132 94.5t46 108.5q0 53 -36 83.5t-93 30.5q-67 0 -105.5 -32t-38.5 -91z" />
+<glyph unicode="'" horiz-adv-x="545" d="M133 1462h279l-41 -528h-197z" />
+<glyph unicode="(" horiz-adv-x="694" d="M82 561q0 265 77.5 496t223.5 405h250q-141 -193 -213 -424t-72 -475q0 -245 73.5 -473.5t209.5 -413.5h-248q-147 170 -224 397t-77 488z" />
+<glyph unicode=")" horiz-adv-x="694" d="M61 1462h250q147 -175 224 -406.5t77 -494.5t-77.5 -490t-223.5 -395h-248q135 184 209 412.5t74 474.5q0 244 -72 475t-213 424z" />
+<glyph unicode="*" horiz-adv-x="1116" d="M63 1042l39 250l365 -104l-41 368h262l-41 -368l373 104l33 -252l-340 -24l223 -297l-227 -121l-156 313l-137 -311l-236 119l221 297z" />
+<glyph unicode="+" d="M88 612v219h387v390h219v-390h387v-219h-387v-385h-219v385h-387z" />
+<glyph unicode="," horiz-adv-x="594" d="M63 -264q65 266 101 502h280l15 -23q-52 -202 -176 -479h-220z" />
+<glyph unicode="-" horiz-adv-x="659" d="M61 424v250h537v-250h-537z" />
+<glyph unicode="." horiz-adv-x="584" d="M117 143q0 84 45 127t131 43q83 0 128.5 -44t45.5 -126q0 -79 -46 -124.5t-128 -45.5q-84 0 -130 44.5t-46 125.5z" />
+<glyph unicode="/" horiz-adv-x="846" d="M14 0l545 1462h277l-545 -1462h-277z" />
+<glyph unicode="0" d="M74 731q0 387 125 570.5t385 183.5q253 0 382.5 -192t129.5 -562q0 -383 -125.5 -567t-386.5 -184q-253 0 -381.5 190t-128.5 561zM381 731q0 -269 46.5 -385.5t156.5 -116.5q108 0 156 118t48 384q0 269 -48.5 386.5t-155.5 117.5q-109 0 -156 -117.5t-47 -386.5z" />
+<glyph unicode="1" d="M121 1087l471 375h254v-1462h-309v846l3 139l5 152q-77 -77 -107 -101l-168 -135z" />
+<glyph unicode="2" d="M78 1274q108 92 179 130t155 58.5t188 20.5q137 0 242 -50t163 -140t58 -206q0 -101 -35.5 -189.5t-110 -181.5t-262.5 -265l-188 -177v-14h637v-260h-1022v215l367 371q163 167 213 231.5t72 119.5t22 114q0 88 -48.5 131t-129.5 43q-85 0 -165 -39t-167 -111z" />
+<glyph unicode="3" d="M78 59v263q85 -43 187 -70t202 -27q153 0 226 52t73 167q0 103 -84 146t-268 43h-111v237h113q170 0 248.5 44.5t78.5 152.5q0 166 -208 166q-72 0 -146.5 -24t-165.5 -83l-143 213q200 144 477 144q227 0 358.5 -92t131.5 -256q0 -137 -83 -233t-233 -132v-6 q177 -22 268 -107.5t91 -230.5q0 -211 -153 -328.5t-437 -117.5q-238 0 -422 79z" />
+<glyph unicode="4" d="M35 303v215l641 944h285v-919h176v-240h-176v-303h-302v303h-624zM307 543h352v248q0 62 5 180t8 137h-8q-37 -82 -89 -160z" />
+<glyph unicode="5" d="M100 59v267q79 -42 184 -68.5t199 -26.5q283 0 283 232q0 221 -293 221q-53 0 -117 -10.5t-104 -22.5l-123 66l55 745h793v-262h-522l-27 -287l35 7q61 14 151 14q212 0 337.5 -119t125.5 -326q0 -245 -151 -377t-432 -132q-244 0 -394 79z" />
+<glyph unicode="6" d="M72 621q0 434 183.5 646t549.5 212q125 0 196 -15v-247q-89 20 -176 20q-159 0 -259.5 -48t-150.5 -142t-59 -267h13q99 170 317 170q196 0 307 -123t111 -340q0 -234 -132 -370.5t-366 -136.5q-162 0 -282.5 75t-186 219t-65.5 347zM379 510q0 -119 62.5 -201t158.5 -82 q99 0 152 66.5t53 189.5q0 107 -49.5 168.5t-149.5 61.5q-94 0 -160.5 -61t-66.5 -142z" />
+<glyph unicode="7" d="M55 1200v260h1049v-194l-553 -1266h-324l549 1200h-721z" />
+<glyph unicode="8" d="M72 371q0 125 66.5 222t213.5 171q-125 79 -180 169t-55 197q0 157 130 254t339 97q210 0 338.5 -95.5t128.5 -257.5q0 -112 -62 -199.5t-200 -156.5q164 -88 235.5 -183.5t71.5 -209.5q0 -180 -141 -289.5t-371 -109.5q-240 0 -377 102t-137 289zM358 389q0 -86 60 -134 t164 -48q115 0 172 49.5t57 130.5q0 67 -56.5 125.5t-183.5 124.5q-213 -98 -213 -248zM408 1106q0 -60 38.5 -107.5t139.5 -97.5q98 46 137 94t39 111q0 69 -50 109t-128 40q-79 0 -127.5 -40.5t-48.5 -108.5z" />
+<glyph unicode="9" d="M66 971q0 235 133.5 371.5t363.5 136.5q162 0 283.5 -76t186.5 -220.5t65 -344.5q0 -432 -182 -645t-551 -213q-130 0 -197 14v248q84 -21 176 -21q155 0 255 45.5t153 143t61 268.5h-12q-58 -94 -134 -132t-190 -38q-191 0 -301 122.5t-110 340.5zM365 975 q0 -106 49 -168t149 -62q94 0 161 61.5t67 141.5q0 119 -62.5 201t-159.5 82q-96 0 -150 -66t-54 -190z" />
+<glyph unicode=":" horiz-adv-x="584" d="M117 143q0 84 45 127t131 43q83 0 128.5 -44t45.5 -126q0 -79 -46 -124.5t-128 -45.5q-84 0 -130 44.5t-46 125.5zM117 969q0 84 45 127t131 43q83 0 128.5 -44t45.5 -126q0 -81 -46.5 -125.5t-127.5 -44.5q-84 0 -130 44t-46 126z" />
+<glyph unicode=";" horiz-adv-x="594" d="M63 -264q65 266 101 502h280l15 -23q-52 -202 -176 -479h-220zM117 969q0 84 45 127t131 43q83 0 128.5 -44t45.5 -126q0 -81 -46.5 -125.5t-127.5 -44.5q-84 0 -130 44t-46 126z" />
+<glyph unicode="&#x3c;" d="M88 641v143l993 496v-240l-684 -317l684 -281v-239z" />
+<glyph unicode="=" d="M88 418v219h993v-219h-993zM88 805v219h993v-219h-993z" />
+<glyph unicode="&#x3e;" d="M88 203v239l684 281l-684 317v240l993 -496v-143z" />
+<glyph unicode="?" horiz-adv-x="977" d="M6 1358q223 125 473 125q206 0 327.5 -99t121.5 -264q0 -110 -50 -190t-190 -180q-96 -71 -121.5 -108t-25.5 -97v-60h-265v74q0 96 41 167t150 151q105 75 138.5 122t33.5 105q0 65 -48 99t-134 34q-150 0 -342 -98zM244 143q0 84 45 127t131 43q83 0 128.5 -44 t45.5 -126q0 -79 -46 -124.5t-128 -45.5q-84 0 -130 44.5t-46 125.5z" />
+<glyph unicode="@" horiz-adv-x="1837" d="M102 602q0 247 108.5 448.5t309 316t461.5 114.5q220 0 393 -90t267 -256t94 -383q0 -144 -46 -263.5t-130 -187.5t-195 -68q-74 0 -131 35.5t-82 93.5h-16q-108 -129 -275 -129q-177 0 -279 106.5t-102 291.5q0 211 134 340t350 129q86 0 189.5 -16.5t170.5 -39.5 l-23 -489q0 -139 76 -139q64 0 102 93.5t38 244.5q0 161 -67 284.5t-188.5 188.5t-277.5 65q-202 0 -351 -83t-228.5 -239.5t-79.5 -361.5q0 -276 147.5 -423.5t427.5 -147.5q106 0 233 23.5t250 68.5v-192q-214 -91 -475 -91q-380 0 -592.5 200t-212.5 556zM711 627 q0 -211 172 -211q90 0 137 63.5t57 206.5l13 221q-51 11 -115 11q-125 0 -194.5 -78t-69.5 -213z" />
+<glyph unicode="A" horiz-adv-x="1413" d="M0 0l516 1468h379l518 -1468h-334l-106 348h-533l-106 -348h-334zM518 608h381q-147 473 -165.5 535t-26.5 98q-33 -128 -189 -633z" />
+<glyph unicode="B" horiz-adv-x="1376" d="M184 0v1462h455q311 0 451.5 -88.5t140.5 -281.5q0 -131 -61.5 -215t-163.5 -101v-10q139 -31 200.5 -116t61.5 -226q0 -200 -144.5 -312t-392.5 -112h-547zM494 256h202q128 0 189 49t61 150q0 182 -260 182h-192v-381zM494 883h180q126 0 182.5 39t56.5 129 q0 84 -61.5 120.5t-194.5 36.5h-163v-325z" />
+<glyph unicode="C" horiz-adv-x="1305" d="M119 729q0 228 83 399.5t238.5 263t364.5 91.5q213 0 428 -103l-100 -252q-82 39 -165 68t-163 29q-175 0 -271 -131.5t-96 -366.5q0 -489 367 -489q154 0 373 77v-260q-180 -75 -402 -75q-319 0 -488 193.5t-169 555.5z" />
+<glyph unicode="D" horiz-adv-x="1516" d="M184 0v1462h459q358 0 556 -189t198 -528q0 -361 -205.5 -553t-593.5 -192h-414zM494 256h133q448 0 448 481q0 471 -416 471h-165v-952z" />
+<glyph unicode="E" horiz-adv-x="1147" d="M184 0v1462h842v-254h-532v-321h495v-254h-495v-377h532v-256h-842z" />
+<glyph unicode="F" horiz-adv-x="1124" d="M184 0v1462h838v-254h-533v-377h496v-253h-496v-578h-305z" />
+<glyph unicode="G" horiz-adv-x="1483" d="M119 733q0 354 202.5 552t561.5 198q225 0 434 -90l-103 -248q-160 80 -333 80q-201 0 -322 -135t-121 -363q0 -238 97.5 -363.5t283.5 -125.5q97 0 197 20v305h-277v258h580v-758q-141 -46 -265.5 -64.5t-254.5 -18.5q-331 0 -505.5 194.5t-174.5 558.5z" />
+<glyph unicode="H" horiz-adv-x="1567" d="M184 0v1462h310v-573h579v573h309v-1462h-309v631h-579v-631h-310z" />
+<glyph unicode="I" horiz-adv-x="678" d="M184 0v1462h310v-1462h-310z" />
+<glyph unicode="J" horiz-adv-x="678" d="M-152 -150q80 -20 146 -20q102 0 146 63.5t44 198.5v1370h310v-1368q0 -256 -117 -390t-346 -134q-105 0 -183 22v258z" />
+<glyph unicode="K" horiz-adv-x="1360" d="M184 0v1462h310v-669l122 172l396 497h344l-510 -647l514 -815h-352l-383 616l-131 -94v-522h-310z" />
+<glyph unicode="L" horiz-adv-x="1157" d="M184 0v1462h310v-1206h593v-256h-903z" />
+<glyph unicode="M" horiz-adv-x="1931" d="M184 0v1462h422l346 -1118h6l367 1118h422v-1462h-289v692q0 49 1.5 113t13.5 340h-9l-377 -1145h-284l-352 1147h-9q19 -350 19 -467v-680h-277z" />
+<glyph unicode="N" horiz-adv-x="1665" d="M184 0v1462h391l635 -1095h7q-15 285 -15 403v692h279v-1462h-394l-636 1106h-9q19 -293 19 -418v-688h-277z" />
+<glyph unicode="O" horiz-adv-x="1630" d="M119 735q0 365 180.5 557.5t517.5 192.5t515.5 -194t178.5 -558q0 -363 -180 -558t-516 -195t-516 195t-180 560zM444 733q0 -245 93 -369t278 -124q371 0 371 493q0 494 -369 494q-185 0 -279 -124.5t-94 -369.5z" />
+<glyph unicode="P" horiz-adv-x="1286" d="M184 0v1462h467q266 0 404.5 -114.5t138.5 -341.5q0 -236 -147.5 -361t-419.5 -125h-133v-520h-310zM494 774h102q143 0 214 56.5t71 164.5q0 109 -59.5 161t-186.5 52h-141v-434z" />
+<glyph unicode="Q" horiz-adv-x="1630" d="M119 735q0 365 180.5 557.5t517.5 192.5t515.5 -194t178.5 -558q0 -258 -91.5 -432.5t-268.5 -255.5l352 -393h-397l-268 328h-23q-336 0 -516 195t-180 560zM444 733q0 -245 93 -369t278 -124q371 0 371 493q0 494 -369 494q-185 0 -279 -124.5t-94 -369.5z" />
+<glyph unicode="R" horiz-adv-x="1352" d="M184 0v1462h426q298 0 441 -108.5t143 -329.5q0 -129 -71 -229.5t-201 -157.5q330 -493 430 -637h-344l-349 561h-165v-561h-310zM494 813h100q147 0 217 49t70 154q0 104 -71.5 148t-221.5 44h-94v-395z" />
+<glyph unicode="S" horiz-adv-x="1128" d="M94 68v288q148 -66 250.5 -93t187.5 -27q102 0 156.5 39t54.5 116q0 43 -24 76.5t-70.5 64.5t-189.5 99q-134 63 -201 121t-107 135t-40 180q0 194 131.5 305t363.5 111q114 0 217.5 -27t216.5 -76l-100 -241q-117 48 -193.5 67t-150.5 19q-88 0 -135 -41t-47 -107 q0 -41 19 -71.5t60.5 -59t196.5 -102.5q205 -98 281 -196.5t76 -241.5q0 -198 -142.5 -312t-396.5 -114q-234 0 -414 88z" />
+<glyph unicode="T" horiz-adv-x="1186" d="M41 1204v258h1104v-258h-397v-1204h-310v1204h-397z" />
+<glyph unicode="U" horiz-adv-x="1548" d="M174 520v942h309v-895q0 -169 68 -248t225 -79q152 0 220.5 79.5t68.5 249.5v893h309v-946q0 -162 -72.5 -284t-209.5 -187t-324 -65q-282 0 -438 144.5t-156 395.5z" />
+<glyph unicode="V" horiz-adv-x="1331" d="M0 1462h313l275 -870q23 -77 47.5 -179.5t30.5 -142.5q11 92 75 322l277 870h313l-497 -1462h-338z" />
+<glyph unicode="W" horiz-adv-x="1980" d="M0 1462h305l187 -798q49 -221 71 -383q6 57 27.5 176.5t40.5 185.5l213 819h293l213 -819q14 -55 35 -168t32 -194q10 78 32 194.5t40 188.5l186 798h305l-372 -1462h-353l-198 768q-11 41 -37.5 169.5t-30.5 172.5q-6 -54 -30 -173.5t-37 -170.5l-197 -766h-352z" />
+<glyph unicode="X" horiz-adv-x="1366" d="M0 0l485 754l-454 708h342l315 -526l309 526h334l-459 -725l494 -737h-354l-340 553l-340 -553h-332z" />
+<glyph unicode="Y" horiz-adv-x="1278" d="M0 1462h336l303 -602l305 602h334l-485 -893v-569h-308v559z" />
+<glyph unicode="Z" horiz-adv-x="1186" d="M49 0v201l701 1005h-682v256h1050v-200l-700 -1006h719v-256h-1088z" />
+<glyph unicode="[" horiz-adv-x="678" d="M143 -324v1786h484v-211h-224v-1364h224v-211h-484z" />
+<glyph unicode="\" horiz-adv-x="846" d="M12 1462h277l545 -1462h-277z" />
+<glyph unicode="]" horiz-adv-x="678" d="M51 -113h223v1364h-223v211h484v-1786h-484v211z" />
+<glyph unicode="^" horiz-adv-x="1090" d="M8 520l438 950h144l495 -950h-239l-322 643l-280 -643h-236z" />
+<glyph unicode="_" horiz-adv-x="842" d="M-4 -184h850v-140h-850v140z" />
+<glyph unicode="`" horiz-adv-x="1243" d="M332 1548v21h342q63 -101 235 -301v-27h-202q-63 44 -185 142.5t-190 164.5z" />
+<glyph unicode="a" horiz-adv-x="1237" d="M86 334q0 178 124.5 262.5t375.5 93.5l194 6v49q0 170 -174 170q-134 0 -315 -81l-101 206q193 101 428 101q225 0 345 -98t120 -298v-745h-213l-59 152h-8q-77 -97 -158.5 -134.5t-212.5 -37.5q-161 0 -253.5 92t-92.5 262zM399 332q0 -129 148 -129q106 0 169.5 61 t63.5 162v92l-118 -4q-133 -4 -198 -48t-65 -134z" />
+<glyph unicode="b" horiz-adv-x="1296" d="M160 0v1556h305v-362q0 -69 -12 -221h12q107 166 317 166q198 0 310 -154.5t112 -423.5q0 -277 -115.5 -429t-314.5 -152q-197 0 -309 143h-21l-51 -123h-233zM465 563q0 -180 53.5 -258t169.5 -78q94 0 149.5 86.5t55.5 251.5t-56 247.5t-153 82.5q-113 0 -165 -69.5 t-54 -229.5v-33z" />
+<glyph unicode="c" horiz-adv-x="1053" d="M92 553q0 285 142 435.5t407 150.5q194 0 348 -76l-90 -236q-72 29 -134 47.5t-124 18.5q-238 0 -238 -338q0 -328 238 -328q88 0 163 23.5t150 73.5v-261q-74 -47 -149.5 -65t-190.5 -18q-522 0 -522 573z" />
+<glyph unicode="d" horiz-adv-x="1296" d="M92 557q0 275 114.5 428.5t315.5 153.5q211 0 322 -164h10q-23 125 -23 223v358h306v-1556h-234l-59 145h-13q-104 -165 -317 -165q-197 0 -309.5 153t-112.5 424zM401 553q0 -165 57 -247.5t163 -82.5q117 0 171.5 68t59.5 231v33q0 180 -55.5 258t-180.5 78 q-102 0 -158.5 -86.5t-56.5 -251.5z" />
+<glyph unicode="e" horiz-adv-x="1210" d="M92 551q0 281 140.5 434.5t388.5 153.5q237 0 369 -135t132 -373v-148h-721q5 -130 77 -203t202 -73q101 0 191 21t188 67v-236q-80 -40 -171 -59.5t-222 -19.5q-270 0 -422 149t-152 422zM408 686h428q-2 113 -59 174.5t-154 61.5t-152 -61.5t-63 -174.5z" />
+<glyph unicode="f" horiz-adv-x="793" d="M41 889v147l168 82v82q0 191 94 279t301 88q158 0 281 -47l-78 -224q-92 29 -170 29q-65 0 -94 -38.5t-29 -98.5v-70h264v-229h-264v-889h-305v889h-168z" />
+<glyph unicode="g" horiz-adv-x="1157" d="M6 -182q0 101 63 169t185 97q-47 20 -82 65.5t-35 96.5q0 64 37 106.5t107 83.5q-88 38 -139.5 122t-51.5 198q0 183 119 283t340 100q47 0 111.5 -8.5t82.5 -12.5h390v-155l-175 -45q48 -75 48 -168q0 -180 -125.5 -280.5t-348.5 -100.5l-55 3l-45 5q-47 -36 -47 -80 q0 -66 168 -66h190q184 0 280.5 -79t96.5 -232q0 -196 -163.5 -304t-469.5 -108q-234 0 -357.5 81.5t-123.5 228.5zM270 -158q0 -63 60.5 -99t169.5 -36q164 0 257 45t93 123q0 63 -55 87t-170 24h-158q-84 0 -140.5 -39.5t-56.5 -104.5zM381 752q0 -91 41.5 -144t126.5 -53 q86 0 126 53t40 144q0 202 -166 202q-168 0 -168 -202z" />
+<glyph unicode="h" horiz-adv-x="1346" d="M160 0v1556h305v-317q0 -37 -7 -174l-7 -90h16q102 164 324 164q197 0 299 -106t102 -304v-729h-305v653q0 242 -180 242q-128 0 -185 -87t-57 -282v-526h-305z" />
+<glyph unicode="i" horiz-adv-x="625" d="M147 1407q0 149 166 149t166 -149q0 -71 -41.5 -110.5t-124.5 -39.5q-166 0 -166 150zM160 0v1118h305v-1118h-305z" />
+<glyph unicode="j" horiz-adv-x="625" d="M-131 -227q70 -19 143 -19q77 0 112.5 43t35.5 127v1194h305v-1239q0 -178 -103 -274.5t-292 -96.5q-117 0 -201 25v240zM147 1407q0 149 166 149t166 -149q0 -71 -41.5 -110.5t-124.5 -39.5q-166 0 -166 150z" />
+<glyph unicode="k" horiz-adv-x="1270" d="M160 0v1556h305v-694l-16 -254h4l133 170l313 340h344l-444 -485l471 -633h-352l-322 453l-131 -105v-348h-305z" />
+<glyph unicode="l" horiz-adv-x="625" d="M160 0v1556h305v-1556h-305z" />
+<glyph unicode="m" horiz-adv-x="2011" d="M160 0v1118h233l41 -143h17q45 77 130 120.5t195 43.5q251 0 340 -164h27q45 78 132.5 121t197.5 43q190 0 287.5 -97.5t97.5 -312.5v-729h-306v653q0 121 -40.5 181.5t-127.5 60.5q-112 0 -167.5 -80t-55.5 -254v-561h-305v653q0 121 -40.5 181.5t-127.5 60.5 q-117 0 -170 -86t-53 -283v-526h-305z" />
+<glyph unicode="n" horiz-adv-x="1346" d="M160 0v1118h233l41 -143h17q51 81 140.5 122.5t203.5 41.5q195 0 296 -105.5t101 -304.5v-729h-305v653q0 121 -43 181.5t-137 60.5q-128 0 -185 -85.5t-57 -283.5v-526h-305z" />
+<glyph unicode="o" horiz-adv-x="1268" d="M92 561q0 274 143 426t402 152q161 0 284 -70t189 -201t66 -307q0 -273 -144 -427t-401 -154q-161 0 -284 70.5t-189 202.5t-66 308zM403 561q0 -166 54.5 -251t177.5 -85q122 0 175.5 84.5t53.5 251.5q0 166 -54 249t-177 83q-122 0 -176 -82.5t-54 -249.5z" />
+<glyph unicode="p" horiz-adv-x="1296" d="M160 -492v1610h248l43 -145h14q107 166 317 166q198 0 310 -153t112 -425q0 -179 -52.5 -311t-149.5 -201t-228 -69q-197 0 -309 143h-16q16 -140 16 -162v-453h-305zM465 563q0 -180 53.5 -258t169.5 -78q205 0 205 338q0 165 -50.5 247.5t-158.5 82.5 q-113 0 -165 -69.5t-54 -229.5v-33z" />
+<glyph unicode="q" horiz-adv-x="1296" d="M92 557q0 274 114.5 428t313.5 154q106 0 185 -40t139 -124h8l27 143h258v-1610h-306v469q0 61 13 168h-13q-49 -81 -130 -123t-187 -42q-198 0 -310 152.5t-112 424.5zM403 553q0 -168 53.5 -251t166.5 -83q116 0 170 66.5t59 232.5v37q0 180 -55.5 258t-178.5 78 q-215 0 -215 -338z" />
+<glyph unicode="r" horiz-adv-x="930" d="M160 0v1118h231l45 -188h15q52 94 140.5 151.5t192.5 57.5q62 0 103 -9l-23 -286q-37 10 -90 10q-146 0 -227.5 -75t-81.5 -210v-569h-305z" />
+<glyph unicode="s" horiz-adv-x="1018" d="M92 827q0 149 115.5 230.5t327.5 81.5q202 0 393 -88l-92 -220q-84 36 -157 59t-149 23q-135 0 -135 -73q0 -41 43.5 -71t190.5 -89q131 -53 192 -99t90 -106t29 -143q0 -172 -119.5 -262t-357.5 -90q-122 0 -208 16.5t-161 48.5v252q85 -40 191.5 -67t187.5 -27 q166 0 166 96q0 36 -22 58.5t-76 51t-144 66.5q-129 54 -189.5 100t-88 105.5t-27.5 146.5z" />
+<glyph unicode="t" horiz-adv-x="889" d="M47 889v129l168 102l88 236h195v-238h313v-229h-313v-539q0 -65 36.5 -96t96.5 -31q80 0 192 35v-227q-114 -51 -280 -51q-183 0 -266.5 92.5t-83.5 277.5v539h-146z" />
+<glyph unicode="u" horiz-adv-x="1346" d="M154 389v729h305v-653q0 -121 43 -181.5t137 -60.5q128 0 185 85.5t57 283.5v526h305v-1118h-234l-41 143h-16q-49 -78 -139 -120.5t-205 -42.5q-197 0 -297 105.5t-100 303.5z" />
+<glyph unicode="v" horiz-adv-x="1165" d="M0 1118h319l216 -637q36 -121 45 -229h6q5 96 45 229l215 637h319l-426 -1118h-313z" />
+<glyph unicode="w" horiz-adv-x="1753" d="M20 1118h304l129 -495q31 -133 63 -367h6q4 76 35 241l16 85l138 536h336l131 -536q4 -22 12.5 -65t16.5 -91.5t14.5 -95t7.5 -74.5h6q9 72 32 197.5t33 169.5l134 495h299l-322 -1118h-332l-86 391l-116 494h-7l-204 -885h-328z" />
+<glyph unicode="x" horiz-adv-x="1184" d="M10 0l379 571l-360 547h346l217 -356l219 356h346l-364 -547l381 -571h-347l-235 383l-236 -383h-346z" />
+<glyph unicode="y" horiz-adv-x="1165" d="M0 1118h334l211 -629q27 -82 37 -194h6q11 103 43 194l207 629h327l-473 -1261q-65 -175 -185.5 -262t-281.5 -87q-79 0 -155 17v242q55 -13 120 -13q81 0 141.5 49.5t94.5 149.5l18 55z" />
+<glyph unicode="z" horiz-adv-x="999" d="M55 0v180l518 705h-487v233h834v-198l-504 -687h522v-233h-883z" />
+<glyph unicode="{" horiz-adv-x="807" d="M31 449v239q126 0 191 44t65 126v8v318q0 153 97 215.5t341 62.5v-225q-99 -3 -136.5 -38t-37.5 -103v-299q-6 -188 -234 -222v-12q234 -35 234 -212v-9v-299q0 -68 37 -103t137 -38v-226q-244 0 -341 62.5t-97 216.5v315q0 87 -65.5 133t-190.5 46z" />
+<glyph unicode="|" horiz-adv-x="1128" d="M455 -465v2015h219v-2015h-219z" />
+<glyph unicode="}" horiz-adv-x="807" d="M82 -98q99 2 136.5 36t37.5 105v299v11q0 86 59 139.5t174 70.5v12q-227 34 -233 222v299q0 70 -37 104t-137 37v225q167 0 262 -26.5t135.5 -84t40.5 -167.5v-318v-10q0 -84 61.5 -126t194.5 -42v-239q-125 0 -190.5 -41t-65.5 -138v-315q0 -112 -41 -169t-135.5 -83.5 t-261.5 -26.5v226z" />
+<glyph unicode="~" d="M88 551v231q103 109 256 109q73 0 137.5 -16t139.5 -48q129 -55 227 -55q53 0 116 32t117 89v-231q-101 -109 -256 -109q-66 0 -126 13t-150 50q-131 56 -227 56q-55 0 -117.5 -33.5t-116.5 -87.5z" />
+<glyph unicode="&#xa2;" d="M143 741q0 261 104.5 403t315.5 173v166h178v-158q166 -9 299 -74l-90 -235q-72 29 -134 47t-124 18q-121 0 -179 -83.5t-58 -254.5q0 -327 237 -327q82 0 148 15.5t166 60.5v-254q-127 -61 -265 -70v-188h-178v196q-420 59 -420 565z" />
+<glyph unicode="&#xa3;" d="M82 0v248q103 44 141.5 101t38.5 157v145h-178v219h178v195q0 201 114.5 309.5t323.5 108.5q195 0 390 -82l-93 -230q-157 64 -272 64q-78 0 -120 -44.5t-42 -127.5v-193h375v-219h-375v-143q0 -170 -151 -248h718v-260h-1048z" />
+<glyph unicode="&#xa5;" d="M6 1462h316l262 -602l264 602h313l-383 -747h195v-178h-246v-138h246v-178h-246v-221h-287v221h-247v178h247v138h-247v178h190z" />
+<glyph unicode="&#xa9;" horiz-adv-x="1704" d="M100 731q0 200 100 375t275 276t377 101q200 0 375 -100t276 -275t101 -377q0 -197 -97 -370t-272 -277t-383 -104q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM242 731q0 -164 82 -305.5t224 -223t304 -81.5q164 0 305.5 82t223 224t81.5 304q0 164 -82 305.5t-224 223 t-304 81.5q-164 0 -305.5 -82t-223 -224t-81.5 -304zM461 733q0 220 110.5 342.5t309.5 122.5q149 0 305 -78l-74 -168q-113 58 -217 58q-97 0 -150 -74t-53 -205q0 -280 203 -280q57 0 123 15t123 44v-191q-120 -57 -252 -57q-204 0 -316 125t-112 346z" />
+<glyph unicode="&#xad;" horiz-adv-x="659" d="M61 424v250h537v-250h-537z" />
+<glyph unicode="&#xae;" horiz-adv-x="1704" d="M100 731q0 200 100 375t275 276t377 101q200 0 375 -100t276 -275t101 -377q0 -197 -97 -370t-272 -277t-383 -104q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM242 731q0 -164 82 -305.5t224 -223t304 -81.5q164 0 305.5 82t223 224t81.5 304q0 164 -82 305.5t-224 223 t-304 81.5q-164 0 -305.5 -82t-223 -224t-81.5 -304zM543 272v916h264q181 0 265.5 -70t84.5 -213q0 -170 -143 -233l237 -400h-254l-178 338h-47v-338h-229zM772 778h31q66 0 94.5 28.5t28.5 94.5q0 65 -28 92t-97 27h-29v-242z" />
+<glyph unicode="&#xb4;" horiz-adv-x="1243" d="M332 1241v27q172 200 235 301h342v-21q-52 -52 -177.5 -154.5t-196.5 -152.5h-203z" />
+<glyph unicode="&#x2000;" horiz-adv-x="784" />
+<glyph unicode="&#x2001;" horiz-adv-x="1569" />
+<glyph unicode="&#x2002;" horiz-adv-x="784" />
+<glyph unicode="&#x2003;" horiz-adv-x="1569" />
+<glyph unicode="&#x2004;" horiz-adv-x="523" />
+<glyph unicode="&#x2005;" horiz-adv-x="392" />
+<glyph unicode="&#x2006;" horiz-adv-x="261" />
+<glyph unicode="&#x2007;" horiz-adv-x="261" />
+<glyph unicode="&#x2008;" horiz-adv-x="196" />
+<glyph unicode="&#x2009;" horiz-adv-x="313" />
+<glyph unicode="&#x200a;" horiz-adv-x="87" />
+<glyph unicode="&#x2010;" horiz-adv-x="659" d="M61 424v250h537v-250h-537z" />
+<glyph unicode="&#x2011;" horiz-adv-x="659" d="M61 424v250h537v-250h-537z" />
+<glyph unicode="&#x2012;" horiz-adv-x="659" d="M61 424v250h537v-250h-537z" />
+<glyph unicode="&#x2013;" horiz-adv-x="1024" d="M82 436v230h860v-230h-860z" />
+<glyph unicode="&#x2014;" horiz-adv-x="2048" d="M82 436v230h1884v-230h-1884z" />
+<glyph unicode="&#x2018;" horiz-adv-x="444" d="M25 983q22 91 72.5 228.5t103.5 250.5h219q-66 -267 -101 -501h-280z" />
+<glyph unicode="&#x2019;" horiz-adv-x="444" d="M25 961q69 296 100 501h281l14 -22q-50 -197 -176 -479h-219z" />
+<glyph unicode="&#x201c;" horiz-adv-x="911" d="M25 983q22 91 72.5 228.5t103.5 250.5h219q-66 -267 -101 -501h-280zM492 983q22 91 72.5 228.5t103.5 250.5h219q-66 -267 -101 -501h-280z" />
+<glyph unicode="&#x201d;" horiz-adv-x="911" d="M25 961q69 296 100 501h281l14 -22q-50 -197 -176 -479h-219zM492 961q69 296 100 501h280l15 -22q-50 -197 -176 -479h-219z" />
+<glyph unicode="&#x2022;" horiz-adv-x="770" d="M98 748q0 154 74 235.5t213 81.5q137 0 212 -82t75 -235q0 -152 -75.5 -235t-211.5 -83q-138 0 -212.5 83t-74.5 235z" />
+<glyph unicode="&#x2026;" horiz-adv-x="1751" d="M117 143q0 84 45 127t131 43q83 0 128.5 -44t45.5 -126q0 -79 -46 -124.5t-128 -45.5q-84 0 -130 44.5t-46 125.5zM700 143q0 84 45 127t132 43q83 0 128.5 -44t45.5 -126q0 -79 -46 -124.5t-128 -45.5q-85 0 -131 44.5t-46 125.5zM1284 143q0 84 45 127t131 43 q83 0 128.5 -44t45.5 -126q0 -79 -46 -124.5t-128 -45.5q-84 0 -130 44.5t-46 125.5z" />
+<glyph unicode="&#x202f;" horiz-adv-x="313" />
+<glyph unicode="&#x205f;" horiz-adv-x="392" />
+<glyph unicode="&#x20ac;" d="M66 481v178h118q-4 23 -4 62l2 53h-116v176h133q37 242 199 382.5t405 140.5q188 0 352 -82l-98 -232q-69 31 -129 48.5t-125 17.5q-122 0 -201 -70.5t-102 -204.5h403v-176h-418l-2 -35v-47l2 -33h355v-178h-338q51 -243 321 -243q143 0 275 57v-256q-116 -59 -293 -59 q-245 0 -403 133t-199 368h-137z" />
+<glyph unicode="&#x2122;" horiz-adv-x="1534" d="M16 1313v149h564v-149h-199v-572h-168v572h-197zM625 741v721h247l160 -510l170 510h240v-721h-168v408l4 121h-6l-174 -529h-142l-165 529h-7l4 -111v-418h-163z" />
+<glyph unicode="&#xe000;" horiz-adv-x="1120" d="M0 1120h1120v-1120h-1120v1120z" />
+</font>
+</defs></svg> 
\ No newline at end of file
diff --git a/fonts/OpenSans-Bold-webfont.ttf b/fonts/OpenSans-Bold-webfont.ttf
new file mode 100644
index 0000000..2d94f06
Binary files /dev/null and b/fonts/OpenSans-Bold-webfont.ttf differ
diff --git a/fonts/OpenSans-Bold-webfont.woff b/fonts/OpenSans-Bold-webfont.woff
new file mode 100644
index 0000000..cd86852
Binary files /dev/null and b/fonts/OpenSans-Bold-webfont.woff differ
diff --git a/fonts/OpenSans-BoldItalic-webfont.eot b/fonts/OpenSans-BoldItalic-webfont.eot
new file mode 100644
index 0000000..f44ac9a
Binary files /dev/null and b/fonts/OpenSans-BoldItalic-webfont.eot differ
diff --git a/fonts/OpenSans-BoldItalic-webfont.svg b/fonts/OpenSans-BoldItalic-webfont.svg
new file mode 100644
index 0000000..8392240
--- /dev/null
+++ b/fonts/OpenSans-BoldItalic-webfont.svg
@@ -0,0 +1,146 @@
+<?xml version="1.0" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
+<svg xmlns="http://www.w3.org/2000/svg">
+<metadata>
+This is a custom SVG webfont generated by Font Squirrel.
+Copyright   : Digitized data copyright  20102011 Google Corporation
+Foundry     : Ascender Corporation
+Foundry URL : httpwwwascendercorpcom
+</metadata>
+<defs>
+<font id="OpenSansBoldItalic" horiz-adv-x="1128" >
+<font-face units-per-em="2048" ascent="1638" descent="-410" />
+<missing-glyph horiz-adv-x="532" />
+<glyph unicode=" "  horiz-adv-x="532" />
+<glyph unicode="&#x09;" horiz-adv-x="532" />
+<glyph unicode="&#xa0;" horiz-adv-x="532" />
+<glyph unicode="!" horiz-adv-x="586" d="M25 115q0 90 53.5 144t150.5 54q68 0 109 -38t41 -107q0 -87 -55 -141t-144 -54q-73 0 -114 37.5t-41 104.5zM150 485l157 977h340l-256 -977h-241z" />
+<glyph unicode="&#x22;" horiz-adv-x="928" d="M201 934l71 528h277l-152 -528h-196zM604 934l74 528h276l-151 -528h-199z" />
+<glyph unicode="#" horiz-adv-x="1323" d="M41 408l18 206h277l70 232h-252l18 209h289l119 407h217l-117 -407h199l116 407h215l-116 -407h239l-18 -209h-279l-69 -232h258l-19 -206h-297l-116 -408h-220l117 408h-194l-115 -408h-215l113 408h-238zM553 614h197l69 232h-196z" />
+<glyph unicode="$" d="M51 168v266q198 -107 404 -117l71 322q-163 61 -241 151t-78 214q0 173 127 279.5t350 121.5l35 151h139l-33 -151q166 -22 295 -90l-106 -232q-132 65 -242 74l-63 -299q131 -51 195 -99.5t97 -113t33 -149.5q0 -184 -125.5 -291.5t-367.5 -124.5l-39 -199h-140l44 201 q-209 12 -355 86zM502 1022q0 -79 80 -111l51 246q-62 -7 -96.5 -41t-34.5 -94zM594 322q63 9 102 45t39 98q0 46 -24.5 75.5t-59.5 43.5z" />
+<glyph unicode="%" horiz-adv-x="1753" d="M115 885q0 169 55.5 311.5t148.5 214.5t216 72q137 0 211.5 -80t74.5 -238q0 -166 -56 -310t-151 -217t-217 -73q-139 0 -210.5 83.5t-71.5 236.5zM231 0l1088 1462h235l-1083 -1462h-240zM360 868q0 -96 56 -96q65 0 112 131t47 275q0 96 -57 96q-63 0 -110.5 -128.5 t-47.5 -277.5zM973 283q0 177 53 322.5t148 219.5t219 74q137 0 211.5 -78.5t74.5 -230.5q0 -167 -54 -313.5t-148 -220.5t-215 -74q-144 0 -216.5 78.5t-72.5 222.5zM1219 285q0 -97 55 -97q41 0 77 55t59.5 154.5t23.5 196.5q0 96 -58 96q-39 0 -75 -56t-59 -154t-23 -195 z" />
+<glyph unicode="&#x26;" horiz-adv-x="1450" d="M68 358q0 145 78.5 248.5t273.5 200.5q-76 130 -76 258q0 195 117.5 307.5t316.5 112.5q169 0 266 -82.5t97 -224.5q0 -280 -365 -426l195 -263q44 57 80.5 121.5t78.5 173.5h300q-133 -313 -310 -497l205 -287h-350l-72 98q-175 -118 -403 -118q-209 0 -320.5 97.5 t-111.5 280.5zM383 387q0 -65 45.5 -108t116.5 -43q115 0 221 59l-225 328q-88 -51 -123 -104.5t-35 -131.5zM621 1085q0 -46 12 -92t29 -73q113 59 155.5 111t42.5 112q0 57 -30 82.5t-70 25.5q-66 0 -102.5 -46.5t-36.5 -119.5z" />
+<glyph unicode="'" horiz-adv-x="522" d="M201 934l71 528h277l-152 -528h-196z" />
+<glyph unicode="(" horiz-adv-x="694" d="M74 281q0 339 122.5 626.5t381.5 554.5h262q-255 -278 -377.5 -573.5t-122.5 -618.5q0 -308 117 -594h-234q-149 266 -149 605z" />
+<glyph unicode=")" horiz-adv-x="694" d="M-147 -324q499 545 499 1192q0 307 -116 594h233q149 -264 149 -604q0 -342 -124 -630.5t-379 -551.5h-262z" />
+<glyph unicode="*" horiz-adv-x="1116" d="M172 1141l86 237l338 -174l33 369l256 -51l-113 -353l387 29l-18 -254l-338 43l160 -336l-246 -73l-90 337l-197 -278l-207 164l275 248z" />
+<glyph unicode="+" d="M109 612v219h366v369h219v-369h367v-219h-367v-364h-219v364h-366z" />
+<glyph unicode="," horiz-adv-x="569" d="M-102 -264q74 167 194 502h285l8 -23q-118 -255 -262 -479h-225z" />
+<glyph unicode="-" horiz-adv-x="659" d="M41 424l53 250h524l-53 -250h-524z" />
+<glyph unicode="." horiz-adv-x="584" d="M25 115q0 90 53.5 144t150.5 54q68 0 109 -38t41 -107q0 -87 -55 -141t-144 -54q-73 0 -114 37.5t-41 104.5z" />
+<glyph unicode="/" horiz-adv-x="862" d="M-90 0l809 1462h295l-809 -1462h-295z" />
+<glyph unicode="0" d="M66 467q0 297 84 537t228 360.5t333 120.5q399 0 399 -473q0 -470 -168.5 -751t-472.5 -281q-198 0 -300.5 122t-102.5 365zM369 461q0 -115 27.5 -173.5t97.5 -58.5q81 0 150.5 106t116 301t46.5 386q0 111 -30.5 162t-92.5 51q-80 0 -149.5 -104t-117.5 -302t-48 -368z " />
+<glyph unicode="1" d="M182 1114l566 348h249l-309 -1462h-305l180 829q35 152 76 287q-9 -8 -61.5 -47t-262.5 -170z" />
+<glyph unicode="2" d="M-49 0l43 213l477 424q180 159 248.5 254.5t68.5 179.5q0 75 -41 114.5t-110 39.5q-66 0 -135.5 -33.5t-171.5 -118.5l-146 203q132 112 252 159.5t250 47.5q190 0 301 -98t111 -259q0 -107 -41 -201t-122.5 -188t-266.5 -245l-269 -222v-10h568l-54 -260h-962z" />
+<glyph unicode="3" d="M14 59v267q84 -50 182 -75.5t191 -25.5q158 0 243 63.5t85 176.5q0 172 -258 172h-138l46 221h73q167 0 263 62t96 172q0 67 -43 104t-121 37q-134 0 -287 -100l-127 204q124 81 232.5 113.5t246.5 32.5q190 0 298 -90.5t108 -243.5q0 -156 -94.5 -262t-261.5 -135v-4 q131 -26 198.5 -106.5t67.5 -201.5q0 -133 -74 -238t-212 -163.5t-327 -58.5q-239 0 -387 79z" />
+<glyph unicode="4" d="M-25 303l48 234l770 925h311l-195 -919h170l-51 -240h-170l-63 -303h-293l63 303h-590zM305 543h311l58 248q12 58 40 164t42 141h-6q-35 -63 -132 -181z" />
+<glyph unicode="5" d="M27 61v269q174 -99 352 -99q154 0 241 71t87 194q0 94 -57.5 141t-166.5 47q-102 0 -213 -33l-104 78l207 733h755l-55 -262h-489l-88 -293q72 15 127 15q183 0 289 -103t106 -287q0 -167 -71.5 -292t-208.5 -192.5t-330 -67.5q-117 0 -218.5 23t-162.5 58z" />
+<glyph unicode="6" d="M88 469q0 202 61 395.5t167.5 335t256.5 213.5t357 72q125 0 223 -27l-51 -246q-84 25 -191 25q-194 0 -313.5 -108t-185.5 -345h4q115 166 311 166q157 0 242.5 -97t85.5 -273q0 -169 -71 -313.5t-190.5 -215.5t-277.5 -71q-212 0 -320 127t-108 362zM383 422 q0 -91 40 -143t107 -52q99 0 161.5 94t62.5 236q0 71 -33.5 113.5t-102.5 42.5q-60 0 -114.5 -35.5t-87.5 -95.5t-33 -160z" />
+<glyph unicode="7" d="M78 0l737 1202h-629l56 260h975l-41 -194l-752 -1268h-346z" />
+<glyph unicode="8" d="M55 350q0 298 348 426q-165 132 -165 299q0 119 58 212.5t168 145.5t257 52q123 0 215.5 -42t141 -118t48.5 -174q0 -134 -80.5 -233.5t-230.5 -151.5q217 -141 217 -365q0 -122 -63.5 -218.5t-181 -149.5t-273.5 -53q-214 0 -336.5 100t-122.5 270zM352 383 q0 -81 50 -128.5t135 -47.5q93 0 147.5 53.5t54.5 138.5q0 73 -36.5 131.5t-120.5 112.5q-116 -45 -173 -107t-57 -153zM528 1094q0 -132 123 -201q185 72 185 221q0 68 -39.5 107t-102.5 39q-76 0 -121 -46.5t-45 -119.5z" />
+<glyph unicode="9" d="M86 12v256q111 -41 227 -41q121 0 207.5 49t144 138.5t99.5 257.5h-4q-111 -158 -295 -158q-163 0 -252.5 103.5t-89.5 285.5q0 166 73 305.5t196 208t286 68.5q203 0 308.5 -123t105.5 -361q0 -280 -99 -533t-264 -370.5t-403 -117.5q-128 0 -240 32zM424 928 q0 -87 37.5 -131.5t105.5 -44.5q60 0 111.5 36.5t82 100t30.5 158.5q0 84 -35.5 137t-110.5 53q-65 0 -115.5 -42t-78 -114t-27.5 -153z" />
+<glyph unicode=":" horiz-adv-x="584" d="M25 115q0 90 53.5 144t150.5 54q68 0 109 -38t41 -107q0 -87 -55 -141t-144 -54q-73 0 -114 37.5t-41 104.5zM207 940q0 92 55.5 145.5t149.5 53.5q68 0 108.5 -38.5t40.5 -107.5q0 -86 -54.5 -140t-144.5 -54q-72 0 -113.5 36.5t-41.5 104.5z" />
+<glyph unicode=";" horiz-adv-x="584" d="M-102 -264q74 167 194 502h285l8 -23q-118 -255 -262 -479h-225zM207 940q0 92 55.5 145.5t149.5 53.5q68 0 108.5 -38.5t40.5 -107.5q0 -86 -54.5 -140t-144.5 -54q-72 0 -113.5 36.5t-41.5 104.5z" />
+<glyph unicode="&#x3c;" d="M109 641v143l952 496v-240l-643 -317l643 -281v-239z" />
+<glyph unicode="=" d="M109 418v219h952v-219h-952zM109 807v217h952v-217h-952z" />
+<glyph unicode="&#x3e;" d="M109 203v239l643 281l-643 317v240l952 -496v-143z" />
+<glyph unicode="?" horiz-adv-x="940" d="M166 115q0 91 55 144.5t150 53.5q68 0 108.5 -38t40.5 -107q0 -87 -55 -141t-143 -54q-74 0 -115 38t-41 104zM178 1358q230 125 445 125q177 0 280 -87.5t103 -244.5q0 -83 -28.5 -149.5t-82.5 -123t-190 -147.5q-64 -43 -96.5 -73t-52.5 -64.5t-38 -108.5h-258l14 78 q19 103 73.5 177t172.5 155q124 84 157.5 127t33.5 96q0 119 -133 119q-50 0 -106.5 -16t-201.5 -84z" />
+<glyph unicode="@" horiz-adv-x="1753" d="M92 500q0 279 120.5 497t343 341.5t497.5 123.5q318 0 499 -163.5t181 -458.5q0 -173 -64 -321t-177.5 -231t-254.5 -83q-88 0 -144.5 38.5t-72.5 108.5h-6q-50 -77 -113 -112t-147 -35q-127 0 -198 79.5t-71 229.5q0 147 67.5 276.5t187.5 205t268 75.5q185 0 327 -55 l-106 -420q-11 -44 -19 -76.5t-8 -64.5q0 -68 58 -68q66 0 124 64t92.5 171t34.5 214q0 213 -123.5 325.5t-359.5 112.5q-203 0 -366.5 -94t-255 -266t-91.5 -392q0 -243 134 -380.5t376 -137.5q117 0 219.5 20t221.5 66v-186q-230 -90 -465 -90q-217 0 -378 85.5 t-246 241.5t-85 359zM713 526q0 -65 24.5 -102t69.5 -37q141 0 213 270l57 222q-36 10 -82 10q-82 0 -145.5 -51.5t-100 -137t-36.5 -174.5z" />
+<glyph unicode="A" horiz-adv-x="1286" d="M-123 0l766 1468h373l147 -1468h-297l-24 348h-473l-172 -348h-320zM494 608h333l-26 350q-10 131 -10 253v36q-44 -120 -109 -254z" />
+<glyph unicode="B" horiz-adv-x="1270" d="M53 0l309 1462h426q229 0 346 -81.5t117 -243.5q0 -150 -83 -247.5t-236 -129.5v-6q100 -26 159.5 -96.5t59.5 -180.5q0 -229 -153 -353t-423 -124h-522zM412 256h180q117 0 183.5 58t66.5 161q0 162 -183 162h-165zM545 883h149q121 0 181.5 48.5t60.5 139.5 q0 137 -170 137h-152z" />
+<glyph unicode="C" horiz-adv-x="1253" d="M123 553q0 262 104 482.5t278 335t400 114.5q125 0 222 -22.5t208 -82.5l-118 -250q-106 59 -175 78t-137 19q-132 0 -237.5 -81t-169.5 -238.5t-64 -338.5q0 -167 68.5 -248t218.5 -81q146 0 338 77v-260q-199 -77 -400 -77q-254 0 -395 149.5t-141 423.5z" />
+<glyph unicode="D" horiz-adv-x="1386" d="M53 0l309 1462h396q270 0 417.5 -143t147.5 -410q0 -280 -98 -486.5t-283.5 -314.5t-437.5 -108h-451zM412 256h106q148 0 258 76t172 223.5t62 337.5q0 154 -72.5 234.5t-208.5 80.5h-115z" />
+<glyph unicode="E" horiz-adv-x="1110" d="M53 0l309 1462h818l-54 -254h-512l-67 -321h477l-55 -254h-477l-80 -377h512l-54 -256h-817z" />
+<glyph unicode="F" horiz-adv-x="1087" d="M53 0l309 1462h814l-54 -254h-508l-79 -377h473l-56 -253h-473l-121 -578h-305z" />
+<glyph unicode="G" horiz-adv-x="1413" d="M123 549q0 268 107 484.5t301 334t448 117.5q218 0 410 -99l-115 -251q-74 40 -148 64t-161 24q-153 0 -273.5 -83t-189 -236.5t-68.5 -330.5q0 -172 72.5 -252.5t222.5 -80.5q76 0 170 24l66 299h-267l56 258h563l-162 -762q-134 -46 -248.5 -62.5t-242.5 -16.5 q-259 0 -400 147t-141 422z" />
+<glyph unicode="H" horiz-adv-x="1434" d="M53 0l309 1462h306l-121 -573h471l121 573h305l-309 -1462h-306l134 631h-471l-134 -631h-305z" />
+<glyph unicode="I" horiz-adv-x="659" d="M53 0l312 1462h305l-312 -1462h-305z" />
+<glyph unicode="J" horiz-adv-x="678" d="M-322 -150q88 -20 164 -20q99 0 160.5 60.5t89.5 191.5l293 1380h305l-303 -1423q-52 -245 -175.5 -357t-346.5 -112q-94 0 -187 27v253z" />
+<glyph unicode="K" horiz-adv-x="1255" d="M53 0l309 1462h306l-152 -702l158 205l409 497h361l-594 -700l291 -762h-338l-211 592l-125 -70l-109 -522h-305z" />
+<glyph unicode="L" horiz-adv-x="1061" d="M53 0l309 1462h306l-256 -1206h512l-54 -256h-817z" />
+<glyph unicode="M" horiz-adv-x="1802" d="M53 0l309 1462h404l68 -1093h4l551 1093h423l-309 -1462h-280l145 692q53 247 105 441h-5l-569 -1133h-281l-61 1133h-4q-11 -88 -38 -231t-187 -902h-275z" />
+<glyph unicode="N" horiz-adv-x="1546" d="M53 0l309 1462h357l340 -1077h4q12 76 39 217t180 860h274l-309 -1462h-342l-356 1106h-6l-4 -32q-32 -216 -66 -386l-145 -688h-275z" />
+<glyph unicode="O" horiz-adv-x="1495" d="M123 537q0 265 99 487.5t273 341.5t402 119q255 0 395 -144t140 -403q0 -283 -99 -506.5t-271 -337.5t-396 -114q-256 0 -399.5 147.5t-143.5 409.5zM434 537q0 -147 66.5 -222t187.5 -75t220.5 87t155.5 246t56 357q0 142 -65 219.5t-183 77.5q-121 0 -222 -91.5 t-158.5 -251.5t-57.5 -347z" />
+<glyph unicode="P" horiz-adv-x="1188" d="M53 0l309 1462h338q242 0 366 -106.5t124 -319.5q0 -241 -169.5 -378.5t-467.5 -137.5h-86l-109 -520h-305zM522 774h56q142 0 223.5 69t81.5 185q0 180 -195 180h-74z" />
+<glyph unicode="Q" horiz-adv-x="1495" d="M123 537q0 265 99 487.5t273 341.5t402 119q255 0 395 -144t140 -403q0 -316 -122.5 -555.5t-334.5 -337.5l254 -393h-359l-178 328h-26q-256 0 -399.5 147.5t-143.5 409.5zM434 537q0 -147 66.5 -222t187.5 -75t220.5 87t155.5 246t56 357q0 142 -65 219.5t-183 77.5 q-121 0 -222 -91.5t-158.5 -251.5t-57.5 -347z" />
+<glyph unicode="R" horiz-adv-x="1247" d="M53 0l309 1462h359q237 0 356 -102t119 -299q0 -158 -83 -271.5t-239 -168.5l261 -621h-332l-207 561h-119l-119 -561h-305zM530 813h78q131 0 204 57t73 174q0 82 -47.5 123t-149.5 41h-74z" />
+<glyph unicode="S" horiz-adv-x="1085" d="M41 70v274q193 -108 358 -108q112 0 175 42.5t63 116.5q0 43 -13.5 75.5t-38.5 60.5t-124 102q-138 99 -194 196t-56 209q0 129 62 230.5t176.5 158t263.5 56.5q217 0 397 -99l-109 -233q-156 74 -288 74q-83 0 -136 -45t-53 -119q0 -61 33 -106.5t148 -120.5 q121 -80 181 -176.5t60 -225.5q0 -209 -148 -330.5t-401 -121.5q-221 0 -356 90z" />
+<glyph unicode="T" horiz-adv-x="1087" d="M168 1204l55 258h1010l-55 -258h-353l-254 -1204h-305l254 1204h-352z" />
+<glyph unicode="U" horiz-adv-x="1415" d="M141 401q0 72 15 138l196 923h305l-194 -919q-17 -74 -17 -125q0 -178 189 -178q123 0 195 76.5t104 228.5l194 917h306l-201 -946q-57 -266 -218 -401t-419 -135q-212 0 -333.5 113.5t-121.5 307.5z" />
+<glyph unicode="V" horiz-adv-x="1208" d="M184 1462h295l51 -880q4 -45 4 -133q-2 -103 -6 -150h7q78 221 110 283l432 880h316l-748 -1462h-334z" />
+<glyph unicode="W" horiz-adv-x="1831" d="M184 1462h287l6 -798q0 -52 -4 -173t-10 -174h6q22 64 67 180.5t60 145.5l369 819h270l21 -873q0 -146 -9 -272h6q43 129 131 349l330 796h309l-647 -1462h-346l-22 721l-2 139q0 88 4 158h-4q-46 -146 -115 -299l-324 -719h-338z" />
+<glyph unicode="X" horiz-adv-x="1241" d="M-117 0l576 764l-238 698h320l153 -518l363 518h344l-545 -725l268 -737h-331l-172 543l-396 -543h-342z" />
+<glyph unicode="Y" horiz-adv-x="1155" d="M186 1462h312l129 -592l374 592h342l-618 -903l-119 -559h-303l119 559z" />
+<glyph unicode="Z" horiz-adv-x="1098" d="M-61 0l38 201l777 1005h-543l53 256h936l-41 -202l-782 -1004h596l-53 -256h-981z" />
+<glyph unicode="[" horiz-adv-x="678" d="M-37 -324l381 1786h473l-45 -211h-215l-291 -1364h215l-45 -211h-473z" />
+<glyph unicode="\" horiz-adv-x="862" d="M221 1462h260l224 -1462h-267z" />
+<glyph unicode="]" horiz-adv-x="678" d="M-137 -324l45 211h213l291 1364h-215l45 211h473l-381 -1786h-471z" />
+<glyph unicode="^" horiz-adv-x="1081" d="M20 520l619 950h147l277 -950h-223l-174 633l-402 -633h-244z" />
+<glyph unicode="_" horiz-adv-x="819" d="M-186 -324l30 140h822l-31 -140h-821z" />
+<glyph unicode="`" horiz-adv-x="1135" d="M508 1548v21h311q36 -148 115 -303v-25h-184q-71 69 -138.5 153.5t-103.5 153.5z" />
+<glyph unicode="a" horiz-adv-x="1217" d="M90 385q0 198 72 377.5t189 278t257 98.5q97 0 167.5 -42t109.5 -122h8l57 143h232l-238 -1118h-229l14 145h-4q-134 -165 -319 -165q-147 0 -231.5 106.5t-84.5 298.5zM395 399q0 -88 33.5 -132t95.5 -44q69 0 133 67t103 181.5t39 259.5q0 71 -38.5 117.5t-101.5 46.5 q-68 0 -129.5 -72t-98 -190t-36.5 -234z" />
+<glyph unicode="b" horiz-adv-x="1219" d="M37 0l330 1556h301l-62 -288q-41 -182 -84 -299h8q78 98 142.5 134t140.5 36q146 0 230.5 -108t84.5 -298t-68 -367.5t-187 -281.5t-263 -104q-194 0 -276 163h-8l-58 -143h-231zM420 399q0 -80 37 -128t102 -48q67 0 128 69t98.5 189.5t37.5 237.5q0 176 -131 176 q-68 0 -130 -65t-102 -180.5t-40 -250.5z" />
+<glyph unicode="c" horiz-adv-x="989" d="M90 391q0 212 74.5 385.5t209.5 268t308 94.5q182 0 328 -72l-92 -229q-54 23 -106 40t-118 17q-85 0 -153.5 -64t-107 -175.5t-38.5 -239.5q0 -96 45.5 -144.5t126.5 -48.5q76 0 141 23.5t134 58.5v-246q-152 -79 -336 -79q-201 0 -308.5 107.5t-107.5 303.5z" />
+<glyph unicode="d" horiz-adv-x="1217" d="M90 387q0 196 71.5 374.5t188.5 278t258 99.5q82 0 141.5 -37t112.5 -127h8l2 28q6 110 25 195l76 358h301l-330 -1556h-229l14 145h-4q-71 -87 -148.5 -126t-170.5 -39q-147 0 -231.5 107t-84.5 300zM395 399q0 -176 137 -176q66 0 128.5 68.5t100.5 182.5t38 245 q0 80 -37.5 128t-102.5 48q-68 0 -129.5 -72t-98 -190t-36.5 -234z" />
+<glyph unicode="e" horiz-adv-x="1141" d="M90 412q0 207 82.5 377.5t223.5 260t319 89.5q177 0 276 -81.5t99 -223.5q0 -187 -167 -288.5t-477 -101.5h-51l-2 -21v-20q0 -91 51.5 -143.5t147.5 -52.5q87 0 158 19t172 67v-227q-172 -86 -390 -86q-210 0 -326 113t-116 319zM428 647h45q155 0 241.5 48.5 t86.5 131.5q0 95 -105 95q-88 0 -166 -80t-102 -195z" />
+<glyph unicode="f" horiz-adv-x="764" d="M-219 -225q61 -21 115 -21q61 0 107 40t65 130l204 965h-163l30 145l183 84l18 84q41 190 138.5 277.5t273.5 87.5q131 0 235 -49l-80 -224q-69 31 -133 31q-57 0 -92 -40t-47 -105l-12 -62h219l-49 -229h-220l-215 -1010q-77 -371 -403 -371q-104 0 -174 25v242z" />
+<glyph unicode="g" horiz-adv-x="1108" d="M-115 -209q0 102 68.5 175.5t214.5 121.5q-74 47 -74 133q0 71 44.5 122.5t146.5 98.5q-65 49 -96 112t-31 153q0 199 125.5 315.5t341.5 116.5q83 0 166 -23h395l-35 -166l-174 -41q16 -52 16 -118q0 -195 -121 -308.5t-329 -113.5q-59 0 -99 10q-84 -27 -84 -78 q0 -34 30 -49t89 -23l137 -18q163 -21 237.5 -84.5t74.5 -183.5q0 -211 -156 -323t-446 -112q-208 0 -324.5 75.5t-116.5 207.5zM150 -172q0 -115 194 -115q151 0 228 45t77 127q0 39 -32.5 60t-137.5 35l-114 14q-106 -14 -160.5 -57t-54.5 -109zM442 680q0 -119 103 -119 q75 0 121.5 76.5t46.5 193.5t-99 117q-77 0 -124.5 -76.5t-47.5 -191.5z" />
+<glyph unicode="h" horiz-adv-x="1237" d="M37 0l330 1556h301q-39 -181 -60 -278t-86 -309h8q62 77 138 123.5t176 46.5q138 0 213.5 -83.5t75.5 -238.5q0 -73 -23 -180l-133 -637h-301l137 653q16 68 16 119q0 123 -108 123q-92 0 -167 -114t-118 -318l-98 -463h-301z" />
+<glyph unicode="i" horiz-adv-x="608" d="M37 0l237 1118h301l-237 -1118h-301zM322 1380q0 87 47.5 131.5t134.5 44.5q73 0 111 -31t38 -89q0 -80 -44 -129.5t-136 -49.5q-151 0 -151 123z" />
+<glyph unicode="j" horiz-adv-x="608" d="M-264 -225q61 -21 114 -21q137 0 173 170l253 1194h302l-265 -1239q-77 -371 -403 -371q-104 0 -174 25v242zM324 1380q0 87 47.5 131.5t134.5 44.5q73 0 111 -31t38 -89q0 -80 -44 -129.5t-136 -49.5q-151 0 -151 123z" />
+<glyph unicode="k" horiz-adv-x="1163" d="M37 0l330 1556h301l-148 -694q-8 -41 -29 -117l-28 -102h4l453 475h344l-498 -504l285 -614h-336l-183 420l-120 -72l-74 -348h-301z" />
+<glyph unicode="l" horiz-adv-x="608" d="M37 0l330 1556h301l-330 -1556h-301z" />
+<glyph unicode="m" horiz-adv-x="1853" d="M37 0l237 1118h230l-21 -207h6q146 228 355 228q219 0 262 -228h6q68 110 160.5 169t197.5 59q136 0 207.5 -85t71.5 -237q0 -76 -23 -180l-133 -637h-301l138 653q16 68 16 119q0 123 -98 123q-92 0 -166.5 -112t-118.5 -318l-96 -465h-301l137 653q16 68 16 119 q0 123 -98 123q-92 0 -167 -114t-118 -318l-98 -463h-301z" />
+<glyph unicode="n" horiz-adv-x="1237" d="M37 0l237 1118h230l-21 -207h6q146 228 355 228q138 0 213.5 -83.5t75.5 -238.5q0 -73 -23 -180l-133 -637h-301l137 653q16 68 16 119q0 123 -108 123q-92 0 -167 -114t-118 -318l-98 -463h-301z" />
+<glyph unicode="o" horiz-adv-x="1198" d="M90 410q0 213 71.5 379.5t206.5 258t316 91.5q196 0 310 -118t114 -325q0 -211 -70.5 -374t-203.5 -252.5t-316 -89.5q-195 0 -311.5 117.5t-116.5 312.5zM393 410q0 -185 150 -185q75 0 135 61.5t93.5 171t33.5 238.5q0 197 -143 197q-75 0 -134.5 -61t-97 -179 t-37.5 -243z" />
+<glyph unicode="p" horiz-adv-x="1219" d="M-68 -492l342 1610h230l-17 -170h9q138 191 317 191q146 0 230.5 -107.5t84.5 -300.5q0 -191 -68.5 -367.5t-187.5 -280t-262 -103.5q-83 0 -143 37t-111 126h-8q-12 -159 -43 -295l-72 -340h-301zM420 399q0 -80 37 -128t102 -48q67 0 128 69t98.5 189.5t37.5 237.5 q0 176 -131 176q-68 0 -131.5 -67.5t-102 -180t-38.5 -248.5z" />
+<glyph unicode="q" horiz-adv-x="1217" d="M90 385q0 198 72 377.5t189 278t257 98.5q86 0 152.5 -37.5t124.5 -126.5h8l57 143h232l-342 -1610h-301q47 218 73 337.5t84 304.5h-8q-72 -94 -143 -132t-154 -38q-88 0 -156 47.5t-106.5 138.5t-38.5 219zM395 399q0 -88 36.5 -132t103.5 -44q64 0 127.5 70t100 181 t36.5 245q0 80 -37.5 128t-102.5 48q-68 0 -129.5 -72t-98 -190t-36.5 -234z" />
+<glyph unicode="r" horiz-adv-x="862" d="M37 0l237 1118h230l-21 -207h6q147 228 353 228q59 0 96 -11l-66 -290q-45 16 -100 16q-116 0 -203.5 -91.5t-124.5 -262.5l-106 -500h-301z" />
+<glyph unicode="s" horiz-adv-x="969" d="M23 45v248q157 -90 319 -90q80 0 131 32.5t51 88.5q0 43 -37 77t-131 86q-121 68 -169 135.5t-48 159.5q0 170 110.5 263.5t315.5 93.5q201 0 363 -95l-99 -215q-140 84 -258 84q-57 0 -92 -25.5t-35 -68.5q0 -39 32 -68.5t120 -74.5q123 -63 178 -137t55 -170 q0 -188 -124.5 -288.5t-346.5 -100.5q-107 0 -186.5 15t-148.5 50z" />
+<glyph unicode="t" horiz-adv-x="840" d="M94 889l29 147l196 84l132 236h194l-49 -238h283l-50 -229h-282l-115 -539q-6 -30 -6 -53q0 -74 88 -74q65 0 162 35v-225q-111 -53 -266 -53q-150 0 -220.5 63t-70.5 195q0 50 12 112l115 539h-152z" />
+<glyph unicode="u" horiz-adv-x="1237" d="M111 301q0 93 24 213l127 604h301l-137 -653q-16 -68 -16 -119q0 -123 108 -123q92 0 167 114t118 318l98 463h301l-237 -1118h-230l21 207h-6q-145 -227 -355 -227q-138 0 -211 82.5t-73 238.5z" />
+<glyph unicode="v" horiz-adv-x="1049" d="M102 1118h295l45 -586q7 -133 7 -231h6q55 153 92 223l297 594h323l-604 -1118h-323z" />
+<glyph unicode="w" horiz-adv-x="1614" d="M125 1118h281l4 -495l-4 -167l-7 -171h4q6 20 14 41.5t51 136.5t46 119l231 536h328v-536q0 -142 -10 -297h6l28 80q73 208 95 258l219 495h307l-530 -1118h-330l-6 520q0 155 10 340h-6q-62 -178 -123 -319l-233 -541h-324z" />
+<glyph unicode="x" horiz-adv-x="1087" d="M-100 0l479 573l-225 545h321l115 -334l244 334h354l-467 -561l244 -557h-326l-125 342l-264 -342h-350z" />
+<glyph unicode="y" horiz-adv-x="1063" d="M-141 -233q68 -13 116 -13q84 0 147.5 48t117.5 149l26 49l-164 1118h295l56 -518q14 -122 14 -293h6q20 51 44 119.5t65 153.5l260 538h327l-680 -1278q-177 -332 -483 -332q-90 0 -147 19v240z" />
+<glyph unicode="z" horiz-adv-x="932" d="M-47 0l35 180l575 705h-397l51 233h750l-43 -200l-566 -685h439l-49 -233h-795z" />
+<glyph unicode="{" horiz-adv-x="727" d="M-8 459l45 229q122 0 192.5 41.5t92.5 138.5l61 285q38 170 131 239.5t270 69.5h84l-49 -225q-90 -2 -130.5 -34.5t-55.5 -106.5l-66 -297q-45 -207 -276 -236v-8q85 -26 126.5 -82.5t41.5 -134.5q0 -44 -15 -113l-36 -178q-7 -28 -7 -51q0 -54 33.5 -74t91.5 -20v-226 h-53q-167 0 -253.5 63.5t-86.5 184.5q0 57 14 125l39 184q15 69 15 86q0 140 -209 140z" />
+<glyph unicode="|" d="M455 -465v2015h219v-2015h-219z" />
+<glyph unicode="}" horiz-adv-x="727" d="M-100 -98q93 3 137 35.5t59 105.5l66 297q25 111 95 166t181 69v9q-168 51 -168 217q0 43 15 112l37 179q6 30 6 51q0 54 -36.5 74t-109.5 20l41 225h33q340 0 340 -248q0 -56 -14 -124l-39 -185q-15 -69 -15 -86q0 -139 209 -139l-45 -229q-122 0 -192.5 -42t-91.5 -139 l-62 -284q-37 -170 -130.5 -240t-270.5 -70h-45v226z" />
+<glyph unicode="~" d="M109 551v231q101 109 256 109q64 0 117 -14t139 -50q64 -27 111 -41t95 -14q51 0 112 30.5t122 90.5v-231q-103 -109 -256 -109q-59 0 -109 11.5t-147 51.5q-89 38 -127 47t-80 9q-54 0 -116.5 -33t-116.5 -88z" />
+<glyph unicode="&#xa2;" d="M164 584q0 193 62.5 355t178 262.5t267.5 123.5l33 158h188l-35 -158q118 -14 225 -65l-92 -230q-53 23 -105 40t-118 17q-133 0 -216 -143t-83 -336q0 -96 45 -144t127 -48q75 0 140 23.5t134 58.5v-246q-136 -71 -299 -80l-41 -192h-188l49 210q-134 36 -203 136 t-69 258z" />
+<glyph unicode="&#xa3;" d="M-12 0l49 246q196 48 244 264l22 104h-192l45 220h192l49 247q41 197 162 300.5t313 103.5q195 0 369 -86l-113 -232q-141 68 -237 68q-75 0 -123 -39.5t-68 -132.5l-47 -229h299l-45 -220h-299l-18 -84q-42 -195 -209 -270h655l-55 -260h-993z" />
+<glyph unicode="&#xa5;" d="M88 221l37 178h252l29 138h-252l39 178h196l-192 747h297l114 -590l371 590h311l-506 -747h203l-39 -178h-252l-28 -138h252l-37 -178h-252l-47 -221h-291l47 221h-252z" />
+<glyph unicode="&#xa9;" horiz-adv-x="1704" d="M125 731q0 200 100 375t275 276t377 101q199 0 373.5 -99t276 -275.5t101.5 -377.5q0 -199 -98.5 -373t-272.5 -276t-380 -102q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM266 731q0 -164 81.5 -305t224 -223t305.5 -82q167 0 308 83t221.5 223.5t80.5 303.5 t-80.5 303.5t-222 223.5t-307.5 83q-164 0 -306.5 -82.5t-223.5 -223.5t-81 -304zM485 721q0 225 117.5 351t325.5 126q142 0 284 -72l-75 -174q-114 58 -205 58q-111 0 -163 -73t-52 -214q0 -134 55.5 -203t159.5 -69q43 0 108.5 15.5t124.5 43.5v-191q-131 -57 -262 -57 q-196 0 -307 122.5t-111 336.5z" />
+<glyph unicode="&#xad;" horiz-adv-x="659" d="M41 424l53 250h524l-53 -250h-524z" />
+<glyph unicode="&#xae;" horiz-adv-x="1704" d="M125 731q0 200 100 375t275 276t377 101q199 0 373.5 -99t276 -275.5t101.5 -377.5q0 -199 -98.5 -373t-272.5 -276t-380 -102q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM266 731q0 -164 81.5 -305t224 -223t305.5 -82q167 0 308 83t221.5 223.5t80.5 303.5 t-80.5 303.5t-222 223.5t-307.5 83q-164 0 -306.5 -82.5t-223.5 -223.5t-81 -304zM571 293v874h308q173 0 265.5 -67.5t92.5 -200.5q0 -86 -44 -149.5t-130 -96.5l197 -360h-254l-138 297h-67v-297h-230zM801 758h51q72 0 113 31t41 92q0 59 -35.5 88.5t-116.5 29.5h-53 v-241z" />
+<glyph unicode="&#xb4;" horiz-adv-x="1135" d="M483 1241v25q79 88 222 303h335v-17q-46 -56 -154 -152.5t-194 -158.5h-209z" />
+<glyph unicode="&#x2000;" horiz-adv-x="786" />
+<glyph unicode="&#x2001;" horiz-adv-x="1573" />
+<glyph unicode="&#x2002;" horiz-adv-x="786" />
+<glyph unicode="&#x2003;" horiz-adv-x="1573" />
+<glyph unicode="&#x2004;" horiz-adv-x="524" />
+<glyph unicode="&#x2005;" horiz-adv-x="393" />
+<glyph unicode="&#x2006;" horiz-adv-x="262" />
+<glyph unicode="&#x2007;" horiz-adv-x="262" />
+<glyph unicode="&#x2008;" horiz-adv-x="196" />
+<glyph unicode="&#x2009;" horiz-adv-x="314" />
+<glyph unicode="&#x200a;" horiz-adv-x="87" />
+<glyph unicode="&#x2010;" horiz-adv-x="659" d="M41 424l53 250h524l-53 -250h-524z" />
+<glyph unicode="&#x2011;" horiz-adv-x="659" d="M41 424l53 250h524l-53 -250h-524z" />
+<glyph unicode="&#x2012;" horiz-adv-x="659" d="M41 424l53 250h524l-53 -250h-524z" />
+<glyph unicode="&#x2013;" horiz-adv-x="983" d="M41 436l49 230h852l-49 -230h-852z" />
+<glyph unicode="&#x2014;" horiz-adv-x="1966" d="M41 436l49 230h1835l-49 -230h-1835z" />
+<glyph unicode="&#x2018;" horiz-adv-x="440" d="M115 983q103 227 262 479h225q-91 -213 -194 -501h-285z" />
+<glyph unicode="&#x2019;" horiz-adv-x="440" d="M106 961q89 206 195 501h285l8 -22q-103 -227 -262 -479h-226z" />
+<glyph unicode="&#x201c;" horiz-adv-x="887" d="M115 983q103 227 262 479h225q-91 -213 -194 -501h-285zM561 983q103 227 262 479h226q-97 -227 -195 -501h-285z" />
+<glyph unicode="&#x201d;" horiz-adv-x="887" d="M106 961q89 206 195 501h285l8 -22q-103 -227 -262 -479h-226zM553 961q23 53 46.5 111t148.5 390h284l8 -22q-103 -227 -262 -479h-225z" />
+<glyph unicode="&#x2022;" horiz-adv-x="739" d="M104 686q0 106 42.5 194t120 136.5t182.5 48.5q120 0 182.5 -67t62.5 -191q0 -177 -91.5 -277t-248.5 -100q-117 0 -183.5 67t-66.5 189z" />
+<glyph unicode="&#x2026;" horiz-adv-x="1706" d="M25 115q0 90 53.5 144t150.5 54q68 0 109 -38t41 -107q0 -87 -55 -141t-144 -54q-73 0 -114 37.5t-41 104.5zM586 115q0 90 53.5 144t150.5 54q68 0 109 -38t41 -107q0 -87 -55 -141t-144 -54q-73 0 -114 37.5t-41 104.5zM1147 115q0 90 53.5 144t150.5 54q68 0 109 -38 t41 -107q0 -87 -55 -141t-144 -54q-73 0 -114 37.5t-41 104.5z" />
+<glyph unicode="&#x202f;" horiz-adv-x="314" />
+<glyph unicode="&#x205f;" horiz-adv-x="393" />
+<glyph unicode="&#x20ac;" d="M41 481l37 178h127q9 67 22 115h-125l39 176h135q87 252 250.5 393.5t374.5 141.5q100 0 179 -23t165 -80l-125 -223q-87 49 -131 63.5t-90 14.5q-97 0 -176 -74.5t-135 -212.5h348l-39 -176h-360q-11 -34 -25 -115h299l-37 -178h-280q0 -120 44.5 -181.5t147.5 -61.5 q133 0 283 63v-258q-126 -63 -330 -63q-446 0 -446 501h-152z" />
+<glyph unicode="&#x2122;" horiz-adv-x="1534" d="M106 1313v149h564v-149h-199v-572h-168v572h-197zM715 741v721h248l159 -510l170 510h240v-721h-168v408l4 121h-6l-174 -529h-141l-166 529h-7l5 -111v-418h-164z" />
+<glyph unicode="&#xe000;" horiz-adv-x="1120" d="M0 1120h1120v-1120h-1120v1120z" />
+</font>
+</defs></svg> 
\ No newline at end of file
diff --git a/fonts/OpenSans-BoldItalic-webfont.ttf b/fonts/OpenSans-BoldItalic-webfont.ttf
new file mode 100644
index 0000000..f74e0e3
Binary files /dev/null and b/fonts/OpenSans-BoldItalic-webfont.ttf differ
diff --git a/fonts/OpenSans-BoldItalic-webfont.woff b/fonts/OpenSans-BoldItalic-webfont.woff
new file mode 100644
index 0000000..f3248c1
Binary files /dev/null and b/fonts/OpenSans-BoldItalic-webfont.woff differ
diff --git a/fonts/OpenSans-Italic-webfont.eot b/fonts/OpenSans-Italic-webfont.eot
new file mode 100644
index 0000000..277c189
Binary files /dev/null and b/fonts/OpenSans-Italic-webfont.eot differ
diff --git a/fonts/OpenSans-Italic-webfont.svg b/fonts/OpenSans-Italic-webfont.svg
new file mode 100644
index 0000000..29c7497
--- /dev/null
+++ b/fonts/OpenSans-Italic-webfont.svg
@@ -0,0 +1,146 @@
+<?xml version="1.0" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
+<svg xmlns="http://www.w3.org/2000/svg">
+<metadata>
+This is a custom SVG webfont generated by Font Squirrel.
+Copyright   : Digitized data copyright  20102011 Google Corporation
+Foundry     : Ascender Corporation
+Foundry URL : httpwwwascendercorpcom
+</metadata>
+<defs>
+<font id="OpenSansItalic" horiz-adv-x="1128" >
+<font-face units-per-em="2048" ascent="1638" descent="-410" />
+<missing-glyph horiz-adv-x="532" />
+<glyph unicode=" "  horiz-adv-x="532" />
+<glyph unicode="&#x09;" horiz-adv-x="532" />
+<glyph unicode="&#xa0;" horiz-adv-x="532" />
+<glyph unicode="!" horiz-adv-x="530" d="M43 78q0 76 39.5 120t107.5 44q45 0 73 -27.5t28 -81.5q0 -68 -39 -115t-105 -47q-49 0 -76.5 28t-27.5 79zM172 403q49 307 176 1059h207l-274 -1059h-109z" />
+<glyph unicode="&#x22;" horiz-adv-x="791" d="M225 934l72 528h188l-153 -528h-107zM573 934l72 528h189l-154 -528h-107z" />
+<glyph unicode="#" horiz-adv-x="1323" d="M63 430l13 129h284l101 340h-277l13 127h301l123 436h139l-125 -436h305l127 436h133l-125 -436h264l-12 -127h-291l-98 -340h285l-13 -129h-309l-125 -430h-139l129 430h-303l-127 -430h-133l121 430h-261zM500 559h303l96 340h-303z" />
+<glyph unicode="$" d="M72 176v154q82 -41 175.5 -63.5t166.5 -22.5l98 452q-139 49 -201.5 123.5t-62.5 188.5q0 159 108 255t299 113l39 176h133l-39 -178q159 -12 283 -76l-63 -135q-121 63 -248 72l-94 -440q149 -55 212.5 -125t63.5 -178q0 -162 -112.5 -263t-309.5 -123l-49 -225h-133 l49 223q-195 14 -315 72zM401 1010q0 -53 34.5 -97.5t107.5 -70.5l84 393q-108 -11 -167 -69t-59 -156zM549 250q107 13 170 75t63 154q0 54 -33 96t-114 74z" />
+<glyph unicode="%" horiz-adv-x="1624" d="M168 860q0 166 50.5 318.5t136.5 228.5t200 76q116 0 176 -72t60 -205q0 -108 -32 -237.5t-82.5 -217.5t-120.5 -137t-157 -49q-109 0 -170 75t-61 220zM231 0l1086 1462h151l-1085 -1462h-152zM307 864q0 -172 107 -172q52 0 94 39.5t73.5 114t50.5 175t19 171.5 q0 166 -108 166q-66 0 -119 -63t-85 -187.5t-32 -243.5zM909 274q0 166 50.5 318.5t136.5 228.5t200 76q116 0 176 -71.5t60 -204.5q0 -107 -31.5 -236t-82 -217.5t-121 -138t-156.5 -49.5q-110 0 -171 74.5t-61 219.5zM1049 279q0 -173 106 -173q65 0 117 65t86.5 198.5 t34.5 236.5q0 166 -109 166q-67 0 -119.5 -64.5t-84 -188.5t-31.5 -240z" />
+<glyph unicode="&#x26;" horiz-adv-x="1372" d="M66 342q0 148 90 257.5t303 211.5q-103 165 -103 309q0 164 106 264.5t281 100.5q149 0 236.5 -79t87.5 -212q0 -78 -32.5 -137t-87.5 -108t-127.5 -90t-153.5 -83l278 -389q127 110 199 295h168q-101 -236 -283 -412l203 -270h-201l-117 166q-120 -100 -230 -143 t-247 -43q-168 0 -269 96t-101 266zM229 354q0 -106 66.5 -170.5t175.5 -64.5q87 0 168 33t195 124l-306 433q-128 -67 -184 -116t-85.5 -107.5t-29.5 -131.5zM516 1118q0 -120 82 -235q139 71 191 110t83 85t31 104q0 77 -42.5 121.5t-123.5 44.5q-105 0 -163 -60t-58 -170 z" />
+<glyph unicode="'" horiz-adv-x="444" d="M225 934l72 528h188l-153 -528h-107z" />
+<glyph unicode="(" horiz-adv-x="584" d="M82 272q0 339 120 627t384 563h157q-246 -270 -371.5 -570t-125.5 -618q0 -339 114 -598h-131q-147 266 -147 596z" />
+<glyph unicode=")" horiz-adv-x="584" d="M-160 -324q496 551 496 1188q0 341 -113 598h131q146 -269 146 -598q0 -341 -121.5 -629.5t-382.5 -558.5h-156z" />
+<glyph unicode="*" horiz-adv-x="1130" d="M215 1194l55 154l371 -185l41 400l172 -35l-123 -383l422 18l-8 -157l-393 47l180 -383l-166 -52l-113 406l-258 -344l-116 121l309 284z" />
+<glyph unicode="+" d="M127 651v142h389v391h141v-391h390v-142h-390v-387h-141v387h-389z" />
+<glyph unicode="," horiz-adv-x="492" d="M-100 -264q126 286 204 502h187l8 -23q-113 -235 -270 -479h-129z" />
+<glyph unicode="-" horiz-adv-x="639" d="M55 469l35 158h479l-34 -158h-480z" />
+<glyph unicode="." horiz-adv-x="518" d="M43 74q0 77 40.5 122.5t111.5 45.5q43 0 69.5 -26t26.5 -79q0 -71 -40 -118.5t-108 -47.5q-46 0 -73 26t-27 77z" />
+<glyph unicode="/" horiz-adv-x="717" d="M-94 0l813 1462h174l-813 -1462h-174z" />
+<glyph unicode="0" d="M121 477q0 270 82 514.5t216.5 369t307.5 124.5q365 0 365 -471q0 -295 -78.5 -539t-214 -369.5t-314.5 -125.5q-176 0 -270 127.5t-94 369.5zM293 479q0 -172 50 -264t161 -92q115 0 209 114t150.5 328t56.5 453q0 323 -203 323q-113 0 -209 -115.5t-155.5 -323 t-59.5 -423.5z" />
+<glyph unicode="1" d="M303 1178l449 284h149l-313 -1462h-172l196 913q59 261 88 359q-50 -53 -139 -111l-178 -110z" />
+<glyph unicode="2" d="M12 0l31 147l465 420q102 93 176.5 163.5t123 133t72 124t23.5 136.5q0 99 -60 157t-163 58q-77 0 -150.5 -28.5t-162.5 -96.5l-82 115q191 154 413 154q176 0 278.5 -88.5t102.5 -243.5q0 -111 -39.5 -204t-131 -197t-294.5 -281l-352 -307v-8h678l-29 -154h-899z" />
+<glyph unicode="3" d="M47 59v164q94 -49 199 -75.5t190 -26.5q162 0 252 79.5t90 217.5q0 131 -79 198.5t-220 67.5h-131l31 143h139q165 0 274 87t109 227q0 92 -58 146t-157 54q-80 0 -157 -27t-175 -93l-80 118q195 144 424 144q179 0 277 -87t98 -237q0 -156 -101 -264.5t-280 -140.5v-9 q124 -23 195 -106.5t71 -208.5q0 -133 -62 -234.5t-181 -158.5t-283 -57q-210 0 -385 79z" />
+<glyph unicode="4" d="M16 334l29 158l834 978h196l-207 -983h232l-33 -153h-233l-72 -334h-164l74 334h-656zM219 487h486q46 220 78 373t116 445h-8q-17 -29 -66.5 -96.5t-72.5 -96.5z" />
+<glyph unicode="5" d="M80 59v164q164 -102 334 -102q191 0 298 96t107 268q0 126 -73.5 199.5t-204.5 73.5q-48 0 -97 -6.5t-139 -30.5l-74 57l197 684h668l-33 -153h-522l-127 -439q87 23 184 23q182 0 289.5 -104.5t107.5 -282.5q0 -161 -73 -283t-204 -182.5t-308 -60.5q-193 0 -330 79z " />
+<glyph unicode="6" d="M133 424q0 209 60.5 415t163.5 351.5t246 219t327 73.5q111 0 184 -23l-35 -145q-68 22 -170 22q-212 0 -356.5 -149t-212.5 -443h8q59 79 146.5 126t193.5 47q154 0 244 -98.5t90 -270.5q0 -161 -66.5 -294.5t-180.5 -204t-261 -70.5q-182 0 -281.5 115t-99.5 329z M299 416q0 -137 60.5 -216t172.5 -79q94 0 167.5 54t114 149t40.5 208q0 248 -221 248q-66 0 -128 -28.5t-110 -76t-72 -104.5t-24 -155z" />
+<glyph unicode="7" d="M174 0l768 1313h-719l31 149h891l-27 -139l-764 -1323h-180z" />
+<glyph unicode="8" d="M96 346q0 148 95 256t296 184q-95 69 -135.5 144.5t-40.5 171.5q0 111 54.5 198.5t153.5 136t222 48.5q174 0 271.5 -86.5t97.5 -235.5q0 -129 -78 -225t-266 -176q127 -78 180 -165t53 -202q0 -122 -60 -217.5t-172.5 -146.5t-264.5 -51q-190 0 -298 98.5t-108 267.5z M270 354q0 -107 69 -170t181 -63q139 0 222 74t83 196q0 99 -52 174t-165 135q-185 -60 -261.5 -143.5t-76.5 -202.5zM479 1100q0 -82 39 -144t127 -116q161 60 228 131.5t67 173.5q0 90 -57.5 143t-153.5 53q-114 0 -182 -65.5t-68 -175.5z" />
+<glyph unicode="9" d="M98 14v158q134 -47 246 -47q202 0 327 141t189 441h-10q-51 -75 -132.5 -118.5t-180.5 -43.5q-169 0 -261 98.5t-92 288.5q0 153 64.5 280.5t180 199t259.5 71.5q180 0 279.5 -114.5t99.5 -334.5q0 -194 -56 -406.5t-147.5 -360t-221.5 -217.5t-302 -70q-136 0 -242 34z M350 938q0 -124 54.5 -190t162.5 -66q76 0 140 28.5t108.5 81.5t65 114t20.5 151q0 131 -59 207.5t-160 76.5q-150 0 -241 -113t-91 -290z" />
+<glyph unicode=":" horiz-adv-x="518" d="M43 74q0 77 40.5 122.5t111.5 45.5q43 0 69.5 -26t26.5 -79q0 -71 -40 -118.5t-108 -47.5q-46 0 -73 26t-27 77zM203 956q0 77 40 122.5t111 45.5q97 0 97 -104q0 -73 -41.5 -119.5t-106.5 -46.5q-46 0 -73 26.5t-27 75.5z" />
+<glyph unicode=";" horiz-adv-x="518" d="M-100 -264q126 286 204 502h187l8 -23q-113 -235 -270 -479h-129zM203 956q0 77 40 122.5t111 45.5q97 0 97 -104q0 -73 -41.5 -119.5t-106.5 -46.5q-46 0 -73 26.5t-27 75.5z" />
+<glyph unicode="&#x3c;" d="M121 664v98l919 479v-149l-747 -371l747 -328v-151z" />
+<glyph unicode="=" d="M127 444v142h920v-142h-920zM127 858v139h920v-139h-920z" />
+<glyph unicode="&#x3e;" d="M121 242v151l745 328l-745 371v149l919 -479v-98z" />
+<glyph unicode="?" horiz-adv-x="874" d="M158 74q0 77 40 122.5t111 45.5q44 0 70.5 -26t26.5 -79q0 -73 -41.5 -119.5t-106.5 -46.5q-46 0 -73 26t-27 77zM197 1382q92 51 192 76t182 25q167 0 259 -84t92 -238q0 -123 -65.5 -226.5t-225.5 -223.5q-125 -91 -169 -147.5t-67 -160.5h-135q22 130 72.5 213.5 t165.5 174.5q128 100 168 144t63 94t23 112q0 93 -51.5 143.5t-147.5 50.5q-81 0 -155 -25.5t-140 -56.5z" />
+<glyph unicode="@" horiz-adv-x="1735" d="M111 504q0 261 126.5 485.5t343.5 347.5t486 123q191 0 329 -75.5t210.5 -213.5t72.5 -319q0 -179 -55 -324t-155 -227t-222 -82q-197 0 -213 184h-8q-111 -184 -291 -184q-115 0 -180.5 75.5t-65.5 209.5q0 157 68 284t188.5 199t260.5 72q65 0 127.5 -12t150.5 -48 q-64 -242 -98 -368t-31 -172q0 -117 102 -117q78 0 141.5 67t100.5 183.5t37 243.5q0 239 -128 367t-370 128q-228 0 -406.5 -107t-277 -295.5t-98.5 -416.5q0 -270 143.5 -418.5t409.5 -148.5q197 0 420 86v-127q-219 -90 -443 -90q-314 0 -494.5 184.5t-180.5 505.5z M639 518q0 -93 33 -134.5t98 -41.5q187 0 272 315l70 258q-63 23 -127 23q-94 0 -174 -55t-126 -153t-46 -212z" />
+<glyph unicode="A" horiz-adv-x="1137" d="M-117 0l799 1462h174l184 -1462h-170l-57 465h-496l-245 -465h-189zM401 621h394l-35 299q-24 179 -29 350q-37 -88 -80.5 -175t-249.5 -474z" />
+<glyph unicode="B" horiz-adv-x="1225" d="M86 0l309 1462h375q432 0 432 -336q0 -141 -87 -238t-245 -126v-10q115 -32 176.5 -110.5t61.5 -188.5q0 -212 -152 -332.5t-407 -120.5h-463zM287 145h266q181 0 278 80.5t97 227.5q0 116 -74.5 177.5t-214.5 61.5h-236zM434 836h248q156 0 249 73t93 199 q0 104 -66.5 155.5t-209.5 51.5h-211z" />
+<glyph unicode="C" horiz-adv-x="1198" d="M150 537q0 261 105.5 485.5t283.5 342.5t403 118q197 0 348 -80l-69 -141q-138 69 -279 69q-174 0 -311.5 -97t-218 -284.5t-80.5 -408.5q0 -187 97.5 -298.5t268.5 -111.5q139 0 322 57v-149q-86 -31 -164 -45t-188 -14q-242 0 -380 149.5t-138 407.5z" />
+<glyph unicode="D" horiz-adv-x="1364" d="M86 0l309 1462h342q276 0 419.5 -149.5t143.5 -435.5q0 -261 -105 -461t-300 -308t-457 -108h-352zM287 147h162q202 0 355 91.5t234.5 258.5t81.5 382t-103 325.5t-302 110.5h-178z" />
+<glyph unicode="E" horiz-adv-x="1047" d="M86 0l309 1462h735l-32 -153h-566l-98 -469h527l-29 -152h-529l-114 -536h565l-33 -152h-735z" />
+<glyph unicode="F" horiz-adv-x="967" d="M86 0l309 1462h735l-30 -153h-568l-110 -533h528l-32 -153h-529l-131 -623h-172z" />
+<glyph unicode="G" horiz-adv-x="1386" d="M150 528q0 269 101.5 489.5t281.5 343t399 122.5q117 0 219.5 -20t206.5 -64l-66 -152q-77 34 -165.5 59t-194.5 25q-169 0 -307.5 -101.5t-215.5 -283.5t-77 -407q0 -190 102.5 -299t286.5 -109q154 0 260 39l96 444h-289l33 152h459l-154 -711q-216 -75 -419 -75 q-264 0 -410.5 144.5t-146.5 403.5z" />
+<glyph unicode="H" horiz-adv-x="1389" d="M86 0l309 1462h170l-131 -622h660l133 622h168l-310 -1462h-167l143 688h-660l-145 -688h-170z" />
+<glyph unicode="I" horiz-adv-x="559" d="M86 0l311 1462h168l-311 -1462h-168z" />
+<glyph unicode="J" horiz-adv-x="547" d="M-319 -360l6 147q69 -20 145 -20q100 0 165.5 62.5t90.5 182.5l307 1450h170l-309 -1468q-79 -379 -422 -379q-105 0 -153 25z" />
+<glyph unicode="K" horiz-adv-x="1141" d="M86 0l309 1462h170l-151 -710l700 710h209l-639 -637l350 -825h-186q-72 181 -146.5 359.5t-146.5 361.5l-174 -131l-125 -590h-170z" />
+<glyph unicode="L" horiz-adv-x="971" d="M86 0l309 1462h170l-276 -1308h565l-33 -154h-735z" />
+<glyph unicode="M" horiz-adv-x="1714" d="M84 0l309 1462h244l149 -1204h9l659 1204h266l-303 -1462h-174q126 590 193 905.5t94 392.5h-6l-717 -1298h-131l-166 1296h-8q-7 -72 -28.5 -197.5t-37.5 -199.5l-190 -899h-162z" />
+<glyph unicode="N" horiz-adv-x="1438" d="M84 0l309 1462h180l459 -1220h6q30 224 72 405l174 815h164l-309 -1462h-181l-460 1223h-6q-32 -221 -74 -418l-172 -805h-162z" />
+<glyph unicode="O" horiz-adv-x="1475" d="M150 549q0 264 96 482t263.5 336t377.5 118q244 0 384 -154t140 -424q0 -269 -88 -481.5t-252 -329t-379 -116.5q-256 0 -399 149.5t-143 419.5zM332 553q0 -199 98 -310.5t266 -111.5q152 0 272.5 97.5t190.5 279.5t70 403q0 199 -94 310.5t-261 111.5q-157 0 -281 -101 t-192.5 -281t-68.5 -398z" />
+<glyph unicode="P" horiz-adv-x="1159" d="M86 0l309 1462h330q214 0 324 -94.5t110 -282.5q0 -248 -164 -379t-481 -131h-135l-123 -575h-170zM410 721h133q216 0 328 91t112 267q0 125 -69.5 180.5t-213.5 55.5h-163z" />
+<glyph unicode="Q" horiz-adv-x="1475" d="M150 549q0 264 96 482t263.5 336t377.5 118q244 0 384 -154t140 -424q0 -333 -139 -576t-375 -321l274 -358h-219l-227 330l-17 -2h-16q-256 0 -399 149.5t-143 419.5zM332 553q0 -199 98 -310.5t266 -111.5q158 0 279 100t187.5 280.5t66.5 399.5q0 199 -94 310.5 t-261 111.5q-157 0 -281 -101t-192.5 -281t-68.5 -398z" />
+<glyph unicode="R" horiz-adv-x="1165" d="M86 0l309 1462h320q446 0 446 -366q0 -348 -368 -449l239 -647h-186l-209 608h-252l-129 -608h-170zM416 754h168q193 0 297 85t104 244q0 121 -67.5 175.5t-219.5 54.5h-166q-102 -494 -116 -559z" />
+<glyph unicode="S" horiz-adv-x="1028" d="M39 43v170q162 -84 340 -84q162 0 257 75.5t95 207.5q0 78 -52.5 137.5t-195.5 140.5q-151 85 -209.5 170t-58.5 201q0 187 132 304.5t347 117.5q99 0 184.5 -19t180.5 -65l-66 -150q-66 38 -148 60t-151 22q-134 0 -215.5 -69.5t-81.5 -188.5q0 -54 17 -92.5t54 -72.5 t142 -95q147 -88 198.5 -138t78 -110.5t26.5 -140.5q0 -211 -140.5 -327.5t-395.5 -116.5q-106 0 -186.5 14.5t-151.5 48.5z" />
+<glyph unicode="T" horiz-adv-x="1020" d="M186 1311l33 151h985l-30 -151h-408l-279 -1311h-172l277 1311h-406z" />
+<glyph unicode="U" horiz-adv-x="1384" d="M164 383q0 81 24 201l189 878h170l-191 -891q-22 -106 -22 -188q0 -117 73 -184.5t218 -67.5q172 0 267.5 87.5t139.5 289.5l205 954h170l-205 -966q-55 -263 -197.5 -389.5t-388.5 -126.5q-230 0 -341 104t-111 299z" />
+<glyph unicode="V" horiz-adv-x="1122" d="M188 1462h170l97 -930q20 -196 20 -335h4q61 144 162 338l479 927h191l-781 -1462h-180z" />
+<glyph unicode="W" horiz-adv-x="1745" d="M223 1462h170l31 -901l2 -88q0 -98 -10 -258h6q89 243 156 383l405 864h178l43 -860q9 -153 9 -304l-1 -83h9q75 224 131 354l387 893h182l-664 -1462h-170l-49 965q-8 136 -8 282h-6q-25 -72 -61 -154.5t-504 -1092.5h-174z" />
+<glyph unicode="X" horiz-adv-x="1063" d="M-104 0l596 776l-263 686h172l203 -563l443 563h186l-555 -694l278 -768h-180l-213 641l-481 -641h-186z" />
+<glyph unicode="Y" horiz-adv-x="1030" d="M188 1462h170l179 -747l489 747h193l-627 -921l-113 -541h-172l119 549z" />
+<glyph unicode="Z" horiz-adv-x="1087" d="M-16 0l28 137l924 1170h-655l32 155h858l-26 -139l-924 -1169h697l-33 -154h-901z" />
+<glyph unicode="[" horiz-adv-x="586" d="M-16 -324l381 1786h387l-31 -141h-227l-318 -1503h227l-32 -142h-387z" />
+<glyph unicode="\" horiz-adv-x="717" d="M221 1462h154l217 -1462h-154z" />
+<glyph unicode="]" horiz-adv-x="586" d="M-150 -324l31 142h225l320 1503h-227l30 141h389l-380 -1786h-388z" />
+<glyph unicode="^" horiz-adv-x="1059" d="M53 553l598 920h109l266 -920h-145l-201 747l-467 -747h-160z" />
+<glyph unicode="_" horiz-adv-x="807" d="M-188 -324l30 140h811l-30 -140h-811z" />
+<glyph unicode="`" horiz-adv-x="1135" d="M575 1548v21h181q43 -136 147 -303v-25h-104q-61 61 -128.5 154t-95.5 153z" />
+<glyph unicode="a" horiz-adv-x="1157" d="M98 350q0 208 71 386t196 279t274 101q92 0 164 -49.5t112 -142.5h11l67 172h127l-233 -1096h-133l26 209h-8q-179 -229 -377 -229q-139 0 -218 99t-79 271zM270 346q0 -114 47 -170.5t132 -56.5q97 0 193 92.5t156 241t60 297.5q0 103 -56 164t-147 61 q-104 0 -193.5 -86t-140.5 -233t-51 -310z" />
+<glyph unicode="b" horiz-adv-x="1182" d="M59 0l330 1556h168q-51 -242 -78.5 -370.5t-75.5 -300.5h9q93 118 183.5 173.5t186.5 55.5q141 0 220 -99t79 -272q0 -209 -68.5 -386.5t-191 -277t-276.5 -99.5q-97 0 -170.5 51t-110.5 139h-10l-70 -170h-125zM319 346q0 -110 55.5 -168.5t160.5 -58.5q99 0 184.5 81 t137.5 230.5t52 317.5q0 227 -178 227q-96 0 -195.5 -95t-158 -239t-58.5 -295z" />
+<glyph unicode="c" horiz-adv-x="922" d="M98 389q0 200 74 369t204.5 263.5t293.5 94.5q137 0 268 -51l-47 -141q-120 51 -219 51q-112 0 -204.5 -76.5t-145 -213t-52.5 -296.5q0 -128 66.5 -199t183.5 -71q72 0 136 20t126 47v-143q-124 -63 -276 -63q-194 0 -301 107t-107 302z" />
+<glyph unicode="d" horiz-adv-x="1182" d="M98 350q0 214 72 392t194.5 275t274.5 97q194 0 281 -190h10q17 155 45 274l78 358h166l-330 -1556h-139l22 209h-8q-101 -125 -189 -177t-182 -52q-139 0 -217 98t-78 272zM270 346q0 -227 179 -227q94 0 194 93.5t158.5 239t58.5 296.5q0 111 -54 169t-157 58 q-101 0 -187.5 -82.5t-139 -232t-52.5 -314.5z" />
+<glyph unicode="e" horiz-adv-x="1010" d="M98 391q0 188 74.5 360.5t197.5 268.5t271 96q153 0 230 -66.5t77 -185.5q0 -180 -166 -282.5t-475 -102.5h-33l-4 -80q0 -131 61.5 -204.5t190.5 -73.5q63 0 129.5 18t165.5 66v-146q-94 -44 -166 -61.5t-159 -17.5q-184 0 -289 109t-105 302zM299 618h12 q228 0 349.5 59.5t121.5 172.5q0 53 -36.5 88t-114.5 35q-103 0 -193.5 -94t-138.5 -261z" />
+<glyph unicode="f" horiz-adv-x="641" d="M-229 -330q64 -22 112 -22q76 0 117 62t66 177l227 1082h-193l13 67l206 66l23 100q46 200 127.5 282.5t241.5 82.5q40 0 98 -11.5t90 -25.5l-43 -129q-76 29 -137 29q-87 0 -133.5 -48.5t-75.5 -177.5l-25 -108h238l-25 -127h-237l-232 -1098q-39 -189 -120 -276 t-213 -87q-69 0 -125 21v141z" />
+<glyph unicode="g" horiz-adv-x="1026" d="M-127 -211q0 105 72 182t233 131q-78 41 -78 121q0 69 51 118.5t142 92.5q-63 32 -103 94.5t-40 145.5q0 194 119.5 318t305.5 124q78 0 154 -20h371l-25 -107l-211 -24q41 -62 41 -158q0 -191 -116.5 -304.5t-311.5 -113.5q-55 0 -84 8q-139 -53 -139 -131 q0 -41 33 -54.5t96 -21.5l117 -14q181 -22 262.5 -88t81.5 -194q0 -184 -146 -285t-411 -101q-194 0 -304 73.5t-110 207.5zM35 -195q0 -77 65 -122t193 -45q182 0 284.5 63.5t102.5 179.5q0 62 -54 98t-184 50l-159 16q-120 -25 -184 -88t-64 -152zM313 680 q0 -85 45 -129.5t125 -44.5q79 0 138 42t90.5 115.5t31.5 159.5q0 82 -44 125t-126 43q-78 0 -136.5 -40.5t-91 -113t-32.5 -157.5z" />
+<glyph unicode="h" horiz-adv-x="1182" d="M59 0l330 1556h168q-18 -82 -34.5 -159t-34 -156.5t-38 -166.5t-47.5 -189h11q94 123 185.5 176t191.5 53q131 0 202.5 -72t71.5 -204q0 -62 -23 -166q-39 -193 -145 -672h-168l148 692q18 94 18 135q0 148 -147 148q-89 0 -173.5 -59t-149 -171.5t-97.5 -271.5 l-101 -473h-168z" />
+<glyph unicode="i" horiz-adv-x="520" d="M59 0l234 1096h168l-234 -1096h-168zM340 1376q0 56 32 91.5t83 35.5q88 0 88 -90q0 -55 -33.5 -93t-77.5 -38q-40 0 -66 24.5t-26 69.5z" />
+<glyph unicode="j" horiz-adv-x="520" d="M-258 -330q61 -22 119 -22q125 0 168 205l264 1243h166l-266 -1258q-36 -171 -114.5 -250.5t-213.5 -79.5q-69 0 -123 21v141zM340 1376q0 56 32 91.5t83 35.5q86 0 86 -90q0 -55 -33.5 -93t-77.5 -38q-38 0 -64 24.5t-26 69.5z" />
+<glyph unicode="k" horiz-adv-x="999" d="M57 0l330 1556h170l-129 -602q-57 -266 -102 -395h4l526 537h201l-469 -467l295 -629h-187l-235 524l-152 -123l-82 -401h-170z" />
+<glyph unicode="l" horiz-adv-x="520" d="M57 0l332 1556h168l-332 -1556h-168z" />
+<glyph unicode="m" horiz-adv-x="1786" d="M59 0l234 1096h139l-22 -203h10q87 119 173.5 171t178.5 52q113 0 174 -65t72 -181h8q86 125 183 185.5t196 60.5q127 0 196.5 -68t69.5 -198q0 -68 -22 -178l-144 -672h-170l148 692q20 104 20 146q0 62 -34.5 99.5t-108.5 37.5q-81 0 -160 -58t-138.5 -164.5 t-90.5 -252.5l-107 -500h-168l148 692q18 94 18 135q0 70 -31 109t-106 39q-84 0 -163.5 -60t-140 -171.5t-93.5 -268.5l-101 -475h-168z" />
+<glyph unicode="n" horiz-adv-x="1182" d="M59 0l234 1096h139l-22 -203h10q96 122 185.5 172.5t185.5 50.5q127 0 200.5 -69.5t73.5 -194.5q0 -79 -23 -180l-143 -672h-170l148 692q20 104 20 144q0 63 -35.5 101t-113.5 38q-89 0 -173.5 -60t-149 -171t-97.5 -269l-101 -475h-168z" />
+<glyph unicode="o" horiz-adv-x="1149" d="M98 406q0 190 73 357.5t197 257t275 89.5q190 0 300 -112.5t110 -309.5q0 -188 -72 -355t-195 -258t-278 -91q-192 0 -301 113t-109 309zM270 397q0 -131 63.5 -202.5t182.5 -71.5q104 0 187 73t129.5 207.5t46.5 307.5q0 115 -62.5 186.5t-169.5 71.5q-109 0 -195.5 -74 t-134 -205.5t-47.5 -292.5z" />
+<glyph unicode="p" horiz-adv-x="1182" d="M-43 -492l336 1588h139l-26 -209h8q179 227 372 227q137 0 216 -97.5t79 -273.5q0 -212 -69 -389t-191 -275.5t-276 -98.5q-97 0 -170 50t-113 140h-10l-4 -38q-3 -25 -10.5 -70t-114.5 -554h-166zM319 346q0 -110 55.5 -168.5t160.5 -58.5q99 0 184.5 81t137.5 230.5 t52 317.5q0 227 -178 227q-96 0 -195.5 -95t-158 -239t-58.5 -295z" />
+<glyph unicode="q" horiz-adv-x="1182" d="M98 350q0 212 72.5 392t196 277t274.5 97q94 0 165.5 -50.5t108.5 -141.5h13l67 172h125l-336 -1588h-166l101 480q9 45 57 221h-8q-95 -121 -185 -175t-186 -54q-140 0 -219.5 97.5t-79.5 272.5zM270 346q0 -227 179 -227q92 0 190 92t158.5 237t60.5 300 q0 105 -54.5 166t-152.5 61q-101 0 -189 -84.5t-140 -233t-52 -311.5z" />
+<glyph unicode="r" horiz-adv-x="811" d="M59 0l234 1096h139l-22 -203h10q72 95 119 136.5t98.5 64t114.5 22.5q69 0 120 -14l-36 -150q-53 13 -105 13q-91 0 -170.5 -60t-139 -166.5t-87.5 -236.5l-107 -502h-168z" />
+<glyph unicode="s" horiz-adv-x="877" d="M8 49v158q70 -42 151 -65t150 -23q126 0 190 50t64 128q0 57 -35 96t-151 107q-130 73 -184 143t-54 166q0 138 101 222.5t266 84.5q171 0 330 -74l-54 -137l-56 25q-101 43 -220 43q-93 0 -146 -43.5t-53 -112.5q0 -56 35.5 -96t146.5 -103q107 -60 153.5 -103 t69.5 -92.5t23 -111.5q0 -156 -110.5 -243.5t-311.5 -87.5q-169 0 -305 69z" />
+<glyph unicode="t" horiz-adv-x="664" d="M90 969l14 73l185 78l125 228h98l-55 -252h274l-26 -127h-273l-129 -604q-18 -87 -18 -132q0 -56 29 -86t81 -30q55 0 144 26v-129q-34 -14 -84 -24t-80 -10q-125 0 -191.5 59.5t-66.5 177.5q0 66 18 150l127 602h-172z" />
+<glyph unicode="u" horiz-adv-x="1182" d="M113 248q0 62 22 172l146 676h170l-150 -695q-18 -89 -18 -139q0 -143 147 -143q88 0 173 60t150 172t99 270l100 475h166l-231 -1096h-139l22 203h-12q-98 -125 -187 -174t-184 -49q-128 0 -201 69.5t-73 198.5z" />
+<glyph unicode="v" horiz-adv-x="946" d="M98 1096h168l64 -613q24 -258 24 -362h6q127 275 179 371l325 604h178l-591 -1096h-228z" />
+<glyph unicode="w" horiz-adv-x="1468" d="M117 1096h164l18 -594v-88q0 -147 -8 -269h6q47 124 137 322l295 629h182l37 -594q6 -168 6 -262v-53l-2 -42h6q28 86 83 218.5t323 732.5h178l-506 -1096h-205l-32 602q-4 94 -4 172v156h-9l-50 -118l-83 -189l-291 -623h-202z" />
+<glyph unicode="x" horiz-adv-x="979" d="M-74 0l475 565l-239 531h170l174 -412l330 412h194l-455 -539l252 -557h-168l-192 434l-346 -434h-195z" />
+<glyph unicode="y" horiz-adv-x="946" d="M-197 -336q63 -18 131 -18q82 0 140.5 50.5t113.5 149.5l76 136l-166 1114h168l74 -545q10 -69 19.5 -203.5t9.5 -216.5h6q35 87 87 200t77 156l325 609h178l-696 -1282q-93 -172 -184 -239t-219 -67q-72 0 -140 21v135z" />
+<glyph unicode="z" horiz-adv-x="909" d="M-29 0l23 117l694 854h-479l27 125h657l-29 -140l-680 -831h531l-25 -125h-719z" />
+<glyph unicode="{" horiz-adv-x="715" d="M27 514l32 143q118 0 189.5 43.5t93.5 147.5l68 326q34 160 117.5 224t254.5 64h33l-31 -141q-105 0 -151 -36.5t-66 -123.5l-71 -321q-28 -123 -91 -184t-167 -78v-5q151 -41 151 -213q0 -59 -18 -131l-47 -211q-15 -58 -15 -98q0 -53 36.5 -77.5t119.5 -24.5v-142h-23 q-141 0 -216.5 52.5t-75.5 171.5q0 52 20 141q33 146 51.5 227.5t14.5 102.5q0 143 -209 143z" />
+<glyph unicode="|" d="M541 -496v2052h139v-2052h-139z" />
+<glyph unicode="}" horiz-adv-x="715" d="M-74 -182q115 0 167 36t71 123l72 322q25 117 88 179.5t170 80.5v6q-150 42 -150 211q0 59 18 131l50 213q14 65 14 99q0 53 -40.5 77.5t-139.5 24.5l28 141h11q144 0 220.5 -52.5t76.5 -170.5q0 -48 -21 -141l-49 -219q-16 -68 -16 -111q0 -143 209 -143l-33 -144 q-119 0 -190 -43t-93 -147l-67 -326q-36 -164 -119 -226.5t-264 -62.5h-13v142z" />
+<glyph unicode="~" d="M115 592v151q98 109 243 109q69 0 127 -14.5t144 -51.5q64 -27 112.5 -41t98.5 -14q55 0 119.5 33t115.5 88v-150q-100 -110 -244 -110q-72 0 -135 16.5t-135 48.5q-75 32 -120 44t-93 12q-54 0 -118.5 -34.5t-114.5 -86.5z" />
+<glyph unicode="&#xa2;" d="M225 590q0 185 63.5 344t178.5 258.5t260 120.5l35 170h123l-37 -168q119 -9 217 -49l-47 -142q-109 52 -219 52q-112 0 -204.5 -76.5t-145 -213t-52.5 -296.5q0 -125 66 -198t184 -73q72 0 136 20t126 48v-143q-123 -62 -286 -66l-41 -198h-125l43 215 q-132 34 -203.5 137.5t-71.5 257.5z" />
+<glyph unicode="&#xa3;" d="M-23 0l27 141q205 46 258 289l47 221h-200l26 127h201l76 350q75 353 430 353q184 0 336 -86l-66 -133q-146 79 -278 79q-213 0 -263 -237l-69 -326h370l-26 -127h-371l-47 -219q-22 -98 -66 -166.5t-124 -111.5h725l-33 -154h-953z" />
+<glyph unicode="&#xa5;" d="M127 266l29 133h290l33 160h-291l29 133h225l-202 770h163l179 -747l491 747h187l-533 -770h231l-28 -133h-297l-33 -160h297l-29 -133h-295l-57 -266h-154l56 266h-291z" />
+<glyph unicode="&#xa9;" horiz-adv-x="1704" d="M139 731q0 200 100 375t275 276t377 101q197 0 370 -97t277 -272t104 -383q0 -204 -100.5 -376.5t-273 -273.5t-377.5 -101q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM244 731q0 -173 87 -323.5t237.5 -237t322.5 -86.5q174 0 323 87t236.5 235.5t87.5 324.5 q0 174 -87 323t-235.5 236.5t-324.5 87.5q-174 0 -323 -87t-236.5 -235.5t-87.5 -324.5zM520 733q0 208 110 330.5t300 122.5q130 0 248 -60l-60 -120q-106 53 -190 53q-125 0 -191.5 -87t-66.5 -241q0 -169 65 -249.5t193 -80.5q82 0 211 43v-122q-66 -28 -113 -38 t-104 -10q-192 0 -297 119.5t-105 339.5z" />
+<glyph unicode="&#xad;" horiz-adv-x="639" d="M55 469l35 158h479l-34 -158h-480z" />
+<glyph unicode="&#xae;" horiz-adv-x="1704" d="M139 731q0 200 100 375t275 276t377 101q197 0 370 -97t277 -272t104 -383q0 -204 -100.5 -376.5t-273 -273.5t-377.5 -101q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM244 731q0 -173 87 -323.5t237.5 -237t322.5 -86.5q174 0 323 87t236.5 235.5t87.5 324.5 q0 174 -87 323t-235.5 236.5t-324.5 87.5q-174 0 -323 -87t-236.5 -235.5t-87.5 -324.5zM645 291v880h229q163 0 241.5 -63t78.5 -193q0 -78 -47.5 -141t-132.5 -98l227 -385h-149l-207 352h-113v-352h-127zM772 762h92q195 0 195 149q0 76 -47.5 107t-149.5 31h-90v-287z " />
+<glyph unicode="&#xb4;" horiz-adv-x="1135" d="M532 1241v27q56 60 125.5 151.5t106.5 149.5h190v-21q-38 -49 -140 -151t-177 -156h-105z" />
+<glyph unicode="&#x2000;" horiz-adv-x="784" />
+<glyph unicode="&#x2001;" horiz-adv-x="1569" />
+<glyph unicode="&#x2002;" horiz-adv-x="784" />
+<glyph unicode="&#x2003;" horiz-adv-x="1569" />
+<glyph unicode="&#x2004;" horiz-adv-x="523" />
+<glyph unicode="&#x2005;" horiz-adv-x="392" />
+<glyph unicode="&#x2006;" horiz-adv-x="261" />
+<glyph unicode="&#x2007;" horiz-adv-x="261" />
+<glyph unicode="&#x2008;" horiz-adv-x="196" />
+<glyph unicode="&#x2009;" horiz-adv-x="313" />
+<glyph unicode="&#x200a;" horiz-adv-x="87" />
+<glyph unicode="&#x2010;" horiz-adv-x="639" d="M55 469l35 158h479l-34 -158h-480z" />
+<glyph unicode="&#x2011;" horiz-adv-x="639" d="M55 469l35 158h479l-34 -158h-480z" />
+<glyph unicode="&#x2012;" horiz-adv-x="639" d="M55 469l35 158h479l-34 -158h-480z" />
+<glyph unicode="&#x2013;" horiz-adv-x="983" d="M55 469l35 160h823l-34 -160h-824z" />
+<glyph unicode="&#x2014;" horiz-adv-x="1966" d="M55 469l35 160h1806l-34 -160h-1807z" />
+<glyph unicode="&#x2018;" horiz-adv-x="348" d="M123 983q98 211 270 479h127q-147 -345 -203 -501h-188z" />
+<glyph unicode="&#x2019;" horiz-adv-x="348" d="M125 961q134 298 203 501h188l8 -22q-40 -91 -111 -218.5t-159 -260.5h-129z" />
+<glyph unicode="&#x201c;" horiz-adv-x="719" d="M123 983q98 211 270 479h127q-147 -345 -203 -501h-188zM492 983q80 181 272 479h127q-162 -379 -203 -501h-188z" />
+<glyph unicode="&#x201d;" horiz-adv-x="719" d="M125 961q134 298 203 501h188l8 -22q-40 -91 -111 -218.5t-159 -260.5h-129zM494 961q57 126 115.5 272.5t86.5 228.5h189l10 -22q-94 -206 -274 -479h-127z" />
+<glyph unicode="&#x2022;" horiz-adv-x="774" d="M199 684q0 145 73.5 231t198.5 86q92 0 139 -49t47 -141q0 -141 -74 -230t-202 -89q-89 0 -135.5 49.5t-46.5 142.5z" />
+<glyph unicode="&#x2026;" horiz-adv-x="1563" d="M563 74q0 77 40.5 122.5t111.5 45.5q43 0 69.5 -26t26.5 -79q0 -71 -40 -118.5t-108 -47.5q-46 0 -73 26t-27 77zM1085 74q0 77 40.5 122.5t111.5 45.5q43 0 69.5 -26t26.5 -79q0 -71 -40 -118.5t-108 -47.5q-46 0 -73 26t-27 77zM43 74q0 77 40.5 122.5t111.5 45.5 q43 0 69.5 -26t26.5 -79q0 -71 -40 -118.5t-108 -47.5q-46 0 -73 26t-27 77z" />
+<glyph unicode="&#x202f;" horiz-adv-x="313" />
+<glyph unicode="&#x205f;" horiz-adv-x="392" />
+<glyph unicode="&#x20ac;" d="M63 504l27 131h154q8 80 30 164h-151l27 133h159q97 267 259.5 408t369.5 141q89 0 160 -21.5t141 -70.5l-80 -138q-113 78 -231 78q-140 0 -254 -99t-189 -298h426l-26 -133h-441q-21 -65 -32 -164h381l-29 -131h-361q0 -373 297 -373q123 0 256 55v-147 q-127 -59 -278 -59q-212 0 -328.5 133.5t-116.5 378.5v12h-170z" />
+<glyph unicode="&#x2122;" horiz-adv-x="1534" d="M121 1358v104h516v-104h-199v-617h-121v617h-196zM705 741v721h180l182 -557l193 557h170v-721h-121v430q0 73 4 121h-6l-197 -551h-96l-189 551h-6q4 -52 4 -121v-430h-118z" />
+<glyph unicode="&#xe000;" horiz-adv-x="1095" d="M0 1095h1095v-1095h-1095v1095z" />
+</font>
+</defs></svg> 
\ No newline at end of file
diff --git a/fonts/OpenSans-Italic-webfont.ttf b/fonts/OpenSans-Italic-webfont.ttf
new file mode 100644
index 0000000..63f187e
Binary files /dev/null and b/fonts/OpenSans-Italic-webfont.ttf differ
diff --git a/fonts/OpenSans-Italic-webfont.woff b/fonts/OpenSans-Italic-webfont.woff
new file mode 100644
index 0000000..469a29b
Binary files /dev/null and b/fonts/OpenSans-Italic-webfont.woff differ
diff --git a/fonts/OpenSans-Light-webfont.eot b/fonts/OpenSans-Light-webfont.eot
new file mode 100644
index 0000000..837daab
Binary files /dev/null and b/fonts/OpenSans-Light-webfont.eot differ
diff --git a/fonts/OpenSans-Light-webfont.svg b/fonts/OpenSans-Light-webfont.svg
new file mode 100644
index 0000000..bdb6726
--- /dev/null
+++ b/fonts/OpenSans-Light-webfont.svg
@@ -0,0 +1,146 @@
+<?xml version="1.0" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
+<svg xmlns="http://www.w3.org/2000/svg">
+<metadata>
+This is a custom SVG webfont generated by Font Squirrel.
+Copyright   : Digitized data copyright  20102011 Google Corporation
+Foundry     : Ascender Corporation
+Foundry URL : httpwwwascendercorpcom
+</metadata>
+<defs>
+<font id="OpenSansLight" horiz-adv-x="1169" >
+<font-face units-per-em="2048" ascent="1638" descent="-410" />
+<missing-glyph horiz-adv-x="532" />
+<glyph unicode=" "  horiz-adv-x="532" />
+<glyph unicode="&#x09;" horiz-adv-x="532" />
+<glyph unicode="&#xa0;" horiz-adv-x="532" />
+<glyph unicode="!" horiz-adv-x="492" d="M164 78q0 98 80 98q82 0 82 -98t-82 -98q-80 0 -80 98zM186 1462h119l-29 -1085h-61z" />
+<glyph unicode="&#x22;" horiz-adv-x="723" d="M133 1462h127l-33 -528h-61zM463 1462h127l-33 -528h-61z" />
+<glyph unicode="#" horiz-adv-x="1323" d="M55 451v79h299l76 398h-297v80h311l86 454h91l-89 -454h365l88 454h86l-88 -454h285v-80h-301l-76 -398h303v-79h-320l-86 -451h-90l88 451h-360l-86 -451h-88l86 451h-283zM440 530h363l78 398h-363z" />
+<glyph unicode="$" d="M164 186v103q75 -36 179.5 -61t193.5 -25v508q-145 44 -215 88t-102 104t-32 146q0 124 94.5 208.5t254.5 104.5v192h81v-190q197 -9 351 -72l-33 -90q-141 62 -318 72v-486q213 -66 293 -144t80 -204q0 -133 -99 -217t-274 -106v-236h-81v232q-92 2 -200.5 22.5 t-172.5 50.5zM297 1049q0 -86 57 -141t183 -93v453q-119 -16 -179.5 -76t-60.5 -143zM618 209q122 13 192.5 75t70.5 160q0 85 -63 140.5t-200 95.5v-471z" />
+<glyph unicode="%" horiz-adv-x="1653" d="M113 1026q0 223 72 340t212 117q139 0 215 -120.5t76 -336.5q0 -226 -75 -343.5t-216 -117.5q-133 0 -208.5 120.5t-75.5 340.5zM211 1026q0 -186 45 -279.5t141 -93.5q193 0 193 373q0 184 -49.5 276.5t-143.5 92.5q-96 0 -141 -92.5t-45 -276.5zM373 0l811 1462h96 l-811 -1462h-96zM965 438q0 225 73.5 341t212.5 116q137 0 213 -120t76 -337q0 -226 -74 -343.5t-215 -117.5q-136 0 -211 121.5t-75 339.5zM1063 438q0 -185 45 -277.5t141 -92.5q193 0 193 370q0 369 -193 369q-96 0 -141 -91.5t-45 -277.5z" />
+<glyph unicode="&#x26;" horiz-adv-x="1460" d="M123 371q0 138 73.5 235t274.5 205l-75 82q-66 71 -98 139t-32 142q0 143 95.5 227t256.5 84q155 0 245.5 -81t90.5 -224q0 -105 -70 -192.5t-253 -194.5l452 -457q61 72 104 157t75 201h96q-63 -246 -209 -426l266 -268h-135l-193 197q-92 -90 -164 -131.5t-157.5 -63.5 t-194.5 -22q-209 0 -328.5 103t-119.5 288zM227 375q0 -143 93 -224t258 -81q128 0 234.5 43.5t209.5 146.5l-483 485q-136 -72 -196.5 -122.5t-88 -109.5t-27.5 -138zM373 1176q0 -79 40 -146t152 -174q159 85 221 159t62 169q0 94 -62 152.5t-168 58.5q-114 0 -179.5 -58 t-65.5 -161z" />
+<glyph unicode="'" horiz-adv-x="393" d="M133 1462h127l-33 -528h-61z" />
+<glyph unicode="(" horiz-adv-x="557" d="M82 561q0 265 77.5 496t223.5 405h113q-148 -182 -227 -412.5t-79 -486.5q0 -483 304 -887h-111q-147 170 -224 397t-77 488z" />
+<glyph unicode=")" horiz-adv-x="557" d="M61 1462h113q147 -175 224 -406.5t77 -494.5t-77.5 -490t-223.5 -395h-111q304 404 304 887q0 257 -79 487.5t-227 411.5z" />
+<glyph unicode="*" horiz-adv-x="1128" d="M104 1124l19 131l401 -104l-39 405h146l-37 -405l405 104l21 -131l-395 -39l247 -340l-124 -71l-191 379l-180 -379l-125 71l242 340z" />
+<glyph unicode="+" d="M111 682v82h432v434h82v-434h434v-82h-434v-432h-82v432h-432z" />
+<glyph unicode="," horiz-adv-x="440" d="M68 -264q77 275 110 502h117l12 -21q-75 -265 -174 -481h-65z" />
+<glyph unicode="-" horiz-adv-x="659" d="M92 512v82h475v-82h-475z" />
+<glyph unicode="." horiz-adv-x="487" d="M162 78q0 98 80 98q82 0 82 -98t-82 -98q-80 0 -80 98z" />
+<glyph unicode="/" horiz-adv-x="698" d="M25 0l544 1462h105l-545 -1462h-104z" />
+<glyph unicode="0" d="M115 735q0 382 115.5 566t351.5 184q231 0 352 -190.5t121 -559.5q0 -385 -117.5 -570t-355.5 -185q-229 0 -348 190.5t-119 564.5zM223 735q0 -340 89 -502.5t270 -162.5q189 0 275.5 168t86.5 497q0 324 -86.5 492t-275.5 168t-274 -168t-85 -492z" />
+<glyph unicode="1" d="M199 1165l397 297h86v-1462h-98v1065q0 145 12 301q-15 -15 -31 -29t-309 -243z" />
+<glyph unicode="2" d="M113 0v88l389 406q164 170 230 260t97 172t31 172q0 131 -86 213t-223 82q-183 0 -350 -133l-54 69q183 154 406 154q191 0 300.5 -102t109.5 -281q0 -145 -73.5 -280.5t-268.5 -334.5l-375 -385v-4h782v-96h-915z" />
+<glyph unicode="3" d="M94 63v99q84 -44 188.5 -69t196.5 -25q221 0 332 89.5t111 252.5q0 145 -113.5 223t-333.5 78h-158v96h160q182 0 288.5 86.5t106.5 234.5q0 122 -86.5 195.5t-226.5 73.5q-109 0 -199 -30.5t-202 -104.5l-49 67q85 71 205 112.5t243 41.5q202 0 312 -95.5t110 -269.5 q0 -136 -85.5 -229t-229.5 -119v-6q176 -22 268 -112t92 -242q0 -205 -139.5 -317.5t-401.5 -112.5q-223 0 -389 83z" />
+<glyph unicode="4" d="M43 373v67l725 1030h121v-1011h252v-86h-252v-373h-94v373h-752zM162 459h633v418q0 302 14 507h-8q-20 -37 -123 -188z" />
+<glyph unicode="5" d="M143 63v103q108 -55 192 -76.5t179 -21.5q192 0 308 101.5t116 274.5q0 163 -113 256t-307 93q-130 0 -272 -39l-60 39l58 669h704v-96h-610l-45 -516q156 29 244 29q234 0 368.5 -113t134.5 -311q0 -225 -140 -350t-386 -125q-109 0 -207 21.5t-164 61.5z" />
+<glyph unicode="6" d="M131 623q0 285 77.5 479.5t220 288.5t343.5 94q94 0 172 -23v-88q-73 27 -176 27q-247 0 -384.5 -178t-154.5 -518h13q76 98 174 148t207 50q205 0 320.5 -117t115.5 -323q0 -224 -121.5 -353.5t-327.5 -129.5q-222 0 -350.5 169.5t-128.5 473.5zM240 504 q0 -111 49.5 -213.5t134 -162.5t186.5 -60q164 0 255 103t91 294q0 168 -90 262t-245 94q-102 0 -189.5 -45t-139.5 -119.5t-52 -152.5z" />
+<glyph unicode="7" d="M109 1366v96h946v-73l-604 -1389h-117l602 1366h-827z" />
+<glyph unicode="8" d="M121 375q0 131 83 230t257 169q-161 76 -227 160.5t-66 202.5q0 105 53 184.5t148.5 122.5t212.5 43q186 0 299.5 -95t113.5 -257q0 -112 -70.5 -198t-228.5 -159q192 -79 270 -173t78 -228q0 -181 -126.5 -289t-339.5 -108q-221 0 -339 101t-118 294zM223 360 q0 -138 93.5 -214t261.5 -76q164 0 264 80.5t100 218.5q0 124 -78.5 201.5t-302.5 162.5q-184 -71 -261 -157t-77 -216zM268 1137q0 -70 31.5 -123.5t91 -97t199.5 -101.5q163 63 234 139t71 183q0 120 -84.5 190t-230.5 70q-141 0 -226.5 -69.5t-85.5 -190.5z" />
+<glyph unicode="9" d="M111 993q0 220 124.5 356t323.5 136q144 0 252 -75.5t166.5 -221.5t58.5 -346q0 -288 -75.5 -482t-220 -287t-349.5 -93q-104 0 -192 26v86q43 -14 103.5 -21.5t92.5 -7.5q247 0 387 178.5t156 520.5h-12q-73 -96 -174 -147.5t-211 -51.5q-203 0 -316.5 112t-113.5 318z M213 999q0 -174 87 -264t249 -90q101 0 188.5 45t139 119.5t51.5 151.5q0 117 -46.5 219t-130 159.5t-192.5 57.5q-158 0 -252 -106.5t-94 -291.5z" />
+<glyph unicode=":" horiz-adv-x="487" d="M162 78q0 98 80 98q82 0 82 -98t-82 -98q-80 0 -80 98zM162 971q0 98 80 98q82 0 82 -98q0 -53 -23.5 -76t-58.5 -23q-34 0 -57 23t-23 76z" />
+<glyph unicode=";" horiz-adv-x="487" d="M76 -264q29 97 62 245.5t48 256.5h117l12 -21q-75 -265 -174 -481h-65zM162 971q0 98 80 98q82 0 82 -98q0 -53 -23.5 -76t-58.5 -23q-34 0 -57 23t-23 76z" />
+<glyph unicode="&#x3c;" d="M111 682v61l948 474v-95l-823 -405l823 -355v-96z" />
+<glyph unicode="=" d="M111 477v82h948v-82h-948zM111 885v82h948v-82h-948z" />
+<glyph unicode="&#x3e;" d="M111 266v96l823 355l-823 405v95l948 -474v-61z" />
+<glyph unicode="?" horiz-adv-x="862" d="M57 1403q110 48 184.5 64t153.5 16q183 0 288 -98.5t105 -270.5q0 -68 -18 -119t-50.5 -94.5t-78.5 -84t-102 -87.5q-64 -54 -98.5 -98.5t-50 -93.5t-15.5 -146v-14h-82v37q0 123 37.5 201t138.5 167l91 79q72 61 103 121t31 138q0 127 -83.5 202t-219.5 75 q-79 0 -148 -17.5t-149 -56.5zM260 78q0 98 80 98q82 0 82 -98t-82 -98q-80 0 -80 98z" />
+<glyph unicode="@" horiz-adv-x="1815" d="M113 561q0 256 108.5 460.5t307 317.5t448.5 113q215 0 380.5 -89t255 -254.5t89.5 -383.5q0 -228 -90.5 -366t-245.5 -138q-89 0 -144.5 54t-64.5 147h-4q-43 -100 -124 -150.5t-189 -50.5q-148 0 -229 96.5t-81 270.5q0 202 120.5 330.5t314.5 128.5q138 0 286 -41 l-22 -464v-30q0 -104 35 -156.5t116 -52.5q103 0 168.5 116.5t65.5 303.5q0 194 -79 340t-225.5 224.5t-334.5 78.5q-230 0 -405.5 -99.5t-270 -281.5t-94.5 -418q0 -322 167 -497.5t474 -175.5q93 0 188.5 18t231.5 70v-99q-203 -80 -414 -80q-349 0 -544 200.5t-195 557.5 zM633 590q0 -143 55 -215t174 -72q255 0 273 346l16 291q-79 27 -193 27q-149 0 -237 -102.5t-88 -274.5z" />
+<glyph unicode="A" horiz-adv-x="1229" d="M0 0l588 1468h65l576 -1468h-115l-203 516h-594l-204 -516h-113zM354 608h523l-199 527q-25 62 -60 172q-27 -96 -59 -174z" />
+<glyph unicode="B" horiz-adv-x="1284" d="M207 0v1462h401q271 0 398 -92t127 -278q0 -127 -77.5 -211.5t-226.5 -108.5v-6q175 -26 257.5 -110.5t82.5 -235.5q0 -202 -134 -311t-380 -109h-448zM309 90h344q406 0 406 330q0 301 -428 301h-322v-631zM309 811h322q206 0 299.5 68.5t93.5 214.5t-105.5 212 t-314.5 66h-295v-561z" />
+<glyph unicode="C" horiz-adv-x="1272" d="M129 735q0 223 84.5 393t243 262.5t368.5 92.5q214 0 383 -80l-41 -92q-160 80 -336 80q-275 0 -433 -176t-158 -482q0 -313 149 -486t426 -173q184 0 338 47v-90q-145 -51 -362 -51q-308 0 -485 199t-177 556z" />
+<glyph unicode="D" horiz-adv-x="1446" d="M207 0v1462h395q350 0 532.5 -183t182.5 -534q0 -368 -193 -556.5t-567 -188.5h-350zM309 90h242q655 0 655 651q0 314 -159.5 472.5t-468.5 158.5h-269v-1282z" />
+<glyph unicode="E" horiz-adv-x="1130" d="M207 0v1462h799v-94h-697v-553h658v-94h-658v-627h697v-94h-799z" />
+<glyph unicode="F" horiz-adv-x="1028" d="M207 0v1462h801v-94h-699v-620h660v-95h-660v-653h-102z" />
+<glyph unicode="G" horiz-adv-x="1481" d="M129 729q0 223 91.5 395.5t262 266.5t391.5 94q239 0 429 -88l-41 -92q-190 88 -394 88q-289 0 -458.5 -178.5t-169.5 -481.5q0 -330 161 -496.5t473 -166.5q202 0 343 57v514h-435v96h539v-667q-212 -90 -477 -90q-346 0 -530.5 195.5t-184.5 553.5z" />
+<glyph unicode="H" horiz-adv-x="1473" d="M207 0v1462h102v-649h854v649h103v-1462h-103v719h-854v-719h-102z" />
+<glyph unicode="I" horiz-adv-x="516" d="M207 0v1462h102v-1462h-102z" />
+<glyph unicode="J" horiz-adv-x="506" d="M-184 -254q78 -20 149 -20q242 0 242 264v1472h102v-1462q0 -369 -342 -369q-92 0 -151 27v88z" />
+<glyph unicode="K" horiz-adv-x="1190" d="M207 0v1462h102v-760l162 162l573 598h130l-599 -618l615 -844h-125l-561 772l-195 -172v-600h-102z" />
+<glyph unicode="L" horiz-adv-x="1051" d="M207 0v1462h102v-1366h697v-96h-799z" />
+<glyph unicode="M" horiz-adv-x="1767" d="M207 0v1462h158l518 -1286h6l518 1286h154v-1462h-103v1108q0 116 12 240h-8l-547 -1348h-65l-545 1350h-8q8 -124 8 -254v-1096h-98z" />
+<glyph unicode="N" horiz-adv-x="1477" d="M207 0v1462h102l865 -1296h6q-9 180 -9 342v954h99v-1462h-103l-866 1298h-8q12 -232 12 -350v-948h-98z" />
+<glyph unicode="O" horiz-adv-x="1565" d="M129 735q0 349 175.5 549.5t479.5 200.5q306 0 479 -201.5t173 -550.5q0 -348 -174 -550.5t-480 -202.5q-305 0 -479 202.5t-174 552.5zM240 733q0 -314 140 -485.5t402 -171.5q264 0 403.5 170t139.5 487q0 316 -139.5 484.5t-401.5 168.5q-261 0 -402.5 -170 t-141.5 -483z" />
+<glyph unicode="P" horiz-adv-x="1198" d="M207 0v1462h358q522 0 522 -420q0 -212 -144 -325t-408 -113h-226v-604h-102zM309 692h201q247 0 357 81.5t110 264.5q0 169 -104 250.5t-322 81.5h-242v-678z" />
+<glyph unicode="Q" horiz-adv-x="1565" d="M129 735q0 349 175.5 549.5t479.5 200.5q306 0 479 -201.5t173 -550.5q0 -294 -126 -486.5t-349 -246.5l333 -348h-166l-282 330l-33 -2h-31q-305 0 -479 202.5t-174 552.5zM240 733q0 -314 140 -485.5t402 -171.5q264 0 403.5 170t139.5 487q0 316 -139.5 484.5 t-401.5 168.5q-261 0 -402.5 -170t-141.5 -483z" />
+<glyph unicode="R" horiz-adv-x="1217" d="M207 0v1462h348q272 0 402 -100.5t130 -302.5q0 -147 -77.5 -248t-235.5 -145l397 -666h-122l-377 637h-363v-637h-102zM309 725h279q185 0 287 82.5t102 243.5q0 167 -100 243t-326 76h-242v-645z" />
+<glyph unicode="S" horiz-adv-x="1116" d="M111 39v102q158 -67 403 -67q180 0 285.5 82.5t105.5 216.5q0 83 -35 137.5t-114 99.5t-232 97q-224 77 -309.5 166.5t-85.5 238.5q0 164 128.5 267.5t330.5 103.5q206 0 387 -78l-37 -88q-182 76 -348 76q-162 0 -258 -75t-96 -204q0 -81 29.5 -133t96.5 -93.5 t230 -99.5q171 -59 257 -114.5t125.5 -126t39.5 -170.5q0 -183 -134.5 -290t-357.5 -107q-268 0 -411 59z" />
+<glyph unicode="T" horiz-adv-x="1073" d="M10 1366v96h1053v-96h-475v-1366h-103v1366h-475z" />
+<glyph unicode="U" horiz-adv-x="1473" d="M190 520v942h103v-946q0 -211 117 -328.5t331 -117.5q209 0 324 115.5t115 320.5v956h102v-946q0 -252 -146 -394t-407 -142q-254 0 -396.5 142.5t-142.5 397.5z" />
+<glyph unicode="V" horiz-adv-x="1182" d="M0 1462h109l368 -995q84 -225 113 -338q20 75 79 233l402 1100h111l-547 -1462h-90z" />
+<glyph unicode="W" horiz-adv-x="1827" d="M51 1462h107l256 -942q15 -57 28 -105.5t23.5 -91t19 -82t15.5 -79.5q24 136 102 413l250 887h113l293 -1018q51 -176 73 -284q13 72 33.5 153t308.5 1149h103l-404 -1462h-84l-321 1128q-40 139 -60 228q-16 -87 -45.5 -200t-322.5 -1156h-86z" />
+<glyph unicode="X" horiz-adv-x="1102" d="M0 0l492 762l-447 700h115l395 -626l401 626h109l-453 -698l490 -764h-117l-432 682l-440 -682h-113z" />
+<glyph unicode="Y" horiz-adv-x="1081" d="M0 1462h117l426 -800l428 800h110l-487 -897v-565h-105v557z" />
+<glyph unicode="Z" horiz-adv-x="1180" d="M82 0v76l856 1290h-817v96h954v-76l-858 -1290h881v-96h-1016z" />
+<glyph unicode="[" horiz-adv-x="653" d="M174 -324v1786h428v-94h-330v-1597h330v-95h-428z" />
+<glyph unicode="\" horiz-adv-x="698" d="M25 1462h102l547 -1462h-103z" />
+<glyph unicode="]" horiz-adv-x="653" d="M51 -229h330v1597h-330v94h428v-1786h-428v95z" />
+<glyph unicode="^" d="M88 561l465 912h68l460 -912h-100l-395 791l-398 -791h-100z" />
+<glyph unicode="_" horiz-adv-x="842" d="M-4 -184h850v-82h-850v82z" />
+<glyph unicode="`" horiz-adv-x="1182" d="M393 1552v17h142q26 -48 98.5 -142t142.5 -170v-16h-69q-96 79 -188.5 171.5t-125.5 139.5z" />
+<glyph unicode="a" horiz-adv-x="1085" d="M98 289q0 159 132.5 247t383.5 93l207 6v72q0 155 -63 234t-203 79q-151 0 -313 -84l-37 86q179 84 354 84q179 0 267.5 -93t88.5 -290v-723h-73l-25 172h-8q-82 -105 -168.5 -148.5t-204.5 -43.5q-160 0 -249 82t-89 227zM203 285q0 -102 62.5 -158.5t176.5 -56.5 q174 0 274.5 99.5t100.5 276.5v107l-190 -8q-229 -11 -326.5 -71.5t-97.5 -188.5z" />
+<glyph unicode="b" horiz-adv-x="1219" d="M182 0v1556h99v-391q0 -88 -4 -162l-3 -85h7q62 98 149.5 144t210.5 46q228 0 343.5 -143.5t115.5 -419.5q0 -271 -121.5 -418t-341.5 -147q-116 0 -209 48t-147 136h-9l-28 -164h-62zM281 528q0 -246 86.5 -353t269.5 -107q178 0 268 124.5t90 354.5q0 471 -356 471 q-192 0 -275 -110t-83 -363v-17z" />
+<glyph unicode="c" horiz-adv-x="973" d="M119 537q0 270 137 420.5t375 150.5q141 0 270 -49l-27 -88q-141 47 -245 47q-200 0 -303 -123.5t-103 -355.5q0 -220 103 -344.5t288 -124.5q148 0 275 53v-92q-104 -51 -273 -51q-233 0 -365 147t-132 410z" />
+<glyph unicode="d" horiz-adv-x="1219" d="M119 528q0 282 118 431t343 149q118 0 204 -43t154 -147h6q-6 126 -6 247v391h98v-1556h-65l-25 166h-8q-124 -186 -356 -186q-225 0 -344 140t-119 408zM223 530q0 -462 359 -462q184 0 270 107t86 353v17q0 252 -84.5 362.5t-273.5 110.5q-178 0 -267.5 -125 t-89.5 -363z" />
+<glyph unicode="e" horiz-adv-x="1124" d="M119 535q0 260 128 416.5t345 156.5q192 0 303 -134t111 -364v-80h-783q2 -224 104.5 -342t293.5 -118q93 0 163.5 13t178.5 56v-90q-92 -40 -170 -54.5t-172 -14.5q-237 0 -369.5 146t-132.5 409zM229 618h672q0 189 -82 295.5t-227 106.5q-157 0 -252 -103.5 t-111 -298.5z" />
+<glyph unicode="f" horiz-adv-x="614" d="M29 1001v58l202 37v84q0 200 73.5 293.5t240.5 93.5q90 0 180 -27l-23 -86q-80 25 -159 25q-116 0 -164.5 -68.5t-48.5 -222.5v-101h256v-86h-256v-1001h-99v1001h-202z" />
+<glyph unicode="g" horiz-adv-x="1071" d="M45 -193q0 112 69.5 186t188.5 101q-49 21 -78.5 59.5t-29.5 88.5q0 109 139 192q-95 39 -148 122.5t-53 191.5q0 163 103.5 261.5t279.5 98.5q107 0 166 -21h348v-69l-225 -14q90 -112 90 -246q0 -157 -104.5 -254.5t-280.5 -97.5q-74 0 -104 6q-59 -31 -90 -73t-31 -89 q0 -52 39.5 -76t132.5 -24h190q177 0 271 -71.5t94 -211.5q0 -172 -139.5 -265.5t-397.5 -93.5q-205 0 -317.5 79t-112.5 220zM150 -184q0 -224 333 -224q428 0 428 273q0 98 -67 142t-217 44h-178q-299 0 -299 -235zM233 748q0 -126 76.5 -195.5t204.5 -69.5 q136 0 208.5 69t72.5 200q0 139 -74.5 208.5t-208.5 69.5q-130 0 -204.5 -74.5t-74.5 -207.5z" />
+<glyph unicode="h" horiz-adv-x="1208" d="M182 0v1556h99v-495l-5 -139h7q61 98 154 142t231 44q370 0 370 -397v-711h-98v705q0 164 -69 238.5t-214 74.5q-195 0 -285.5 -98.5t-90.5 -319.5v-600h-99z" />
+<glyph unicode="i" horiz-adv-x="463" d="M168 1389q0 96 63 96q31 0 48.5 -25t17.5 -71q0 -45 -17.5 -71t-48.5 -26q-63 0 -63 97zM182 0v1087h99v-1087h-99z" />
+<glyph unicode="j" horiz-adv-x="463" d="M-98 -381q69 -20 129 -20q151 0 151 176v1312h99v-1298q0 -135 -63.5 -208t-180.5 -73q-80 0 -135 25v86zM168 1389q0 96 63 96q31 0 48.5 -25t17.5 -71q0 -45 -17.5 -71t-48.5 -26q-63 0 -63 97z" />
+<glyph unicode="k" horiz-adv-x="991" d="M182 0v1556h99v-780l-7 -299h5l555 610h120l-428 -464l465 -623h-119l-413 549l-178 -162v-387h-99z" />
+<glyph unicode="l" horiz-adv-x="463" d="M182 0v1556h99v-1556h-99z" />
+<glyph unicode="m" horiz-adv-x="1808" d="M182 0v1087h82l21 -149h6q45 81 128 125.5t183 44.5q257 0 330 -193h4q53 93 142.5 143t203.5 50q178 0 267 -95t89 -302v-711h-98v713q0 159 -62 232t-190 73q-167 0 -247 -92t-80 -289v-637h-101v743q0 275 -252 275q-171 0 -249 -99.5t-78 -318.5v-600h-99z" />
+<glyph unicode="n" horiz-adv-x="1208" d="M182 0v1087h84l19 -149h6q106 170 377 170q370 0 370 -397v-711h-98v705q0 164 -69 238.5t-214 74.5q-195 0 -285.5 -98.5t-90.5 -319.5v-600h-99z" />
+<glyph unicode="o" horiz-adv-x="1200" d="M119 545q0 266 129 414.5t354 148.5q224 0 351.5 -150.5t127.5 -412.5q0 -266 -129 -415.5t-356 -149.5q-143 0 -252 69t-167 198t-58 298zM223 545q0 -224 98.5 -349.5t278.5 -125.5t278.5 125.5t98.5 349.5q0 225 -99.5 349t-279.5 124t-277.5 -123.5t-97.5 -349.5z " />
+<glyph unicode="p" horiz-adv-x="1219" d="M182 -492v1579h84l19 -155h6q112 176 358 176q220 0 335.5 -144.5t115.5 -420.5q0 -268 -121.5 -415.5t-331.5 -147.5q-251 0 -366 188h-7l3 -84q4 -74 4 -162v-414h-99zM281 541q0 -255 85.5 -364t278.5 -109q167 0 258.5 124t91.5 347q0 479 -346 479 q-190 0 -279 -104.5t-89 -340.5v-32z" />
+<glyph unicode="q" horiz-adv-x="1219" d="M119 532q0 275 118 425.5t338 150.5q236 0 353 -174h6l18 153h84v-1579h-98v414q0 122 6 248h-6q-118 -190 -369 -190q-214 0 -332 142t-118 410zM223 530q0 -229 89.5 -345.5t258.5 -116.5q198 0 282.5 109t84.5 366v12q0 245 -85 354t-271 109q-176 0 -267.5 -124 t-91.5 -364z" />
+<glyph unicode="r" horiz-adv-x="797" d="M182 0v1087h84l10 -196h7q67 120 143 168.5t184 48.5q69 0 148 -14l-19 -95q-68 17 -141 17q-139 0 -228 -118t-89 -298v-600h-99z" />
+<glyph unicode="s" horiz-adv-x="954" d="M84 47v107q164 -82 346 -82q161 0 244.5 53.5t83.5 142.5q0 82 -66.5 138t-218.5 110q-163 59 -229 101.5t-99.5 96t-33.5 130.5q0 122 102.5 193t286.5 71q176 0 334 -66l-37 -90q-160 66 -297 66q-133 0 -211 -44t-78 -122q0 -85 60.5 -136t236.5 -114 q147 -53 214 -95.5t100.5 -96.5t33.5 -127q0 -146 -111 -224.5t-315 -78.5q-218 0 -346 67z" />
+<glyph unicode="t" horiz-adv-x="686" d="M25 1001v58l161 45l50 246h51v-263h319v-86h-319v-688q0 -125 44 -185t138 -60t164 16v-80q-72 -24 -166 -24q-144 0 -212.5 77t-68.5 242v702h-161z" />
+<glyph unicode="u" horiz-adv-x="1208" d="M170 377v710h98v-704q0 -164 69 -238.5t214 -74.5q194 0 285.5 98t91.5 319v600h98v-1087h-84l-18 150h-6q-106 -170 -377 -170q-371 0 -371 397z" />
+<glyph unicode="v" horiz-adv-x="940" d="M0 1087h102l281 -739q56 -142 84 -248h6q41 136 84 250l281 737h102l-420 -1087h-100z" />
+<glyph unicode="w" horiz-adv-x="1481" d="M31 1087h106l174 -630q61 -234 80 -344h6q59 234 86 311l224 663h90l213 -661q72 -235 88 -311h6q8 65 80 348l166 624h100l-295 -1087h-104l-238 727q-23 74 -59 217h-6l-21 -74l-45 -145l-242 -725h-98z" />
+<glyph unicode="x" horiz-adv-x="1020" d="M55 0l394 559l-379 528h114l324 -458l321 458h109l-373 -528l400 -559h-115l-342 485l-344 -485h-109z" />
+<glyph unicode="y" horiz-adv-x="940" d="M0 1087h102l230 -610q105 -281 133 -379h6q42 129 137 385l230 604h102l-487 -1263q-59 -154 -99 -208t-93.5 -81t-129.5 -27q-57 0 -127 21v86q58 -16 125 -16q51 0 90 24t70.5 74.5t73 160t53.5 142.5z" />
+<glyph unicode="z" horiz-adv-x="944" d="M82 0v63l645 936h-598v88h727v-63l-649 -936h651v-88h-776z" />
+<glyph unicode="{" horiz-adv-x="723" d="M61 528v80q122 2 176 51t54 148v350q0 299 360 305v-90q-138 -5 -200 -58t-62 -157v-305q0 -130 -44 -194t-142 -85v-8q97 -20 141.5 -83.5t44.5 -186.5v-322q0 -102 59.5 -152.5t202.5 -53.5v-91q-195 0 -277.5 75t-82.5 231v337q0 205 -230 209z" />
+<glyph unicode="|" horiz-adv-x="1108" d="M508 -506v2067h92v-2067h-92z" />
+<glyph unicode="}" horiz-adv-x="723" d="M72 -233q141 2 201.5 52.5t60.5 153.5v322q0 123 44.5 186.5t141.5 83.5v8q-97 20 -141.5 84t-44.5 195v305q0 103 -61.5 156.5t-200.5 58.5v90q174 0 267 -77.5t93 -227.5v-350q0 -100 54.5 -148.5t175.5 -50.5v-80q-230 -4 -230 -209v-337q0 -155 -82.5 -230.5 t-277.5 -75.5v91z" />
+<glyph unicode="~" d="M111 625v94q108 110 233 110q61 0 115 -13.5t155 -57.5q126 -58 220 -58q56 0 109.5 30.5t115.5 94.5v-96q-48 -49 -104.5 -81t-129.5 -32q-116 0 -270 72q-124 57 -221 57q-49 0 -108 -30.5t-115 -89.5z" />
+<glyph unicode="&#xa2;" d="M211 745q0 232 102.5 381.5t288.5 182.5v174h82v-166h14q131 0 275 -55l-31 -84q-134 51 -237 51q-187 0 -288.5 -122.5t-101.5 -358.5q0 -225 100.5 -349.5t280.5 -124.5q131 0 267 58v-92q-110 -56 -267 -56h-12v-204h-82v210q-186 30 -288.5 175t-102.5 380z" />
+<glyph unicode="&#xa3;" d="M78 0v84q110 21 171.5 110t61.5 224v258h-211v82h211v297q0 204 98 315t281 111q175 0 330 -68l-35 -86q-157 66 -295 66q-141 0 -209.5 -81t-68.5 -253v-301h411v-82h-411v-256q0 -116 -35 -196t-113 -128h809v-96h-995z" />
+<glyph unicode="&#xa5;" d="M43 1462h117l426 -796l428 796h110l-432 -788h283v-82h-338v-205h338v-82h-338v-305h-105v305h-337v82h337v205h-337v82h278z" />
+<glyph unicode="&#xa9;" horiz-adv-x="1704" d="M100 731q0 200 100 375t275 276t377 101q200 0 375 -100t276 -275t101 -377q0 -197 -97 -370t-272 -277t-383 -104q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM193 731q0 -178 88.5 -329.5t240.5 -240.5t330 -89t329.5 88.5t240.5 240.5t89 330q0 174 -85.5 325 t-239 243t-334.5 92q-176 0 -328.5 -88.5t-241.5 -242.5t-89 -329zM489 725q0 208 111 332.5t297 124.5q119 0 227 -52l-37 -83q-98 45 -190 45q-142 0 -222.5 -94.5t-80.5 -264.5q0 -186 74.5 -275t220.5 -89q84 0 198 43v-88q-102 -45 -208 -45q-187 0 -288.5 115 t-101.5 331z" />
+<glyph unicode="&#xad;" horiz-adv-x="659" d="M92 512v82h475v-82h-475z" />
+<glyph unicode="&#xae;" horiz-adv-x="1704" d="M100 731q0 200 100 375t275 276t377 101q200 0 375 -100t276 -275t101 -377q0 -197 -97 -370t-272 -277t-383 -104q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM193 731q0 -178 88.5 -329.5t240.5 -240.5t330 -89t329.5 88.5t240.5 240.5t89 330q0 174 -85.5 325 t-239 243t-334.5 92q-176 0 -328.5 -88.5t-241.5 -242.5t-89 -329zM608 291v880h211q143 0 222 -62t79 -191q0 -79 -38.5 -139.5t-110.5 -94.5l237 -393h-121l-210 360h-168v-360h-101zM709 731h112q91 0 143 46.5t52 135.5q0 172 -197 172h-110v-354z" />
+<glyph unicode="&#xb4;" horiz-adv-x="1182" d="M393 1241v16q73 79 144.5 171.5t97.5 140.5h141v-17q-36 -52 -122.5 -138t-190.5 -173h-70z" />
+<glyph unicode="&#x2000;" horiz-adv-x="784" />
+<glyph unicode="&#x2001;" horiz-adv-x="1569" />
+<glyph unicode="&#x2002;" horiz-adv-x="784" />
+<glyph unicode="&#x2003;" horiz-adv-x="1569" />
+<glyph unicode="&#x2004;" horiz-adv-x="523" />
+<glyph unicode="&#x2005;" horiz-adv-x="392" />
+<glyph unicode="&#x2006;" horiz-adv-x="261" />
+<glyph unicode="&#x2007;" horiz-adv-x="261" />
+<glyph unicode="&#x2008;" horiz-adv-x="196" />
+<glyph unicode="&#x2009;" horiz-adv-x="313" />
+<glyph unicode="&#x200a;" horiz-adv-x="87" />
+<glyph unicode="&#x2010;" horiz-adv-x="659" d="M92 512v82h475v-82h-475z" />
+<glyph unicode="&#x2011;" horiz-adv-x="659" d="M92 512v82h475v-82h-475z" />
+<glyph unicode="&#x2012;" horiz-adv-x="659" d="M92 512v82h475v-82h-475z" />
+<glyph unicode="&#x2013;" horiz-adv-x="1024" d="M82 512v82h860v-82h-860z" />
+<glyph unicode="&#x2014;" horiz-adv-x="2048" d="M82 512v82h1884v-82h-1884z" />
+<glyph unicode="&#x2018;" horiz-adv-x="297" d="M29 981q32 112 81.5 251t92.5 230h65q-30 -101 -64.5 -257t-45.5 -244h-117z" />
+<glyph unicode="&#x2019;" horiz-adv-x="297" d="M29 961q29 96 61 241.5t49 259.5h117l12 -20q-75 -265 -174 -481h-65z" />
+<glyph unicode="&#x201c;" horiz-adv-x="614" d="M29 981q32 112 81.5 251t92.5 230h65q-30 -101 -64.5 -257t-45.5 -244h-117zM346 981q34 120 83 255t91 226h66q-30 -98 -63 -248.5t-48 -252.5h-117z" />
+<glyph unicode="&#x201d;" horiz-adv-x="614" d="M29 961q29 96 61 241.5t49 259.5h117l12 -20q-75 -265 -174 -481h-65zM346 961q30 98 63 248.5t48 252.5h116l13 -20q-36 -128 -85 -261t-89 -220h-66z" />
+<glyph unicode="&#x2022;" horiz-adv-x="770" d="M231 748q0 89 40.5 134.5t113.5 45.5t113.5 -47t40.5 -133q0 -85 -41 -133t-113 -48t-113 47t-41 134z" />
+<glyph unicode="&#x2026;" horiz-adv-x="1466" d="M162 78q0 98 80 98q82 0 82 -98t-82 -98q-80 0 -80 98zM651 78q0 98 80 98q82 0 82 -98t-82 -98q-80 0 -80 98zM1141 78q0 98 80 98q82 0 82 -98t-82 -98q-80 0 -80 98z" />
+<glyph unicode="&#x202f;" horiz-adv-x="313" />
+<glyph unicode="&#x205f;" horiz-adv-x="392" />
+<glyph unicode="&#x20ac;" d="M74 528v82h172q-4 38 -4 113l4 102h-172v82h184q39 272 183 425t362 153q88 0 161 -17t148 -57l-39 -86q-132 72 -270 72q-174 0 -288 -125.5t-155 -364.5h502v-82h-510l-4 -104v-24q0 -65 4 -87h449v-82h-443q30 -217 147.5 -338.5t301.5 -121.5q148 0 287 65v-94 q-81 -34 -150.5 -46.5t-140.5 -12.5q-228 0 -367.5 140t-181.5 408h-180z" />
+<glyph unicode="&#x2122;" horiz-adv-x="1485" d="M10 1384v78h522v-78h-219v-643h-86v643h-217zM608 741v721h125l221 -606l224 606h125v-721h-86v398l4 207h-7l-227 -605h-74l-221 609h-6l4 -201v-408h-82z" />
+<glyph unicode="&#xe000;" horiz-adv-x="1085" d="M0 1085h1085v-1085h-1085v1085z" />
+</font>
+</defs></svg> 
\ No newline at end of file
diff --git a/fonts/OpenSans-Light-webfont.ttf b/fonts/OpenSans-Light-webfont.ttf
new file mode 100644
index 0000000..b50ef9d
Binary files /dev/null and b/fonts/OpenSans-Light-webfont.ttf differ
diff --git a/fonts/OpenSans-Light-webfont.woff b/fonts/OpenSans-Light-webfont.woff
new file mode 100644
index 0000000..99514d1
Binary files /dev/null and b/fonts/OpenSans-Light-webfont.woff differ
diff --git a/fonts/OpenSans-LightItalic-webfont.eot b/fonts/OpenSans-LightItalic-webfont.eot
new file mode 100644
index 0000000..f0ebf2c
Binary files /dev/null and b/fonts/OpenSans-LightItalic-webfont.eot differ
diff --git a/fonts/OpenSans-LightItalic-webfont.svg b/fonts/OpenSans-LightItalic-webfont.svg
new file mode 100644
index 0000000..60765da
--- /dev/null
+++ b/fonts/OpenSans-LightItalic-webfont.svg
@@ -0,0 +1,146 @@
+<?xml version="1.0" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
+<svg xmlns="http://www.w3.org/2000/svg">
+<metadata>
+This is a custom SVG webfont generated by Font Squirrel.
+Copyright   : Digitized data copyright  20102011 Google Corporation
+Foundry     : Ascender Corporation
+Foundry URL : httpwwwascendercorpcom
+</metadata>
+<defs>
+<font id="OpenSansLightItalic" horiz-adv-x="1128" >
+<font-face units-per-em="2048" ascent="1638" descent="-410" />
+<missing-glyph horiz-adv-x="532" />
+<glyph unicode=" "  horiz-adv-x="532" />
+<glyph unicode="&#x09;" horiz-adv-x="532" />
+<glyph unicode="&#xa0;" horiz-adv-x="532" />
+<glyph unicode="!" horiz-adv-x="502" d="M80 57q0 56 25 88.5t69 32.5q66 0 66 -72q0 -53 -25 -87.5t-68 -34.5q-67 0 -67 73zM186 377l203 1085h119l-260 -1085h-62z" />
+<glyph unicode="&#x22;" horiz-adv-x="721" d="M248 934l80 528h127l-146 -528h-61zM578 934l79 528h127l-145 -528h-61z" />
+<glyph unicode="#" horiz-adv-x="1323" d="M82 451l8 79h299l119 398h-297l8 80h311l134 454h90l-136 -454h365l135 454h86l-135 -454h285l-8 -80h-302l-118 -398h303l-8 -79h-320l-133 -451h-90l135 451h-360l-134 -451h-88l134 451h-283zM475 530h363l120 398h-362z" />
+<glyph unicode="$" d="M141 182v94q65 -34 153.5 -53.5t160.5 -19.5l110 512q-110 53 -153 91t-66.5 87.5t-23.5 116.5q0 155 105.5 250.5t272.5 99.5l41 192h80l-41 -192q149 -5 277 -68l-35 -78q-110 61 -256 70l-109 -514q124 -60 172.5 -99.5t73.5 -88.5t25 -115q0 -151 -110.5 -243 t-297.5 -103l-53 -240h-82l51 240q-79 2 -158 18t-137 43zM410 1018q0 -78 37 -128.5t137 -96.5l102 491q-134 -9 -205 -80t-71 -186zM537 203q142 7 223.5 74.5t81.5 183.5q0 76 -48 129.5t-157 97.5z" />
+<glyph unicode="%" horiz-adv-x="1556" d="M145 862q0 160 52 312t138 229.5t193 77.5q232 0 232 -283q0 -175 -50 -327t-136 -230t-197 -78q-112 0 -172 75.5t-60 223.5zM213 0l1135 1462h110l-1139 -1462h-106zM231 868q0 -115 41 -173t113 -58q84 0 148.5 72t102.5 204t38 277q0 109 -36 163t-114 54 q-79 0 -145 -71.5t-107 -203t-41 -264.5zM905 276q0 160 52 312t138 229.5t193 77.5q121 0 176.5 -71.5t55.5 -211.5q0 -175 -50 -327t-136 -230t-197 -78q-112 0 -172 75.5t-60 223.5zM991 283q0 -116 41 -174t113 -58q130 0 209.5 166.5t79.5 386.5q0 109 -36 163t-114 54 q-80 0 -146.5 -72.5t-106.5 -202.5t-40 -263z" />
+<glyph unicode="&#x26;" horiz-adv-x="1331" d="M78 324q0 162 99 277.5t325 215.5l-41 67q-78 128 -78 251q0 157 101 253.5t264 96.5q145 0 227 -76.5t82 -206.5q0 -85 -41 -154t-121 -128t-256 -138l330 -463q73 75 135.5 176.5t91.5 186.5h111q-102 -247 -285 -436l184 -246h-123l-131 184q-121 -108 -242 -156 t-266 -48q-167 0 -266.5 94t-99.5 250zM176 328q0 -119 78 -192t211 -73q108 0 211.5 42.5t222.5 146.5l-352 493q-164 -79 -232 -134.5t-103.5 -124t-35.5 -158.5zM485 1135q0 -132 109 -281q203 89 279.5 163.5t76.5 182.5q0 91 -56.5 143t-145.5 52q-125 0 -194 -68 t-69 -192z" />
+<glyph unicode="'" horiz-adv-x="403" d="M254 934l80 528h127l-146 -528h-61z" />
+<glyph unicode="(" horiz-adv-x="526" d="M104 270q0 343 122 633t382 559h105q-259 -276 -384.5 -568t-125.5 -618q0 -317 127 -600h-80q-146 262 -146 594z" />
+<glyph unicode=")" horiz-adv-x="526" d="M-156 -324q257 274 383.5 566.5t126.5 619.5q0 148 -28.5 294t-98.5 306h80q146 -262 146 -594q0 -345 -123.5 -636t-380.5 -556h-105z" />
+<glyph unicode="*" horiz-adv-x="1137" d="M233 1217l39 102l394 -168l47 408l121 -19l-109 -405l438 8l-8 -107l-416 29l181 -401l-115 -37l-135 417l-285 -348l-78 78l318 318z" />
+<glyph unicode="+" d="M162 672v100h401v404h101v-404h401v-100h-401v-400h-101v400h-401z" />
+<glyph unicode="," horiz-adv-x="451" d="M-90 -264q79 132 141 271t88 231h111l8 -23q-34 -92 -114 -233.5t-160 -245.5h-74z" />
+<glyph unicode="-" horiz-adv-x="629" d="M82 502l18 90h457l-16 -90h-459z" />
+<glyph unicode="." horiz-adv-x="485" d="M82 55q0 56 25 88.5t69 32.5q66 0 66 -72q0 -53 -25 -87.5t-67 -34.5q-68 0 -68 73z" />
+<glyph unicode="/" horiz-adv-x="641" d="M-100 0l815 1462h112l-817 -1462h-110z" />
+<glyph unicode="0" d="M139 494q0 186 44.5 381.5t124 334t187 207t240.5 68.5q340 0 340 -469q0 -201 -41 -405t-116.5 -346t-183.5 -213.5t-242 -71.5q-176 0 -264.5 126.5t-88.5 387.5zM242 504q0 -222 62.5 -329t197.5 -107q139 0 244 112t166 337t61 489q0 199 -59.5 295t-190.5 96 q-134 0 -241.5 -113t-173.5 -329t-66 -451z" />
+<glyph unicode="1" d="M354 1204l406 258h90l-313 -1462h-105l225 1055q19 92 74 293q-42 -36 -75.5 -61t-249.5 -161z" />
+<glyph unicode="2" d="M39 0l22 104l449 402q198 177 284 276.5t126.5 186.5t40.5 180q0 112 -66 178t-197 66q-176 0 -333 -129l-54 73q180 146 394 146q173 0 268.5 -85t95.5 -237q0 -110 -43.5 -208.5t-141.5 -211.5t-311 -303l-383 -338v-4h736l-17 -96h-870z" />
+<glyph unicode="3" d="M55 53v101q172 -86 344 -86q197 0 303.5 89.5t106.5 252.5q0 145 -89 223t-247 78h-117l21 96h110q209 0 333 95.5t124 258.5q0 114 -63.5 175t-188.5 61q-167 0 -344 -131l-49 75q84 67 188 104.5t218 37.5q161 0 252.5 -82.5t91.5 -226.5q0 -162 -106 -275t-286 -143 v-4q117 -24 185.5 -115.5t68.5 -226.5q0 -134 -64 -233t-179.5 -148t-274.5 -49q-96 0 -184.5 20.5t-153.5 52.5z" />
+<glyph unicode="4" d="M23 371l20 96l881 1010h118l-215 -1018h265l-21 -88h-264l-80 -371h-96l80 371h-688zM150 459h579q79 369 119 558.5t86 354.5h-4q-66 -91 -129 -166z" />
+<glyph unicode="5" d="M88 51v107q170 -90 340 -90q208 0 328.5 114.5t120.5 313.5q0 140 -85 219.5t-225 79.5q-133 0 -243 -41l-66 49l193 659h624l-18 -96h-541l-149 -516q98 29 215 29q188 0 292.5 -102t104.5 -279q0 -237 -148 -377.5t-407 -140.5q-84 0 -177.5 20t-158.5 51z" />
+<glyph unicode="6" d="M170 428q0 283 105 544.5t269.5 385t383.5 123.5q123 0 182 -21l-18 -90q-86 23 -170 23q-233 0 -393.5 -174t-233.5 -502h8q68 94 164 143t211 49q161 0 250.5 -100.5t89.5 -282.5q0 -156 -60 -281t-171 -195t-257 -70q-171 0 -265.5 119t-94.5 329zM270 414 q0 -164 72.5 -255t200.5 -91q112 0 196.5 58.5t130 162t45.5 229.5q0 146 -67 224.5t-195 78.5q-81 0 -154 -31.5t-129 -87t-78 -115t-22 -173.5z" />
+<glyph unicode="7" d="M244 0l796 1366h-766l23 96h858l-20 -110l-779 -1352h-112z" />
+<glyph unicode="8" d="M98 326q0 159 100.5 268.5t321.5 187.5q-100 72 -144 152t-44 180q0 159 114 265t291 106q163 0 258 -85t95 -229q0 -138 -84 -234.5t-285 -172.5q130 -78 190 -170.5t60 -208.5t-58 -208t-165.5 -144.5t-260.5 -52.5q-178 0 -283.5 92.5t-105.5 253.5zM201 340 q0 -136 77.5 -206.5t219.5 -70.5q168 0 270 91t102 233q0 104 -62 189t-198 157q-218 -73 -313.5 -167.5t-95.5 -225.5zM428 1114q0 -91 41.5 -159t157.5 -142q192 62 279 144t87 206q0 109 -70.5 172.5t-195.5 63.5q-130 0 -214.5 -82t-84.5 -203z" />
+<glyph unicode="9" d="M115 2v90q87 -29 192 -29q474 0 627 674h-8q-140 -192 -367 -192q-162 0 -255 105t-93 284q0 155 59.5 281t170.5 196t257 70q174 0 267.5 -115.5t93.5 -333.5q0 -288 -101.5 -548t-263.5 -382t-393 -122q-114 0 -186 22zM313 942q0 -145 67.5 -225t192.5 -80 q83 0 157.5 32.5t129 87.5t76.5 114t22 176q0 166 -71 256t-201 90q-112 0 -197.5 -58.5t-130.5 -162.5t-45 -230z" />
+<glyph unicode=":" horiz-adv-x="485" d="M102 55q0 56 25.5 88.5t69.5 32.5q65 0 65 -72q0 -55 -25.5 -88.5t-66.5 -33.5q-68 0 -68 73zM260 989q0 57 25.5 89t68.5 32q66 0 66 -72q0 -55 -25 -89t-67 -34q-68 0 -68 74z" />
+<glyph unicode=";" horiz-adv-x="485" d="M-53 -264q79 132 141 271t88 231h111l8 -23q-35 -96 -118.5 -242t-156.5 -237h-73zM266 989q0 57 25.5 89t68.5 32q66 0 66 -72q0 -55 -25 -89t-67 -34q-68 0 -68 74z" />
+<glyph unicode="&#x3c;" d="M137 676v74l914 471v-103l-801 -399l801 -350v-107z" />
+<glyph unicode="=" d="M168 461v98h903v-98h-903zM168 885v100h903v-100h-903z" />
+<glyph unicode="&#x3e;" d="M170 262v107l801 350l-801 399v103l915 -471v-74z" />
+<glyph unicode="?" horiz-adv-x="799" d="M170 59q0 56 25 88.5t69 32.5q66 0 66 -71q0 -54 -24.5 -88.5t-67.5 -34.5q-68 0 -68 73zM182 1376q85 49 171.5 78t187.5 29q159 0 250.5 -84.5t91.5 -229.5q0 -127 -66 -234t-231 -226q-85 -61 -132.5 -108.5t-73 -95t-46.5 -143.5h-92l6 29q29 132 82 206.5t157 147.5 q118 84 175 145.5t86.5 127.5t29.5 141q0 108 -67.5 170t-182.5 62q-139 0 -307 -101z" />
+<glyph unicode="@" horiz-adv-x="1724" d="M125 508q0 276 121.5 493.5t337 337t473.5 119.5q189 0 330.5 -72.5t221 -213t79.5 -314.5q0 -179 -56 -323.5t-154.5 -227t-211.5 -82.5q-98 0 -154.5 55t-56.5 144h-4q-54 -97 -132.5 -148t-168.5 -51q-112 0 -178 73t-66 202q0 156 63 283t178 198.5t261 71.5 q122 0 252 -52l-84 -315q-39 -140 -39 -221q0 -71 34.5 -111.5t100.5 -40.5q86 0 160 73.5t117.5 198t43.5 251.5q0 156 -65 277t-187 188t-292 67q-235 0 -424.5 -108.5t-295.5 -304t-106 -439.5q0 -288 155 -449t435 -161q207 0 420 82v-90q-210 -82 -428 -82 q-203 0 -357.5 82.5t-238.5 239t-84 370.5zM610 506q0 -92 40.5 -142.5t113.5 -50.5q101 0 180.5 89t124.5 255l78 289q-66 23 -139 23q-113 0 -204.5 -59t-142.5 -165.5t-51 -238.5z" />
+<glyph unicode="A" horiz-adv-x="1059" d="M-111 0l822 1468h67l201 -1468h-105l-69 520h-512l-287 -520h-117zM344 612h449l-39 291q-31 242 -39 402q-30 -63 -64.5 -130t-306.5 -563z" />
+<glyph unicode="B" horiz-adv-x="1202" d="M102 0l310 1462h379q190 0 290.5 -84t100.5 -241q0 -153 -90 -249t-254 -124v-4q125 -31 188.5 -113.5t63.5 -204.5q0 -205 -140.5 -323.5t-390.5 -118.5h-457zM223 90h342q201 0 309.5 87.5t108.5 256.5q0 145 -90 216t-275 71h-260zM377 811h278q206 0 313 81t107 238 q0 119 -78 180.5t-229 61.5h-272z" />
+<glyph unicode="C" horiz-adv-x="1169" d="M170 535q0 266 104.5 488t284.5 341t402 119q177 0 307 -68l-45 -90q-55 30 -124.5 47t-137.5 17q-197 0 -351.5 -104.5t-245 -304.5t-90.5 -441q0 -225 110.5 -346t317.5 -121q140 0 304 51v-94q-156 -49 -316 -49q-252 0 -386 145t-134 410z" />
+<glyph unicode="D" horiz-adv-x="1350" d="M102 0l310 1462h305q282 0 426.5 -147.5t144.5 -435.5q0 -253 -109.5 -461.5t-300.5 -313t-446 -104.5h-330zM221 90h209q226 0 394.5 94.5t261 275.5t92.5 412q0 498 -476 498h-206z" />
+<glyph unicode="E" horiz-adv-x="1067" d="M102 0l310 1462h727l-21 -94h-624l-117 -553h590l-21 -94h-588l-135 -627h627l-21 -94h-727z" />
+<glyph unicode="F" horiz-adv-x="981" d="M102 0l310 1462h708l-20 -94h-604l-134 -620h570l-21 -95h-569l-137 -653h-103z" />
+<glyph unicode="G" horiz-adv-x="1374" d="M170 547q0 265 105 483.5t283.5 335.5t395.5 117q113 0 203 -19t184 -59l-38 -94q-110 46 -189.5 62t-167.5 16q-184 0 -339 -107.5t-244 -301.5t-89 -433q0 -229 114.5 -352t326.5 -123q155 0 309 47l117 526h-303l18 90h406l-150 -682q-211 -73 -405 -73 q-257 0 -397 146t-140 421z" />
+<glyph unicode="H" horiz-adv-x="1366" d="M102 0l310 1462h102l-139 -649h760l137 649h100l-309 -1462h-100l151 719h-760l-149 -719h-103z" />
+<glyph unicode="I" horiz-adv-x="504" d="M102 0l310 1462h98l-309 -1462h-99z" />
+<glyph unicode="J" horiz-adv-x="477" d="M-324 -336l11 92q57 -20 137 -20q213 0 262 241l309 1485h105l-314 -1491q-35 -170 -125 -250.5t-241 -80.5q-48 0 -88 8t-56 16z" />
+<glyph unicode="K" horiz-adv-x="1122" d="M102 0l310 1462h102l-158 -723l133 121l680 602h138l-699 -610l371 -852h-111l-342 788l-190 -153l-131 -635h-103z" />
+<glyph unicode="L" horiz-adv-x="938" d="M102 0l310 1462h102l-289 -1366h621l-23 -96h-721z" />
+<glyph unicode="M" horiz-adv-x="1669" d="M109 0l309 1462h143l205 -1257h6l733 1257h150l-301 -1462h-101l191 901q79 369 100 447h-6l-780 -1348h-51l-222 1348h-6q-20 -154 -78 -426l-196 -922h-96z" />
+<glyph unicode="N" horiz-adv-x="1372" d="M102 0l310 1462h80l522 -1294h8q23 176 74 416l188 878h94l-309 -1462h-86l-516 1284h-8q-23 -149 -48 -273t-214 -1011h-95z" />
+<glyph unicode="O" horiz-adv-x="1464" d="M172 559q0 262 93 477.5t255 331t373 115.5q247 0 378.5 -148.5t131.5 -423.5q0 -255 -94 -481.5t-252 -338t-365 -111.5q-250 0 -385 149t-135 430zM276 573q0 -245 109.5 -373t319.5 -128q169 0 300 98.5t210 300t79 430.5q0 240 -104.5 364t-310.5 124 q-174 0 -308.5 -101t-214.5 -298t-80 -417z" />
+<glyph unicode="P" horiz-adv-x="1145" d="M102 0l310 1462h315q202 0 310 -92.5t108 -267.5q0 -500 -610 -500h-201l-129 -602h-103zM350 694h191q252 0 373.5 96.5t121.5 305.5q0 274 -329 274h-211z" />
+<glyph unicode="Q" horiz-adv-x="1464" d="M172 559q0 262 93 477.5t255 331t373 115.5q247 0 378.5 -148.5t131.5 -423.5q0 -216 -70 -418t-186.5 -324t-274.5 -167l267 -350h-142l-231 332l-74 -4q-250 0 -385 149t-135 430zM276 573q0 -245 109.5 -373t319.5 -128q169 0 300 98.5t210 300t79 430.5 q0 240 -104.5 364t-310.5 124q-174 0 -308.5 -101t-214.5 -298t-80 -417z" />
+<glyph unicode="R" horiz-adv-x="1145" d="M102 0l310 1462h303q430 0 430 -360q0 -182 -103.5 -303t-281.5 -152q201 -591 221 -647h-111l-211 633h-323l-131 -633h-103zM358 725h252q208 0 317 95.5t109 281.5q0 268 -329 268h-211z" />
+<glyph unicode="S" horiz-adv-x="1020" d="M37 55v109q163 -92 348 -92q188 0 295.5 86.5t107.5 232.5q0 61 -17 104.5t-52.5 78.5t-91 68t-131.5 75q-150 76 -209.5 164t-59.5 206t59 207.5t165 139t237 49.5q99 0 180 -17.5t168 -60.5l-32 -94q-66 40 -151.5 63t-164.5 23q-163 0 -259.5 -82.5t-96.5 -218.5 q0 -103 49 -170t182 -133q154 -79 213.5 -130t89 -113t29.5 -147q0 -126 -65.5 -224.5t-179.5 -148.5t-269 -50q-88 0 -172.5 17t-171.5 58z" />
+<glyph unicode="T" horiz-adv-x="985" d="M193 1368l20 94h973l-19 -94h-440l-289 -1368h-102l289 1368h-432z" />
+<glyph unicode="U" horiz-adv-x="1370" d="M176 381q0 83 27 201l186 880h103l-193 -899q-20 -89 -20 -184q0 -309 342 -309q195 0 307.5 96.5t158.5 318.5l207 977h101l-207 -977q-58 -270 -197 -387.5t-375 -117.5q-440 0 -440 401z" />
+<glyph unicode="V" horiz-adv-x="1079" d="M201 1462h100l117 -950q26 -217 35 -365h4q51 111 124 247l572 1068h117l-799 -1462h-88z" />
+<glyph unicode="W" horiz-adv-x="1702" d="M238 1462h100l47 -1031l4 -165l-2 -86h6q85 226 170 398l434 884h105l61 -878q19 -266 19 -410h6q30 86 61.5 163t493.5 1125h108q-169 -365 -330.5 -731t-328.5 -731h-78l-78 1075q-11 142 -11 219l1 47h-8q-27 -76 -62 -153.5t-563 -1187.5h-82z" />
+<glyph unicode="X" horiz-adv-x="971" d="M-135 0l608 766l-272 696h106l240 -626l483 626h119l-555 -719l285 -743h-107l-254 678l-526 -678h-127z" />
+<glyph unicode="Y" horiz-adv-x="965" d="M193 1462h100l201 -817l544 817h117l-631 -932l-108 -530h-105l119 545z" />
+<glyph unicode="Z" d="M-12 0l22 92l1069 1276h-764l23 94h887l-19 -88l-1069 -1280h799l-23 -94h-925z" />
+<glyph unicode="[" horiz-adv-x="537" d="M-57 -324l376 1786h429l-19 -90h-330l-340 -1605h330l-20 -91h-426z" />
+<glyph unicode="\" horiz-adv-x="641" d="M209 1462h86l242 -1462h-82z" />
+<glyph unicode="]" horiz-adv-x="537" d="M-176 -324l18 91h330l340 1605h-330l21 90h426l-377 -1786h-428z" />
+<glyph unicode="^" horiz-adv-x="1047" d="M70 569l587 906h91l260 -906h-105l-217 809l-500 -809h-116z" />
+<glyph unicode="_" horiz-adv-x="801" d="M-182 -291l18 86h807l-18 -86h-807z" />
+<glyph unicode="`" horiz-adv-x="1135" d="M487 1548v21h115q46 -129 164 -303v-25h-66q-50 52 -114 144.5t-99 162.5z" />
+<glyph unicode="a" horiz-adv-x="1133" d="M102 354q0 197 75 376t200.5 276.5t277.5 97.5q232 0 279 -219h6l59 202h80l-229 -1087h-82l45 274h-6q-84 -142 -187 -218t-237 -76q-281 0 -281 374zM205 365q0 -152 50 -223.5t151 -71.5q89 0 177.5 62t159 166t107.5 230t37 213q0 79 -26 141.5t-77 99t-127 36.5 q-124 0 -224 -82t-164 -245.5t-64 -325.5z" />
+<glyph unicode="b" horiz-adv-x="1151" d="M76 0l327 1556h95q-131 -628 -162 -751h6q93 156 199 229.5t231 73.5q281 0 281 -375q0 -203 -76 -380t-201 -273t-276 -96q-113 0 -186 59t-97 166h-6l-55 -209h-80zM268 346q0 -129 64 -202.5t166 -73.5q124 0 224 83t164 245t64 325q0 152 -49 223.5t-151 71.5 q-91 0 -180 -61.5t-160.5 -169.5t-106.5 -235t-35 -206z" />
+<glyph unicode="c" horiz-adv-x="887" d="M102 397q0 193 73.5 361.5t198.5 257t290 88.5q134 0 241 -43l-28 -90q-107 47 -218 47q-129 0 -232.5 -77t-162.5 -222t-59 -320q0 -158 73.5 -243.5t208.5 -85.5q71 0 131.5 13t131.5 46v-92q-116 -57 -273 -57q-174 0 -274.5 110.5t-100.5 306.5z" />
+<glyph unicode="d" horiz-adv-x="1133" d="M102 354q0 193 71.5 370t197.5 278.5t284 101.5q230 0 279 -219h4q12 66 143 671h99l-330 -1556h-82l45 274h-6q-173 -294 -424 -294q-281 0 -281 374zM205 365q0 -295 201 -295q89 0 178.5 62.5t160 168t106.5 231t36 209.5q0 126 -61.5 201.5t-168.5 75.5 q-124 0 -224 -83t-164 -242.5t-64 -327.5z" />
+<glyph unicode="e" horiz-adv-x="928" d="M102 395q0 181 71 347t195.5 264t274.5 98q114 0 182 -61t68 -166q0 -181 -163.5 -276t-485.5 -95h-33q-6 -44 -6 -98q0 -165 74 -251.5t213 -86.5q132 0 276 73v-94q-140 -69 -299 -69q-173 0 -270 109.5t-97 305.5zM225 594h49q517 0 517 270q0 67 -43.5 110.5 t-116.5 43.5q-131 0 -243.5 -115.5t-162.5 -308.5z" />
+<glyph unicode="f" horiz-adv-x="578" d="M-233 -383q53 -16 100 -16q88 0 134 53t75 186l246 1166h-205l14 67l205 14l35 160q35 168 116.5 244t227.5 76q73 0 166 -31l-25 -80q-87 27 -147 27q-96 0 -153.5 -53.5t-84.5 -178.5l-35 -164h248l-16 -81h-248l-252 -1190q-33 -161 -104 -234.5t-195 -73.5 q-48 0 -102 19v90z" />
+<glyph unicode="g" horiz-adv-x="1040" d="M-88 -217q0 236 309 334q-78 42 -78 123q0 123 191 202q-71 36 -110.5 105.5t-39.5 157.5q0 111 53.5 204t148 146t206.5 53q69 0 147 -21h361l-17 -79l-243 -11q26 -28 43.5 -84t17.5 -114q0 -109 -54.5 -206.5t-148 -145.5t-213.5 -48q-63 0 -77 9q-80 -33 -124 -73 t-44 -81t31.5 -64.5t113.5 -31.5l121 -11q346 -31 346 -264q0 -112 -65 -197.5t-187 -131.5t-291 -46q-186 0 -291.5 72t-105.5 203zM14 -207q0 -101 81 -150t224 -49q203 0 317 74.5t114 204.5q0 85 -62.5 130.5t-218.5 57.5l-160 15q-157 -45 -226 -114.5t-69 -168.5z M285 711q0 -112 58.5 -170t164.5 -58q88 0 154 37t102.5 114t36.5 169q0 104 -56 161.5t-157 57.5q-93 0 -161 -43t-105 -116t-37 -152z" />
+<glyph unicode="h" horiz-adv-x="1143" d="M76 0l332 1556h96l-86 -411q-44 -200 -66 -279h6q78 113 186.5 175.5t229.5 62.5q124 0 192 -65t68 -183q0 -70 -24 -182l-148 -674h-98l149 692q21 92 21 156q0 80 -43.5 125t-134.5 45q-112 0 -210.5 -67t-166 -188t-103.5 -286l-102 -477h-98z" />
+<glyph unicode="i" horiz-adv-x="475" d="M76 0l231 1087h96l-229 -1087h-98zM350 1366q0 55 22 88t60 33q57 0 57 -72q0 -57 -22 -90t-57 -33q-29 0 -44.5 19.5t-15.5 54.5z" />
+<glyph unicode="j" horiz-adv-x="475" d="M-279 -381q47 -22 113 -22q82 0 128.5 51.5t72.5 177.5l266 1261h96l-268 -1271q-35 -165 -106.5 -236.5t-188.5 -71.5q-62 0 -113 19v92zM350 1366q0 55 22 88t60 33q57 0 57 -72q0 -57 -22 -90t-57 -33q-29 0 -44.5 19.5t-15.5 54.5z" />
+<glyph unicode="k" horiz-adv-x="944" d="M76 0l330 1556h96l-166 -780l-70 -299h4l609 610h125l-474 -469l297 -618h-106l-264 559l-205 -188l-80 -371h-96z" />
+<glyph unicode="l" horiz-adv-x="475" d="M76 0l334 1556h94l-334 -1556h-94z" />
+<glyph unicode="m" horiz-adv-x="1751" d="M72 0l231 1087h80l-33 -210h6q80 113 181.5 170t212.5 57q106 0 163 -67t60 -195h6q77 129 181 195.5t222 66.5q117 0 182.5 -61.5t65.5 -176.5q0 -29 -2.5 -56.5t-19.5 -119.5l-152 -690h-100l149 680q25 120 25 176q0 77 -43 119.5t-119 42.5q-157 0 -277.5 -137.5 t-168.5 -362.5l-109 -518h-102l147 674q25 125 25 162q0 182 -154 182q-106 0 -200 -67.5t-159 -188.5t-100 -287l-100 -475h-98z" />
+<glyph unicode="n" horiz-adv-x="1143" d="M76 0l231 1087h82l-37 -221h6q164 238 416 238q130 0 195 -64t65 -184q0 -70 -24 -182l-148 -674h-98l149 692q21 92 21 156q0 80 -43.5 125t-134.5 45q-112 0 -210.5 -67t-166 -187.5t-103.5 -286.5l-102 -477h-98z" />
+<glyph unicode="o" horiz-adv-x="1124" d="M98 403q0 191 73 358t197 257t281 90q180 0 278.5 -108.5t98.5 -299.5q0 -197 -71.5 -368.5t-195.5 -261.5t-286 -90q-184 0 -279.5 109.5t-95.5 313.5zM201 408q0 -342 282 -342q127 0 225.5 77.5t157 228t58.5 330.5q0 154 -73 237t-210 83q-124 0 -223 -78.5 t-158 -225t-59 -310.5z" />
+<glyph unicode="p" horiz-adv-x="1149" d="M-33 -492l336 1579h82l-45 -274h6q91 153 195.5 224t228.5 71q135 0 208 -92.5t73 -282.5q0 -195 -72 -371t-197.5 -277t-283.5 -101q-230 0 -279 219h-4q-13 -72 -149 -695h-99zM266 346q0 -125 61.5 -200.5t168.5 -75.5q124 0 225 84t164 243.5t63 325.5 q0 295 -200 295q-87 0 -174 -58.5t-161.5 -167.5t-110.5 -237.5t-36 -208.5z" />
+<glyph unicode="q" horiz-adv-x="1157" d="M98 354q0 201 75.5 379t200.5 274.5t277 96.5q109 0 183.5 -58t99.5 -167h6l55 208h80l-327 -1556h-95l98 470l64 282h-6q-93 -156 -199 -229.5t-231 -73.5q-281 0 -281 374zM201 365q0 -143 45.5 -219t154.5 -76q92 0 182 62.5t160.5 171.5t105 236.5t34.5 200.5 q0 130 -63.5 203.5t-166.5 73.5q-124 0 -224 -83t-164 -245t-64 -325z" />
+<glyph unicode="r" horiz-adv-x="752" d="M72 0l231 1087h80l-29 -204h6q73 94 123 135.5t106.5 64.5t123.5 23q69 0 123 -14l-21 -93q-47 15 -113 15q-94 0 -179 -64t-153 -192t-100 -277l-100 -481h-98z" />
+<glyph unicode="s" horiz-adv-x="827" d="M25 55v107q74 -46 153 -71t148 -25q138 0 211 57.5t73 163.5q0 42 -15.5 74t-50 61.5t-132.5 85.5q-148 80 -200 145.5t-52 159.5q0 128 98.5 209.5t259.5 81.5q75 0 158.5 -17.5t140.5 -46.5l-35 -88q-136 64 -264 64q-116 0 -186 -53t-70 -138q0 -55 17 -88t60.5 -68.5 t119.5 -76.5q114 -63 161.5 -103.5t70 -86.5t22.5 -107q0 -144 -103 -229.5t-280 -85.5q-173 0 -305 75z" />
+<glyph unicode="t" horiz-adv-x="616" d="M113 1006l14 67l184 17l97 253h55l-55 -256h286l-18 -81h-283l-135 -635q-22 -99 -22 -164q0 -139 126 -139q68 0 152 26v-86q-101 -28 -170 -28q-99 0 -153 54.5t-54 158.5q0 73 29 206l129 607h-182z" />
+<glyph unicode="u" horiz-adv-x="1143" d="M109 227q0 60 22 170l150 690h100l-152 -698q-22 -106 -22 -158q0 -74 47.5 -117.5t138.5 -43.5q110 0 207.5 65.5t164 187t99.5 279.5l105 485h98l-231 -1087h-80l28 205h-6q-167 -221 -403 -221q-131 0 -198.5 62t-67.5 181z" />
+<glyph unicode="v" horiz-adv-x="895" d="M104 1087h101l108 -735q26 -165 33 -254h6q51 115 129 256l406 733h102l-600 -1087h-113z" />
+<glyph unicode="w" horiz-adv-x="1393" d="M121 1087h92l13 -821l-3 -157h6q61 134 150 297l373 681h77l64 -681q14 -147 14 -297h6l24 61l101 236l320 681h96l-508 -1087h-108l-60 686q-14 224 -14 266h-6q-34 -92 -144 -290l-356 -662h-117z" />
+<glyph unicode="x" horiz-adv-x="922" d="M-72 0l471 559l-245 528h100l207 -462l373 462h120l-448 -534l258 -553h-98l-224 483l-393 -483h-121z" />
+<glyph unicode="y" horiz-adv-x="920" d="M-217 -379q71 -27 137 -27q80 0 147 49.5t130 164.5t100 184l-174 1095h100l82 -548q51 -351 55 -449h11q43 105 186 367l348 630h103l-713 -1290q-72 -127 -122.5 -178t-114 -81t-146.5 -30q-68 0 -129 21v92z" />
+<glyph unicode="z" horiz-adv-x="887" d="M-29 0l15 72l776 932h-543l17 83h659l-18 -83l-762 -920h602l-17 -84h-729z" />
+<glyph unicode="{" horiz-adv-x="709" d="M59 528l21 78q126 0 191 49t89 158l89 393q30 135 106 195.5t215 60.5h29l-17 -86q-86 -2 -129 -20.5t-69.5 -61.5t-44.5 -120l-74 -338q-30 -134 -91.5 -194.5t-164.5 -78.5v-4q68 -18 105.5 -68.5t37.5 -121.5q0 -52 -24 -164l-47 -225q-13 -58 -13 -101 q0 -61 37.5 -89t138.5 -28v-86h-20q-256 0 -256 199q0 45 16 115l56 252q18 90 18 127q0 159 -199 159z" />
+<glyph unicode="|" d="M584 -510v2071h100v-2071h-100z" />
+<glyph unicode="}" horiz-adv-x="709" d="M-41 -238q96 2 138 21t68.5 61t43.5 121l74 338q27 126 87.5 189.5t168.5 82.5v5q-75 20 -109.5 72.5t-34.5 117.5q0 55 18 131l54 258q12 61 12 101q0 44 -18 69t-54 36t-116 11l20 86h21q131 0 189.5 -51t58.5 -147q0 -41 -17 -115l-55 -252q-19 -95 -19 -127 q0 -77 49.5 -118.5t149.5 -41.5l-20 -78q-125 0 -191 -48.5t-90 -157.5l-88 -394q-32 -139 -108.5 -197.5t-213.5 -58.5h-18v86z" />
+<glyph unicode="~" d="M127 625v94q108 110 233 110q61 0 115 -13.5t156 -57.5q126 -58 219 -58q54 0 107.5 29t117.5 96v-96q-111 -113 -233 -113q-117 0 -271 72q-62 29 -112.5 43t-108.5 14q-49 0 -108 -30.5t-115 -89.5z" />
+<glyph unicode="&#xa2;" d="M250 600q0 184 63.5 341t178 253t256.5 111l36 178h90l-38 -176q116 -4 217 -43l-29 -90q-107 47 -217 47q-130 0 -233 -76t-162.5 -221t-59.5 -322q0 -164 74.5 -247t208.5 -83q127 0 264 60v-92q-118 -58 -281 -58l-40 -202h-93l45 215q-132 25 -206 132.5t-74 272.5z " />
+<glyph unicode="&#xa3;" d="M-4 0l16 84q93 11 165.5 95.5t107.5 236.5l57 260h-199l17 82h198l76 350q41 187 155 279t290 92q170 0 313 -78l-39 -84l-54 26q-108 50 -231 50q-134 0 -220.5 -74.5t-117.5 -220.5l-73 -340h409l-18 -82h-408l-57 -268q-50 -225 -188 -314h759l-20 -94h-938z" />
+<glyph unicode="&#xa5;" d="M166 289l18 84h299l41 190h-301l17 76h258l-215 823h100l201 -817l544 817h117l-559 -823h266l-16 -76h-315l-39 -190h317l-18 -84h-316l-59 -289h-105l64 289h-299z" />
+<glyph unicode="&#xa9;" horiz-adv-x="1704" d="M147 731q0 200 100 375t275 276t377 101q200 0 375 -100t276 -275t101 -377q0 -197 -97 -370t-272 -277t-383 -104q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM240 731q0 -178 88.5 -329.5t240.5 -240.5t330 -89q174 0 325 85.5t243 239t92 334.5q0 178 -89 330 t-240.5 241t-330.5 89q-182 0 -335 -92t-238.5 -243t-85.5 -325zM537 725q0 207 110 332t297 125q119 0 227 -52l-36 -83q-99 45 -191 45q-142 0 -222.5 -94.5t-80.5 -264.5q0 -186 74.5 -275t220.5 -89q85 0 199 43v-88q-104 -45 -209 -45q-187 0 -288 116t-101 330z" />
+<glyph unicode="&#xad;" horiz-adv-x="629" d="M82 502l18 90h457l-16 -90h-459z" />
+<glyph unicode="&#xae;" horiz-adv-x="1704" d="M150 731q0 207 103.5 382t276.5 272.5t371 97.5q200 0 375 -100t276 -275t101 -377q0 -197 -97 -370t-272 -277t-383 -104q-204 0 -376.5 100.5t-273.5 273t-101 377.5zM242 731q0 -178 88.5 -329.5t240.5 -240.5t330 -89q174 0 325 85.5t243 239t92 334.5q0 178 -89 330 t-240.5 241t-330.5 89q-182 0 -335 -92t-238.5 -243t-85.5 -325zM657 291v880h211q143 0 222 -62t79 -191q0 -80 -39.5 -141t-109.5 -93l237 -393h-120l-211 360h-168v-360h-101zM758 731h112q93 0 144 46.5t51 135.5q0 172 -197 172h-110v-354z" />
+<glyph unicode="&#xb4;" horiz-adv-x="1135" d="M580 1241v21q66 51 150.5 142t129.5 165h137v-23q-51 -66 -157.5 -158.5t-192.5 -146.5h-67z" />
+<glyph unicode="&#x2000;" horiz-adv-x="784" />
+<glyph unicode="&#x2001;" horiz-adv-x="1569" />
+<glyph unicode="&#x2002;" horiz-adv-x="784" />
+<glyph unicode="&#x2003;" horiz-adv-x="1569" />
+<glyph unicode="&#x2004;" horiz-adv-x="523" />
+<glyph unicode="&#x2005;" horiz-adv-x="392" />
+<glyph unicode="&#x2006;" horiz-adv-x="261" />
+<glyph unicode="&#x2007;" horiz-adv-x="261" />
+<glyph unicode="&#x2008;" horiz-adv-x="196" />
+<glyph unicode="&#x2009;" horiz-adv-x="313" />
+<glyph unicode="&#x200a;" horiz-adv-x="87" />
+<glyph unicode="&#x2010;" horiz-adv-x="629" d="M82 502l18 90h457l-16 -90h-459z" />
+<glyph unicode="&#x2011;" horiz-adv-x="629" d="M82 502l18 90h457l-16 -90h-459z" />
+<glyph unicode="&#x2012;" horiz-adv-x="629" d="M82 502l18 90h457l-16 -90h-459z" />
+<glyph unicode="&#x2013;" horiz-adv-x="983" d="M66 502l18 90h807l-17 -90h-808z" />
+<glyph unicode="&#x2014;" horiz-adv-x="1966" d="M68 502l18 90h1788l-16 -90h-1790z" />
+<glyph unicode="&#x2018;" horiz-adv-x="299" d="M129 983q41 100 116 231t161 248h73q-66 -106 -129.5 -242.5t-103.5 -258.5h-113z" />
+<glyph unicode="&#x2019;" horiz-adv-x="299" d="M129 961q66 106 129.5 242.5t103.5 258.5h113l4 -22q-43 -105 -117.5 -235.5t-158.5 -243.5h-74z" />
+<glyph unicode="&#x201c;" horiz-adv-x="631" d="M129 983q41 100 116 231t161 248h73q-66 -106 -129.5 -242.5t-103.5 -258.5h-113zM463 983q43 104 120 238.5t156 240.5h74q-66 -106 -129.5 -242.5t-103.5 -258.5h-113z" />
+<glyph unicode="&#x201d;" horiz-adv-x="631" d="M129 961q66 106 129.5 242.5t103.5 258.5h113l4 -22q-43 -105 -117.5 -235.5t-158.5 -243.5h-74zM463 961q66 106 129.5 242.5t103.5 258.5h113l4 -22q-43 -105 -117.5 -235.5t-158.5 -243.5h-74z" />
+<glyph unicode="&#x2022;" horiz-adv-x="793" d="M248 682q0 137 63 213t172 76q76 0 116 -39.5t40 -118.5q0 -125 -66 -207t-176 -82q-149 0 -149 158z" />
+<glyph unicode="&#x2026;" horiz-adv-x="1489" d="M69 55q0 56 25 88.5t69 32.5q66 0 66 -72q0 -53 -25 -87.5t-67 -34.5q-68 0 -68 73zM569 55q0 56 25 88.5t69 32.5q66 0 66 -72q0 -53 -25 -87.5t-67 -34.5q-68 0 -68 73zM1071 55q0 56 25 88.5t69 32.5q66 0 66 -72q0 -53 -25 -87.5t-67 -34.5q-68 0 -68 73z" />
+<glyph unicode="&#x202f;" horiz-adv-x="313" />
+<glyph unicode="&#x205f;" horiz-adv-x="392" />
+<glyph unicode="&#x20ac;" d="M80 541l16 82h172q5 101 35 217h-170l19 82h174q95 273 270 417t399 144q166 0 287 -90l-53 -82q-102 78 -238 78q-186 0 -330.5 -120.5t-226.5 -346.5h457l-21 -82h-460q-30 -98 -39 -217h442l-20 -82h-424q0 -243 89 -356t265 -113q115 0 252 57v-94q-129 -55 -270 -55 q-209 0 -325 139.5t-116 394.5v27h-184z" />
+<glyph unicode="&#x2122;" horiz-adv-x="1534" d="M174 1384v78h522v-78h-219v-643h-86v643h-217zM772 741v721h125l221 -606l223 606h125v-721h-86v398l4 207h-6l-227 -605h-74l-221 609h-6l4 -201v-408h-82z" />
+<glyph unicode="&#xe000;" horiz-adv-x="1085" d="M0 1085h1085v-1085h-1085v1085z" />
+</font>
+</defs></svg> 
\ No newline at end of file
diff --git a/fonts/OpenSans-LightItalic-webfont.ttf b/fonts/OpenSans-LightItalic-webfont.ttf
new file mode 100644
index 0000000..5898c8c
Binary files /dev/null and b/fonts/OpenSans-LightItalic-webfont.ttf differ
diff --git a/fonts/OpenSans-LightItalic-webfont.woff b/fonts/OpenSans-LightItalic-webfont.woff
new file mode 100644
index 0000000..9c978dc
Binary files /dev/null and b/fonts/OpenSans-LightItalic-webfont.woff differ
diff --git a/fonts/OpenSans-Regular-webfont.eot b/fonts/OpenSans-Regular-webfont.eot
new file mode 100644
index 0000000..dd6fd2c
Binary files /dev/null and b/fonts/OpenSans-Regular-webfont.eot differ
diff --git a/fonts/OpenSans-Regular-webfont.svg b/fonts/OpenSans-Regular-webfont.svg
new file mode 100644
index 0000000..01038bb
--- /dev/null
+++ b/fonts/OpenSans-Regular-webfont.svg
@@ -0,0 +1,146 @@
+<?xml version="1.0" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
+<svg xmlns="http://www.w3.org/2000/svg">
+<metadata>
+This is a custom SVG webfont generated by Font Squirrel.
+Copyright   : Digitized data copyright  20102011 Google Corporation
+Foundry     : Ascender Corporation
+Foundry URL : httpwwwascendercorpcom
+</metadata>
+<defs>
+<font id="OpenSansRegular" horiz-adv-x="1171" >
+<font-face units-per-em="2048" ascent="1638" descent="-410" />
+<missing-glyph horiz-adv-x="532" />
+<glyph unicode=" "  horiz-adv-x="532" />
+<glyph unicode="&#x09;" horiz-adv-x="532" />
+<glyph unicode="&#xa0;" horiz-adv-x="532" />
+<glyph unicode="!" horiz-adv-x="547" d="M152 106q0 136 120 136q58 0 89.5 -35t31.5 -101q0 -64 -32 -99.5t-89 -35.5q-52 0 -86 31.5t-34 103.5zM170 1462h207l-51 -1059h-105z" />
+<glyph unicode="&#x22;" horiz-adv-x="821" d="M133 1462h186l-40 -528h-105zM502 1462h186l-41 -528h-104z" />
+<glyph unicode="#" horiz-adv-x="1323" d="M51 430v129h287l68 340h-277v127h299l82 436h139l-82 -436h305l84 436h134l-84 -436h264v-127h-289l-66 -340h283v-129h-307l-84 -430h-137l84 430h-303l-82 -430h-136l80 430h-262zM475 559h303l66 340h-303z" />
+<glyph unicode="$" d="M131 170v156q83 -37 191.5 -60.5t197.5 -23.5v440q-205 65 -287.5 151t-82.5 222q0 131 101.5 215t268.5 102v182h129v-180q184 -5 355 -74l-52 -131q-149 59 -303 70v-434q157 -50 235 -97.5t115 -109t37 -149.5q0 -136 -102 -224.5t-285 -111.5v-232h-129v223 q-112 0 -217 17.5t-172 48.5zM319 1057q0 -76 45 -122t156 -87v387q-99 -16 -150 -62.5t-51 -115.5zM649 252q217 30 217 184q0 72 -44.5 116.5t-172.5 88.5v-389z" />
+<glyph unicode="%" horiz-adv-x="1686" d="M104 1026q0 227 74.5 342t220.5 115q145 0 223 -119t78 -338q0 -228 -76.5 -344.5t-224.5 -116.5q-140 0 -217.5 119t-77.5 342zM242 1026q0 -170 37 -255t120 -85q164 0 164 340q0 338 -164 338q-83 0 -120 -84t-37 -254zM365 0l811 1462h147l-811 -1462h-147zM985 440 q0 227 74.5 342t220.5 115q142 0 221.5 -117.5t79.5 -339.5q0 -227 -76.5 -343.5t-224.5 -116.5q-142 0 -218.5 119t-76.5 341zM1122 440q0 -171 37 -255.5t121 -84.5t124 83.5t40 256.5q0 171 -40 253.5t-124 82.5t-121 -82.5t-37 -253.5z" />
+<glyph unicode="&#x26;" horiz-adv-x="1495" d="M113 379q0 130 69.5 230t249.5 202q-85 95 -115.5 144t-48.5 102t-18 110q0 150 98 234t273 84q162 0 255 -83.5t93 -232.5q0 -107 -68 -197.5t-225 -183.5l407 -391q56 62 89.5 145.5t56.5 182.5h168q-68 -286 -205 -434l299 -291h-229l-185 178q-118 -106 -240 -152 t-272 -46q-215 0 -333.5 106t-118.5 293zM285 383q0 -117 77.5 -185.5t206.5 -68.5q241 0 400 154l-437 424q-111 -68 -157 -112.5t-68 -95.5t-22 -116zM414 1171q0 -69 36 -131.5t123 -150.5q129 75 179.5 138.5t50.5 146.5q0 77 -51.5 125.5t-137.5 48.5q-89 0 -144.5 -48 t-55.5 -129z" />
+<glyph unicode="'" horiz-adv-x="453" d="M133 1462h186l-40 -528h-105z" />
+<glyph unicode="(" horiz-adv-x="606" d="M82 561q0 265 77.5 496t223.5 405h162q-144 -193 -216.5 -424t-72.5 -475q0 -240 74 -469t213 -418h-160q-147 170 -224 397t-77 488z" />
+<glyph unicode=")" horiz-adv-x="606" d="M61 1462h162q147 -175 224 -406.5t77 -494.5t-77.5 -490t-223.5 -395h-160q139 188 213 417.5t74 469.5q0 244 -72.5 475t-216.5 424z" />
+<glyph unicode="*" horiz-adv-x="1130" d="M86 1090l29 182l391 -111l-43 395h194l-43 -395l398 111l26 -182l-381 -31l248 -326l-172 -94l-176 362l-160 -362l-176 94l242 326z" />
+<glyph unicode="+" d="M104 653v138h410v428h139v-428h412v-138h-412v-426h-139v426h-410z" />
+<glyph unicode="," horiz-adv-x="502" d="M63 -264q27 104 59.5 257t45.5 245h182l15 -23q-26 -100 -75 -232.5t-102 -246.5h-125z" />
+<glyph unicode="-" horiz-adv-x="659" d="M84 473v152h491v-152h-491z" />
+<glyph unicode="." horiz-adv-x="545" d="M152 106q0 67 30.5 101.5t87.5 34.5q58 0 90.5 -34.5t32.5 -101.5q0 -65 -33 -100t-90 -35q-51 0 -84.5 31.5t-33.5 103.5z" />
+<glyph unicode="/" horiz-adv-x="752" d="M20 0l545 1462h166l-545 -1462h-166z" />
+<glyph unicode="0" d="M102 733q0 382 119 567t363 185q238 0 361.5 -193t123.5 -559q0 -379 -119.5 -566t-365.5 -187q-236 0 -359 191.5t-123 561.5zM270 733q0 -319 75 -464.5t239 -145.5q166 0 240.5 147.5t74.5 462.5t-74.5 461.5t-240.5 146.5q-164 0 -239 -144.5t-75 -463.5z" />
+<glyph unicode="1" d="M188 1163l387 299h140v-1462h-162v1042q0 130 8 246q-21 -21 -47 -44t-238 -195z" />
+<glyph unicode="2" d="M100 0v143l385 387q176 178 232 254t84 148t28 155q0 117 -71 185.5t-197 68.5q-91 0 -172.5 -30t-181.5 -109l-88 113q202 168 440 168q206 0 323 -105.5t117 -283.5q0 -139 -78 -275t-292 -344l-320 -313v-8h752v-154h-961z" />
+<glyph unicode="3" d="M94 59v158q95 -47 202.5 -71.5t203.5 -24.5q379 0 379 297q0 266 -418 266h-144v143h146q171 0 271 75.5t100 209.5q0 107 -73.5 168t-199.5 61q-96 0 -181 -26t-194 -96l-84 112q90 71 207.5 111.5t247.5 40.5q213 0 331 -97.5t118 -267.5q0 -140 -78.5 -229 t-222.5 -119v-8q176 -22 261 -112t85 -236q0 -209 -145 -321.5t-412 -112.5q-116 0 -212.5 17.5t-187.5 61.5z" />
+<glyph unicode="4" d="M43 336v145l694 989h176v-983h217v-151h-217v-336h-159v336h-711zM209 487h545v486q0 143 10 323h-8q-48 -96 -90 -159z" />
+<glyph unicode="5" d="M133 59v160q70 -45 174 -70.5t205 -25.5q176 0 273.5 83t97.5 240q0 306 -375 306q-95 0 -254 -29l-86 55l55 684h727v-153h-585l-37 -439q115 23 229 23q231 0 363.5 -114.5t132.5 -313.5q0 -227 -144.5 -356t-398.5 -129q-247 0 -377 79z" />
+<glyph unicode="6" d="M117 625q0 431 167.5 644.5t495.5 213.5q113 0 178 -19v-143q-77 25 -176 25q-235 0 -359 -146.5t-136 -460.5h12q110 172 348 172q197 0 310.5 -119t113.5 -323q0 -228 -124.5 -358.5t-336.5 -130.5q-227 0 -360 170.5t-133 474.5zM287 506q0 -103 40 -192t113.5 -141 t167.5 -52q142 0 220.5 89.5t78.5 258.5q0 145 -73 228t-218 83q-90 0 -165 -37t-119.5 -102t-44.5 -135z" />
+<glyph unicode="7" d="M94 1309v153h973v-133l-598 -1329h-184l606 1309h-797z" />
+<glyph unicode="8" d="M104 373q0 251 306 391q-138 78 -198 168.5t-60 202.5q0 159 117.5 253.5t314.5 94.5q200 0 317 -93t117 -257q0 -108 -67 -197t-214 -162q178 -85 253 -178.5t75 -216.5q0 -182 -127 -290.5t-348 -108.5q-234 0 -360 102.5t-126 290.5zM268 369q0 -120 83.5 -187 t234.5 -67q149 0 232 70t83 192q0 97 -78 172.5t-272 146.5q-149 -64 -216 -141.5t-67 -185.5zM315 1128q0 -92 59 -158t218 -132q143 60 202.5 129t59.5 161q0 101 -72.5 160.5t-199.5 59.5q-125 0 -196 -60t-71 -160z" />
+<glyph unicode="9" d="M106 991q0 228 127.5 360t335.5 132q149 0 260.5 -76.5t171.5 -223t60 -345.5q0 -858 -664 -858q-116 0 -184 20v143q80 -26 182 -26q240 0 362.5 148.5t133.5 455.5h-12q-55 -83 -146 -126.5t-205 -43.5q-194 0 -308 116t-114 324zM270 993q0 -144 72 -226.5t219 -82.5 q91 0 167.5 37t120.5 101t44 134q0 105 -41 194t-114.5 140t-168.5 51q-143 0 -221 -92t-78 -256z" />
+<glyph unicode=":" horiz-adv-x="545" d="M152 106q0 67 30.5 101.5t87.5 34.5q58 0 90.5 -34.5t32.5 -101.5q0 -65 -33 -100t-90 -35q-51 0 -84.5 31.5t-33.5 103.5zM152 989q0 135 118 135q123 0 123 -135q0 -65 -33 -100t-90 -35q-51 0 -84.5 31.5t-33.5 103.5z" />
+<glyph unicode=";" horiz-adv-x="545" d="M63 -264q27 104 59.5 257t45.5 245h182l15 -23q-26 -100 -75 -232.5t-102 -246.5h-125zM147 989q0 135 119 135q123 0 123 -135q0 -65 -33 -100t-90 -35q-58 0 -88.5 35t-30.5 100z" />
+<glyph unicode="&#x3c;" d="M104 664v98l961 479v-149l-782 -371l782 -328v-151z" />
+<glyph unicode="=" d="M119 449v137h930v-137h-930zM119 858v137h930v-137h-930z" />
+<glyph unicode="&#x3e;" d="M104 242v151l783 326l-783 373v149l961 -479v-98z" />
+<glyph unicode="?" horiz-adv-x="879" d="M27 1384q189 99 395 99q191 0 297 -94t106 -265q0 -73 -19.5 -128.5t-57.5 -105t-164 -159.5q-101 -86 -133.5 -143t-32.5 -152v-33h-129v54q0 117 36 192.5t134 159.5q136 115 171.5 173t35.5 140q0 102 -65.5 157.5t-188.5 55.5q-79 0 -154 -18.5t-172 -67.5zM240 106 q0 136 120 136q58 0 89.5 -35t31.5 -101q0 -64 -32 -99.5t-89 -35.5q-52 0 -86 31.5t-34 103.5z" />
+<glyph unicode="@" horiz-adv-x="1841" d="M121 571q0 260 107 463t305 314.5t454 111.5q215 0 382.5 -90.5t259 -257t91.5 -383.5q0 -142 -44 -260t-124 -183t-184 -65q-86 0 -145 52t-70 133h-8q-40 -87 -114.5 -136t-176.5 -49q-150 0 -234.5 102.5t-84.5 278.5q0 204 118 331.5t310 127.5q68 0 154 -12.5 t155 -34.5l-25 -470v-22q0 -178 133 -178q91 0 148 107.5t57 279.5q0 181 -74 317t-210.5 209.5t-313.5 73.5q-223 0 -388 -92.5t-252 -264t-87 -396.5q0 -305 161 -469t464 -164q210 0 436 86v-133q-192 -84 -436 -84q-363 0 -563.5 199.5t-200.5 557.5zM686 598 q0 -254 195 -254q207 0 225 313l14 261q-72 20 -157 20q-130 0 -203.5 -90t-73.5 -250z" />
+<glyph unicode="A" horiz-adv-x="1296" d="M0 0l578 1468h143l575 -1468h-176l-182 465h-586l-180 -465h-172zM412 618h473l-170 453q-33 86 -68 211q-22 -96 -63 -211z" />
+<glyph unicode="B" horiz-adv-x="1327" d="M201 0v1462h413q291 0 421 -87t130 -275q0 -130 -72.5 -214.5t-211.5 -109.5v-10q333 -57 333 -350q0 -196 -132.5 -306t-370.5 -110h-510zM371 145h305q177 0 266.5 68.5t89.5 214.5q0 136 -91.5 200t-278.5 64h-291v-547zM371 836h280q180 0 259 56.5t79 190.5 q0 123 -88 177.5t-280 54.5h-250v-479z" />
+<glyph unicode="C" horiz-adv-x="1292" d="M125 733q0 226 84.5 396t244 262t375.5 92q230 0 402 -84l-72 -146q-166 78 -332 78q-241 0 -380.5 -160.5t-139.5 -439.5q0 -287 134.5 -443.5t383.5 -156.5q153 0 349 55v-149q-152 -57 -375 -57q-323 0 -498.5 196t-175.5 557z" />
+<glyph unicode="D" horiz-adv-x="1493" d="M201 0v1462h448q341 0 530 -189t189 -528q0 -362 -196.5 -553.5t-565.5 -191.5h-405zM371 147h207q304 0 457 149.5t153 442.5q0 286 -143.5 431t-426.5 145h-247v-1168z" />
+<glyph unicode="E" horiz-adv-x="1139" d="M201 0v1462h815v-151h-645v-471h606v-150h-606v-538h645v-152h-815z" />
+<glyph unicode="F" horiz-adv-x="1057" d="M201 0v1462h815v-151h-645v-535h606v-151h-606v-625h-170z" />
+<glyph unicode="G" horiz-adv-x="1491" d="M125 731q0 228 91.5 399.5t263.5 262t403 90.5q234 0 436 -86l-66 -150q-198 84 -381 84q-267 0 -417 -159t-150 -441q0 -296 144.5 -449t424.5 -153q152 0 297 35v450h-327v152h497v-711q-116 -37 -236 -56t-278 -19q-332 0 -517 197.5t-185 553.5z" />
+<glyph unicode="H" horiz-adv-x="1511" d="M201 0v1462h170v-622h770v622h170v-1462h-170v688h-770v-688h-170z" />
+<glyph unicode="I" horiz-adv-x="571" d="M201 0v1462h170v-1462h-170z" />
+<glyph unicode="J" horiz-adv-x="547" d="M-160 -213q71 -20 148 -20q99 0 150.5 60t51.5 173v1462h170v-1448q0 -190 -96 -294.5t-276 -104.5q-94 0 -148 27v145z" />
+<glyph unicode="K" horiz-adv-x="1257" d="M201 0v1462h170v-725l663 725h201l-588 -635l610 -827h-200l-533 709l-153 -136v-573h-170z" />
+<glyph unicode="L" horiz-adv-x="1063" d="M201 0v1462h170v-1308h645v-154h-815z" />
+<glyph unicode="M" horiz-adv-x="1849" d="M201 0v1462h256l463 -1206h8l467 1206h254v-1462h-170v942q0 162 14 352h-8l-500 -1294h-137l-496 1296h-8q14 -154 14 -366v-930h-157z" />
+<glyph unicode="N" horiz-adv-x="1544" d="M201 0v1462h192l797 -1222h8q-2 28 -9 174q-5 114 -5 177v32v839h159v-1462h-194l-799 1227h-8q16 -216 16 -396v-831h-157z" />
+<glyph unicode="O" horiz-adv-x="1595" d="M125 735q0 357 176 553.5t500 196.5q315 0 492 -200t177 -552q0 -351 -177.5 -552t-493.5 -201q-323 0 -498.5 197.5t-175.5 557.5zM305 733q0 -297 126.5 -450.5t367.5 -153.5q243 0 367 153t124 451q0 295 -123.5 447.5t-365.5 152.5q-243 0 -369.5 -153.5 t-126.5 -446.5z" />
+<glyph unicode="P" horiz-adv-x="1233" d="M201 0v1462h379q548 0 548 -426q0 -222 -151.5 -341.5t-433.5 -119.5h-172v-575h-170zM371 721h153q226 0 327 73t101 234q0 145 -95 216t-296 71h-190v-594z" />
+<glyph unicode="Q" horiz-adv-x="1595" d="M125 735q0 357 176 553.5t500 196.5q315 0 492 -200t177 -552q0 -281 -113 -467t-319 -252l348 -362h-247l-285 330l-55 -2q-323 0 -498.5 197.5t-175.5 557.5zM305 733q0 -297 126.5 -450.5t367.5 -153.5q243 0 367 153t124 451q0 295 -123.5 447.5t-365.5 152.5 q-243 0 -369.5 -153.5t-126.5 -446.5z" />
+<glyph unicode="R" horiz-adv-x="1266" d="M201 0v1462h401q269 0 397.5 -103t128.5 -310q0 -290 -294 -392l397 -657h-201l-354 608h-305v-608h-170zM371 754h233q180 0 264 71.5t84 214.5q0 145 -85.5 209t-274.5 64h-221v-559z" />
+<glyph unicode="S" horiz-adv-x="1124" d="M106 47v164q90 -38 196 -60t210 -22q170 0 256 64.5t86 179.5q0 76 -30.5 124.5t-102 89.5t-217.5 93q-204 73 -291.5 173t-87.5 261q0 169 127 269t336 100q218 0 401 -80l-53 -148q-181 76 -352 76q-135 0 -211 -58t-76 -161q0 -76 28 -124.5t94.5 -89t203.5 -89.5 q230 -82 316.5 -176t86.5 -244q0 -193 -140 -301t-380 -108q-260 0 -400 67z" />
+<glyph unicode="T" horiz-adv-x="1133" d="M18 1311v151h1096v-151h-463v-1311h-170v1311h-463z" />
+<glyph unicode="U" horiz-adv-x="1491" d="M186 520v942h170v-954q0 -183 100 -281t294 -98q185 0 285 98.5t100 282.5v952h170v-946q0 -250 -151 -393t-415 -143t-408.5 144t-144.5 396z" />
+<glyph unicode="V" horiz-adv-x="1219" d="M0 1462h180l336 -946q58 -163 92 -317q36 162 94 323l334 940h183l-527 -1462h-168z" />
+<glyph unicode="W" horiz-adv-x="1896" d="M27 1462h180l231 -903q48 -190 70 -344q27 183 80 358l262 889h180l275 -897q48 -155 81 -350q19 142 72 346l230 901h180l-391 -1462h-168l-295 979q-21 65 -47 164t-27 119q-22 -132 -70 -289l-286 -973h-168z" />
+<glyph unicode="X" horiz-adv-x="1182" d="M8 0l486 764l-453 698h188l363 -579l366 579h181l-453 -692l488 -770h-193l-393 643l-400 -643h-180z" />
+<glyph unicode="Y" horiz-adv-x="1147" d="M0 1462h186l387 -731l390 731h184l-488 -895v-567h-172v559z" />
+<glyph unicode="Z" horiz-adv-x="1169" d="M82 0v133l776 1176h-752v153h959v-133l-776 -1175h798v-154h-1005z" />
+<glyph unicode="[" horiz-adv-x="674" d="M166 -324v1786h457v-141h-289v-1503h289v-142h-457z" />
+<glyph unicode="\" horiz-adv-x="752" d="M23 1462h163l547 -1462h-166z" />
+<glyph unicode="]" horiz-adv-x="674" d="M51 -182h289v1503h-289v141h457v-1786h-457v142z" />
+<glyph unicode="^" horiz-adv-x="1110" d="M49 551l434 922h99l477 -922h-152l-372 745l-334 -745h-152z" />
+<glyph unicode="_" horiz-adv-x="918" d="M-4 -184h926v-131h-926v131z" />
+<glyph unicode="`" horiz-adv-x="1182" d="M393 1548v21h203q32 -69 89 -159.5t101 -143.5v-25h-110q-65 52 -154 148t-129 159z" />
+<glyph unicode="a" horiz-adv-x="1139" d="M94 303q0 332 531 348l186 6v68q0 129 -55.5 190.5t-177.5 61.5q-137 0 -310 -84l-51 127q81 44 177.5 69t193.5 25q196 0 290.5 -87t94.5 -279v-748h-123l-33 156h-8q-82 -103 -163.5 -139.5t-203.5 -36.5q-163 0 -255.5 84t-92.5 239zM268 301q0 -90 54.5 -137 t152.5 -47q155 0 243.5 85t88.5 238v99l-166 -7q-198 -7 -285.5 -61.5t-87.5 -169.5z" />
+<glyph unicode="b" horiz-adv-x="1255" d="M176 0v1556h166v-378q0 -127 -8 -228h8q116 164 344 164q216 0 335.5 -147.5t119.5 -417.5t-120.5 -419.5t-334.5 -149.5q-107 0 -195.5 39.5t-148.5 121.5h-12l-35 -141h-119zM342 549q0 -231 77 -330.5t247 -99.5q153 0 228 111.5t75 320.5q0 214 -75 319t-232 105 q-170 0 -245 -97.5t-75 -328.5z" />
+<glyph unicode="c" horiz-adv-x="975" d="M115 541q0 275 132.5 425t377.5 150q79 0 158 -17t124 -40l-51 -141q-55 22 -120 36.5t-115 14.5q-334 0 -334 -426q0 -202 81.5 -310t241.5 -108q137 0 281 59v-147q-110 -57 -277 -57q-238 0 -368.5 146.5t-130.5 414.5z" />
+<glyph unicode="d" horiz-adv-x="1255" d="M115 545q0 271 120 421t334 150q223 0 342 -162h13l-7 79l-4 77v446h166v-1556h-135l-22 147h-9q-115 -167 -344 -167q-215 0 -334.5 147t-119.5 418zM287 543q0 -210 77 -317t226 -107q170 0 246.5 92.5t76.5 298.5v35q0 233 -77.5 332.5t-247.5 99.5 q-146 0 -223.5 -113.5t-77.5 -320.5z" />
+<glyph unicode="e" horiz-adv-x="1149" d="M115 539q0 265 130.5 421t350.5 156q206 0 326 -135.5t120 -357.5v-105h-755q5 -193 97.5 -293t260.5 -100q177 0 350 74v-148q-88 -38 -166.5 -54.5t-189.5 -16.5q-243 0 -383.5 148t-140.5 411zM291 653h573q0 157 -70 240.5t-200 83.5q-132 0 -210.5 -86t-92.5 -238z " />
+<glyph unicode="f" horiz-adv-x="694" d="M29 967v75l196 60v61q0 404 353 404q87 0 204 -35l-43 -133q-96 31 -164 31q-94 0 -139 -62.5t-45 -200.5v-71h279v-129h-279v-967h-166v967h-196z" />
+<glyph unicode="g" horiz-adv-x="1122" d="M39 -186q0 100 64 173t180 99q-42 19 -70.5 59t-28.5 93q0 60 32 105t101 87q-85 35 -138.5 119t-53.5 192q0 180 108 277.5t306 97.5q86 0 155 -20h379v-105l-203 -24q28 -35 50 -91.5t22 -127.5q0 -161 -110 -257t-302 -96q-49 0 -92 8q-106 -56 -106 -141 q0 -45 37 -66.5t127 -21.5h194q178 0 273.5 -75t95.5 -218q0 -182 -146 -277.5t-426 -95.5q-215 0 -331.5 80t-116.5 226zM199 -184q0 -89 75 -135t215 -46q209 0 309.5 62.5t100.5 169.5q0 89 -55 123.5t-207 34.5h-199q-113 0 -176 -54t-63 -155zM289 745q0 -115 65 -174 t181 -59q243 0 243 236q0 247 -246 247q-117 0 -180 -63t-63 -187z" />
+<glyph unicode="h" horiz-adv-x="1257" d="M176 0v1556h166v-471q0 -85 -8 -141h10q49 79 139.5 124.5t206.5 45.5q201 0 301.5 -95.5t100.5 -303.5v-715h-166v709q0 134 -61 200t-191 66q-173 0 -252.5 -94t-79.5 -308v-573h-166z" />
+<glyph unicode="i" horiz-adv-x="518" d="M162 1393q0 57 28 83.5t70 26.5q40 0 69 -27t29 -83t-29 -83.5t-69 -27.5q-42 0 -70 27.5t-28 83.5zM176 0v1096h166v-1096h-166z" />
+<glyph unicode="j" horiz-adv-x="518" d="M-111 -332q69 -20 136 -20q78 0 114.5 42.5t36.5 129.5v1276h166v-1264q0 -324 -299 -324q-95 0 -154 25v135zM162 1393q0 57 28 83.5t70 26.5q40 0 69 -27t29 -83t-29 -83.5t-69 -27.5q-42 0 -70 27.5t-28 83.5z" />
+<glyph unicode="k" horiz-adv-x="1075" d="M176 0v1556h164v-825q0 -55 -8 -170h8q43 61 131 160l354 375h197l-444 -467l475 -629h-201l-387 518l-125 -108v-410h-164z" />
+<glyph unicode="l" horiz-adv-x="518" d="M176 0v1556h166v-1556h-166z" />
+<glyph unicode="m" horiz-adv-x="1905" d="M176 0v1096h135l27 -150h8q47 80 132.5 125t191.5 45q257 0 336 -186h8q49 86 142 136t212 50q186 0 278.5 -95.5t92.5 -305.5v-715h-166v713q0 131 -56 196.5t-174 65.5q-155 0 -229 -89t-74 -274v-612h-166v713q0 131 -56 196.5t-175 65.5q-156 0 -228.5 -93.5 t-72.5 -306.5v-575h-166z" />
+<glyph unicode="n" horiz-adv-x="1257" d="M176 0v1096h135l27 -150h8q51 81 143 125.5t205 44.5q198 0 298 -95.5t100 -305.5v-715h-166v709q0 134 -61 200t-191 66q-172 0 -252 -93t-80 -307v-575h-166z" />
+<glyph unicode="o" horiz-adv-x="1237" d="M115 549q0 268 134 417.5t372 149.5q230 0 365.5 -153t135.5 -414q0 -268 -135 -418.5t-373 -150.5q-147 0 -261 69t-176 198t-62 302zM287 549q0 -210 84 -320t247 -110t247.5 109.5t84.5 320.5q0 209 -84.5 317.5t-249.5 108.5q-163 0 -246 -107t-83 -319z" />
+<glyph unicode="p" horiz-adv-x="1255" d="M176 -492v1588h135l23 -150h8q64 90 149 130t195 40q218 0 336.5 -149t118.5 -418q0 -270 -120.5 -419.5t-334.5 -149.5q-107 0 -195.5 39.5t-148.5 121.5h-12q12 -96 12 -182v-451h-166zM342 549q0 -231 77 -330.5t247 -99.5q142 0 222.5 115t80.5 317 q0 205 -80.5 314.5t-226.5 109.5q-168 0 -243 -93t-77 -296v-37z" />
+<glyph unicode="q" horiz-adv-x="1255" d="M115 545q0 269 120 420t334 151q225 0 346 -170h9l24 150h131v-1588h-166v469q0 100 11 170h-13q-115 -167 -346 -167q-212 0 -331 149t-119 416zM287 543q0 -207 76.5 -315.5t226.5 -108.5q166 0 242 89t81 300v37q0 230 -78 331t-247 101q-146 0 -223.5 -113.5 t-77.5 -320.5z" />
+<glyph unicode="r" horiz-adv-x="836" d="M176 0v1096h137l19 -203h8q61 107 147 165t189 58q73 0 131 -12l-23 -154q-68 15 -120 15q-133 0 -227.5 -108t-94.5 -269v-588h-166z" />
+<glyph unicode="s" horiz-adv-x="977" d="M106 827q0 134 109 211.5t299 77.5q177 0 346 -72l-59 -135q-165 68 -299 68q-118 0 -178 -37t-60 -102q0 -44 22.5 -75t72.5 -59t192 -81q195 -71 263.5 -143t68.5 -181q0 -153 -114 -236t-320 -83q-218 0 -340 69v154q79 -40 169.5 -63t174.5 -23q130 0 200 41.5 t70 126.5q0 64 -55.5 109.5t-216.5 107.5q-153 57 -217.5 99.5t-96 96.5t-31.5 129z" />
+<glyph unicode="t" horiz-adv-x="723" d="M31 967v80l157 69l70 234h96v-254h318v-129h-318v-645q0 -99 47 -152t129 -53q44 0 85 6.5t65 13.5v-127q-27 -13 -79.5 -21.5t-94.5 -8.5q-318 0 -318 335v652h-157z" />
+<glyph unicode="u" horiz-adv-x="1257" d="M164 379v717h168v-711q0 -134 61 -200t191 -66q172 0 251.5 94t79.5 307v576h166v-1096h-137l-24 147h-9q-51 -81 -141.5 -124t-206.5 -43q-200 0 -299.5 95t-99.5 304z" />
+<glyph unicode="v" horiz-adv-x="1026" d="M0 1096h178l236 -650q80 -228 94 -296h8q11 53 69.5 219.5t262.5 726.5h178l-416 -1096h-194z" />
+<glyph unicode="w" horiz-adv-x="1593" d="M23 1096h174q106 -413 161.5 -629t63.5 -291h8q11 57 35.5 147.5t42.5 143.5l201 629h180l196 -629q56 -172 76 -289h8q4 36 21.5 111t208.5 807h172l-303 -1096h-197l-201 643q-19 59 -71 268h-8q-40 -175 -70 -270l-207 -641h-192z" />
+<glyph unicode="x" horiz-adv-x="1073" d="M39 0l401 561l-381 535h189l289 -420l288 420h187l-381 -535l401 -561h-188l-307 444l-310 -444h-188z" />
+<glyph unicode="y" horiz-adv-x="1032" d="M2 1096h178l240 -625q79 -214 98 -309h8q13 51 54.5 174.5t271.5 759.5h178l-471 -1248q-70 -185 -163.5 -262.5t-229.5 -77.5q-76 0 -150 17v133q55 -12 123 -12q171 0 244 192l61 156z" />
+<glyph unicode="z" horiz-adv-x="958" d="M82 0v113l598 854h-561v129h743v-129l-590 -838h605v-129h-795z" />
+<glyph unicode="{" horiz-adv-x="776" d="M61 498v141q130 2 188 48t58 142v306q0 155 108 241t290 86v-139q-230 -6 -230 -199v-295q0 -215 -223 -254v-12q223 -39 223 -254v-297q0 -102 58.5 -148t171.5 -48v-140q-190 2 -294 87t-104 239v303q0 104 -63 148.5t-183 44.5z" />
+<glyph unicode="|" horiz-adv-x="1128" d="M494 -496v2052h141v-2052h-141z" />
+<glyph unicode="}" horiz-adv-x="776" d="M72 -184q111 2 169 48t58 148v297q0 114 55 174t168 80v12q-223 39 -223 254v295q0 193 -227 199v139q184 0 289.5 -87t105.5 -240v-306q0 -97 59 -142.5t189 -47.5v-141q-122 0 -185 -44.5t-63 -148.5v-303q0 -153 -102.5 -238.5t-292.5 -87.5v140z" />
+<glyph unicode="~" d="M104 592v151q100 109 244 109q68 0 124.5 -14t145.5 -52q66 -28 115 -41.5t96 -13.5q54 0 118 32t118 89v-150q-102 -110 -244 -110q-72 0 -135 16.5t-135 48.5q-75 32 -120 44t-93 12q-53 0 -116.5 -33.5t-117.5 -87.5z" />
+<glyph unicode="&#xa2;" d="M190 741q0 508 396 570v172h135v-164q75 -3 146 -19.5t120 -39.5l-49 -140q-133 51 -242 51q-172 0 -253 -105.5t-81 -322.5q0 -212 79.5 -313.5t246.5 -101.5q141 0 283 59v-147q-105 -54 -252 -60v-200h-133v206q-203 32 -299.5 168.5t-96.5 386.5z" />
+<glyph unicode="&#xa3;" d="M63 0v141q205 47 205 291v223h-198v127h198v316q0 178 112 280.5t302 102.5t360 -84l-61 -133q-154 77 -297 77q-123 0 -185.5 -62t-62.5 -202v-295h422v-127h-422v-221q0 -100 -32.5 -168t-106.5 -112h795v-154h-1029z" />
+<glyph unicode="&#xa5;" d="M31 1462h178l375 -727l379 727h174l-416 -770h262v-127h-317v-170h317v-127h-317v-268h-164v268h-316v127h316v170h-316v127h256z" />
+<glyph unicode="&#xa9;" horiz-adv-x="1704" d="M100 731q0 200 100 375t275 276t377 101q200 0 375 -100t276 -275t101 -377q0 -197 -97 -370t-272 -277t-383 -104q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM205 731q0 -173 87 -323.5t237.5 -237t322.5 -86.5q174 0 323 87t236.5 235.5t87.5 324.5q0 174 -87 323 t-235.5 236.5t-324.5 87.5q-174 0 -323 -87t-236.5 -235.5t-87.5 -324.5zM481 731q0 209 110.5 332t301.5 123q128 0 246 -60l-58 -118q-108 51 -188 51q-125 0 -192.5 -87t-67.5 -241q0 -168 63.5 -249t194.5 -81q86 0 211 45v-124q-48 -20 -98.5 -34t-120.5 -14 q-194 0 -298 120.5t-104 336.5z" />
+<glyph unicode="&#xad;" horiz-adv-x="659" d="M84 473v152h491v-152h-491z" />
+<glyph unicode="&#xae;" horiz-adv-x="1704" d="M100 731q0 200 100 375t275 276t377 101q200 0 375 -100t276 -275t101 -377q0 -197 -97 -370t-272 -277t-383 -104q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM205 731q0 -173 87 -323.5t237.5 -237t322.5 -86.5q174 0 323 87t236.5 235.5t87.5 324.5q0 174 -87 323 t-235.5 236.5t-324.5 87.5q-174 0 -323 -87t-236.5 -235.5t-87.5 -324.5zM575 285v891h261q166 0 243.5 -65t77.5 -198q0 -80 -42.5 -141.5t-119.5 -91.5l238 -395h-168l-207 354h-135v-354h-148zM723 762h108q80 0 128.5 41.5t48.5 105.5q0 75 -43 107.5t-136 32.5h-106 v-287z" />
+<glyph unicode="&#xb4;" horiz-adv-x="1182" d="M393 1241v25q48 62 103.5 150t87.5 153h202v-21q-44 -65 -131 -160t-151 -147h-111z" />
+<glyph unicode="&#x2000;" horiz-adv-x="784" />
+<glyph unicode="&#x2001;" horiz-adv-x="1569" />
+<glyph unicode="&#x2002;" horiz-adv-x="784" />
+<glyph unicode="&#x2003;" horiz-adv-x="1569" />
+<glyph unicode="&#x2004;" horiz-adv-x="523" />
+<glyph unicode="&#x2005;" horiz-adv-x="392" />
+<glyph unicode="&#x2006;" horiz-adv-x="261" />
+<glyph unicode="&#x2007;" horiz-adv-x="261" />
+<glyph unicode="&#x2008;" horiz-adv-x="196" />
+<glyph unicode="&#x2009;" horiz-adv-x="313" />
+<glyph unicode="&#x200a;" horiz-adv-x="87" />
+<glyph unicode="&#x2010;" horiz-adv-x="659" d="M84 473v152h491v-152h-491z" />
+<glyph unicode="&#x2011;" horiz-adv-x="659" d="M84 473v152h491v-152h-491z" />
+<glyph unicode="&#x2012;" horiz-adv-x="659" d="M84 473v152h491v-152h-491z" />
+<glyph unicode="&#x2013;" horiz-adv-x="1024" d="M82 473v152h860v-152h-860z" />
+<glyph unicode="&#x2014;" horiz-adv-x="2048" d="M82 473v152h1884v-152h-1884z" />
+<glyph unicode="&#x2018;" horiz-adv-x="348" d="M25 983q22 90 71 224t105 255h123q-66 -254 -103 -501h-184z" />
+<glyph unicode="&#x2019;" horiz-adv-x="348" d="M25 961q70 285 102 501h182l15 -22q-26 -100 -75 -232.5t-102 -246.5h-122z" />
+<glyph unicode="&#x201c;" horiz-adv-x="717" d="M25 983q22 90 71 224t105 255h123q-66 -254 -103 -501h-184zM391 983q56 215 178 479h123q-30 -115 -59.5 -259.5t-42.5 -241.5h-184z" />
+<glyph unicode="&#x201d;" horiz-adv-x="717" d="M25 961q70 285 102 501h182l15 -22q-26 -100 -75 -232.5t-102 -246.5h-122zM391 961q26 100 59 254t46 247h182l14 -22q-24 -91 -72 -224t-104 -255h-125z" />
+<glyph unicode="&#x2022;" horiz-adv-x="770" d="M164 748q0 121 56.5 184t164.5 63q105 0 163 -62t58 -185q0 -119 -57.5 -183.5t-163.5 -64.5q-107 0 -164 65.5t-57 182.5z" />
+<glyph unicode="&#x2026;" horiz-adv-x="1606" d="M152 106q0 67 30.5 101.5t87.5 34.5q58 0 90.5 -34.5t32.5 -101.5q0 -65 -33 -100t-90 -35q-51 0 -84.5 31.5t-33.5 103.5zM682 106q0 67 30.5 101.5t87.5 34.5q58 0 90.5 -34.5t32.5 -101.5q0 -65 -33 -100t-90 -35q-51 0 -84.5 31.5t-33.5 103.5zM1213 106 q0 67 30.5 101.5t87.5 34.5q58 0 90.5 -34.5t32.5 -101.5q0 -65 -33 -100t-90 -35q-51 0 -84.5 31.5t-33.5 103.5z" />
+<glyph unicode="&#x202f;" horiz-adv-x="313" />
+<glyph unicode="&#x205f;" horiz-adv-x="392" />
+<glyph unicode="&#x20ac;" horiz-adv-x="1208" d="M63 506v129h152l-2 42v44l2 80h-152v129h164q39 261 185 407t383 146q201 0 366 -97l-71 -139q-166 86 -295 86q-319 0 -398 -403h510v-129h-524l-2 -57v-64l2 -45h463v-129h-447q37 -180 138.5 -278.5t271.5 -98.5q156 0 309 66v-150q-146 -65 -317 -65 q-237 0 -381.5 134.5t-190.5 391.5h-166z" />
+<glyph unicode="&#x2122;" horiz-adv-x="1589" d="M37 1356v106h543v-106h-211v-615h-123v615h-209zM647 741v721h187l196 -559l203 559h180v-721h-127v420l6 137h-8l-211 -557h-104l-201 559h-8l6 -129v-430h-119z" />
+<glyph unicode="&#xe000;" horiz-adv-x="1095" d="M0 1095h1095v-1095h-1095v1095z" />
+</font>
+</defs></svg> 
\ No newline at end of file
diff --git a/fonts/OpenSans-Regular-webfont.ttf b/fonts/OpenSans-Regular-webfont.ttf
new file mode 100644
index 0000000..05951e7
Binary files /dev/null and b/fonts/OpenSans-Regular-webfont.ttf differ
diff --git a/fonts/OpenSans-Regular-webfont.woff b/fonts/OpenSans-Regular-webfont.woff
new file mode 100644
index 0000000..274664b
Binary files /dev/null and b/fonts/OpenSans-Regular-webfont.woff differ
diff --git a/fonts/OpenSans-Semibold-webfont.eot b/fonts/OpenSans-Semibold-webfont.eot
new file mode 100644
index 0000000..289aade
Binary files /dev/null and b/fonts/OpenSans-Semibold-webfont.eot differ
diff --git a/fonts/OpenSans-Semibold-webfont.svg b/fonts/OpenSans-Semibold-webfont.svg
new file mode 100644
index 0000000..cc2ca42
--- /dev/null
+++ b/fonts/OpenSans-Semibold-webfont.svg
@@ -0,0 +1,146 @@
+<?xml version="1.0" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
+<svg xmlns="http://www.w3.org/2000/svg">
+<metadata>
+This is a custom SVG webfont generated by Font Squirrel.
+Copyright   : Digitized data copyright  2011 Google Corporation
+Foundry     : Ascender Corporation
+Foundry URL : httpwwwascendercorpcom
+</metadata>
+<defs>
+<font id="OpenSansSemibold" horiz-adv-x="1169" >
+<font-face units-per-em="2048" ascent="1638" descent="-410" />
+<missing-glyph horiz-adv-x="532" />
+<glyph unicode=" "  horiz-adv-x="532" />
+<glyph unicode="&#x09;" horiz-adv-x="532" />
+<glyph unicode="&#xa0;" horiz-adv-x="532" />
+<glyph unicode="!" horiz-adv-x="565" d="M133 125q0 74 39 112.5t111 38.5q71 0 109 -40t38 -111t-38.5 -112.5t-108.5 -41.5q-71 0 -110.5 40t-39.5 114zM145 1462h277l-51 -1018h-174z" />
+<glyph unicode="&#x22;" horiz-adv-x="893" d="M133 1462h232l-41 -528h-150zM528 1462h232l-41 -528h-150z" />
+<glyph unicode="#" horiz-adv-x="1323" d="M47 418v168h283l57 284h-264v168h293l80 422h180l-80 -422h252l80 422h174l-80 -422h252v-168h-285l-55 -284h270v-168h-303l-80 -418h-178l80 418h-248l-80 -418h-174l76 418h-250zM506 586h250l57 284h-250z" />
+<glyph unicode="$" d="M111 168v211q86 -42 201 -70.5t206 -29.5v374l-84 31q-164 63 -239.5 150.5t-75.5 216.5q0 138 107.5 227t291.5 108v168h133v-165q203 -7 385 -82l-73 -183q-157 62 -312 74v-364l76 -29q190 -73 263 -154t73 -198q0 -145 -106 -239t-306 -116v-217h-133v211 q-248 4 -407 76zM354 1053q0 -57 35.5 -95t128.5 -75v311q-80 -12 -122 -49t-42 -92zM651 287q176 27 176 151q0 58 -40.5 95.5t-135.5 72.5v-319z" />
+<glyph unicode="%" horiz-adv-x="1765" d="M84 1026q0 457 319 457q157 0 241.5 -118.5t84.5 -338.5q0 -230 -82.5 -345.5t-243.5 -115.5q-152 0 -235.5 119.5t-83.5 341.5zM279 1024q0 -149 29 -222t95 -73q132 0 132 295t-132 295q-66 0 -95 -73t-29 -222zM379 0l811 1462h194l-811 -1462h-194zM1036 440 q0 457 320 457q154 0 239.5 -118t85.5 -339q0 -230 -83 -345t-242 -115q-152 0 -236 118.5t-84 341.5zM1231 440q0 -149 29.5 -223t95.5 -74q131 0 131 297q0 293 -131 293q-66 0 -95.5 -72t-29.5 -221z" />
+<glyph unicode="&#x26;" horiz-adv-x="1516" d="M96 387q0 131 64 228.5t231 193.5q-95 111 -129.5 187.5t-34.5 158.5q0 152 108.5 240t291.5 88q177 0 278 -85.5t101 -230.5q0 -114 -67.5 -207t-225.5 -186l346 -334q81 107 135 314h242q-70 -284 -224 -463l301 -291h-303l-149 145q-102 -82 -217.5 -123.5 t-255.5 -41.5q-230 0 -361 109t-131 298zM344 403q0 -98 69.5 -159.5t186.5 -61.5q183 0 313 107l-383 377q-106 -68 -146 -127.5t-40 -135.5zM451 1147q0 -63 33.5 -119t93.5 -119q113 64 158.5 119.5t45.5 124.5q0 65 -43.5 104t-115.5 39q-79 0 -125.5 -40.5 t-46.5 -108.5z" />
+<glyph unicode="'" horiz-adv-x="498" d="M133 1462h232l-41 -528h-150z" />
+<glyph unicode="(" horiz-adv-x="649" d="M82 561q0 265 77.5 496t223.5 405h205q-139 -188 -213 -421.5t-74 -477.5t74 -473t211 -414h-203q-147 170 -224 397t-77 488z" />
+<glyph unicode=")" horiz-adv-x="649" d="M61 1462h205q147 -175 224 -406.5t77 -494.5t-77.5 -490t-223.5 -395h-203q138 187 211.5 415t73.5 472q0 245 -74 477.5t-213 421.5z" />
+<glyph unicode="*" horiz-adv-x="1122" d="M74 1065l35 217l376 -108l-41 382h228l-41 -382l385 108l28 -217l-360 -29l236 -311l-199 -107l-166 338l-149 -338l-205 107l231 311z" />
+<glyph unicode="+" d="M96 633v178h398v408h180v-408h399v-178h-399v-406h-180v406h-398z" />
+<glyph unicode="," horiz-adv-x="547" d="M63 -264q69 270 103 502h231l15 -23q-48 -186 -176 -479h-173z" />
+<glyph unicode="-" horiz-adv-x="659" d="M72 449v200h514v-200h-514z" />
+<glyph unicode="." horiz-adv-x="563" d="M133 125q0 73 38 112t110 39q73 0 111 -40.5t38 -110.5q0 -71 -38.5 -112.5t-110.5 -41.5t-110 41t-38 113z" />
+<glyph unicode="/" horiz-adv-x="799" d="M16 0l545 1462h221l-544 -1462h-222z" />
+<glyph unicode="0" d="M88 731q0 387 122.5 570.5t373.5 183.5q245 0 371 -192t126 -562q0 -381 -122.5 -566t-374.5 -185q-244 0 -370 191t-126 560zM326 731q0 -299 61.5 -427t196.5 -128t197.5 130t62.5 425q0 294 -62.5 425.5t-197.5 131.5t-196.5 -129t-61.5 -428z" />
+<glyph unicode="1" d="M154 1124l430 338h196v-1462h-235v944q0 169 8 268q-23 -24 -56.5 -53t-224.5 -184z" />
+<glyph unicode="2" d="M90 0v178l377 379q167 171 221.5 242.5t79.5 134.5t25 135q0 99 -59.5 156t-164.5 57q-84 0 -162.5 -31t-181.5 -112l-127 155q122 103 237 146t245 43q204 0 327 -106.5t123 -286.5q0 -99 -35.5 -188t-109 -183.5t-244.5 -255.5l-254 -246v-10h694v-207h-991z" />
+<glyph unicode="3" d="M86 59v209q93 -46 197 -71t200 -25q170 0 254 63t84 195q0 117 -93 172t-292 55h-127v191h129q350 0 350 242q0 94 -61 145t-180 51q-83 0 -160 -23.5t-182 -91.5l-115 164q201 148 467 148q221 0 345 -95t124 -262q0 -139 -81 -231.5t-228 -124.5v-8q176 -22 264 -109.5 t88 -232.5q0 -211 -149 -325.5t-424 -114.5q-243 0 -410 79z" />
+<glyph unicode="4" d="M39 319v181l668 966h229v-952h197v-195h-197v-319h-229v319h-668zM258 514h449v367q0 196 10 321h-8q-28 -66 -88 -160z" />
+<glyph unicode="5" d="M117 59v213q81 -46 186 -71t195 -25q159 0 242 71t83 208q0 262 -334 262q-47 0 -116 -9.5t-121 -21.5l-105 62l56 714h760v-209h-553l-33 -362q35 6 85.5 14t123.5 8q221 0 350 -117t129 -319q0 -234 -146.5 -365.5t-416.5 -131.5q-245 0 -385 79z" />
+<glyph unicode="6" d="M94 623q0 858 699 858q110 0 186 -17v-196q-76 22 -176 22q-235 0 -353 -126t-128 -404h12q47 81 132 125.5t200 44.5q199 0 310 -122t111 -331q0 -230 -128.5 -363.5t-350.5 -133.5q-157 0 -273 75.5t-178.5 220t-62.5 347.5zM332 508q0 -141 76.5 -237.5t195.5 -96.5 q121 0 186.5 78t65.5 223q0 126 -61.5 198t-184.5 72q-76 0 -140 -32.5t-101 -89t-37 -115.5z" />
+<glyph unicode="7" d="M74 1253v207h1011v-164l-575 -1296h-254l578 1253h-760z" />
+<glyph unicode="8" d="M88 371q0 122 68.5 219.5t224.5 173.5q-134 80 -191 169t-57 200q0 159 125 253.5t326 94.5q208 0 329 -95.5t121 -255.5q0 -225 -270 -358q172 -86 244.5 -181t72.5 -212q0 -181 -133 -290t-360 -109q-238 0 -369 102t-131 289zM313 379q0 -104 73 -161.5t198 -57.5 q129 0 200.5 59.5t71.5 161.5q0 81 -66 148t-200 124l-29 13q-132 -58 -190 -127.5t-58 -159.5zM360 1116q0 -52 22 -93t64 -74.5t142 -80.5q120 53 169.5 111.5t49.5 136.5q0 85 -61.5 134.5t-163.5 49.5q-100 0 -161 -49.5t-61 -134.5z" />
+<glyph unicode="9" d="M86 981q0 229 128.5 364.5t350.5 135.5q156 0 272 -76t179 -220.5t63 -346.5q0 -432 -174 -645t-524 -213q-133 0 -191 16v197q89 -25 179 -25q238 0 355 128t128 402h-12q-59 -90 -142.5 -130t-195.5 -40q-194 0 -305 121t-111 332zM317 983q0 -125 60.5 -196.5 t183.5 -71.5q119 0 200 71t81 166q0 89 -34.5 166.5t-96.5 122.5t-142 45q-122 0 -187 -79.5t-65 -223.5z" />
+<glyph unicode=":" horiz-adv-x="563" d="M133 125q0 73 38 112t110 39q73 0 111 -40.5t38 -110.5q0 -71 -38.5 -112.5t-110.5 -41.5t-110 41t-38 113zM133 979q0 151 148 151q75 0 112 -40t37 -111t-38.5 -112.5t-110.5 -41.5t-110 41t-38 113z" />
+<glyph unicode=";" horiz-adv-x="569" d="M63 -264q69 270 103 502h231l15 -23q-48 -186 -176 -479h-173zM131 979q0 151 148 151q75 0 112 -40t37 -111t-38.5 -112.5t-110.5 -41.5t-110 41t-38 113z" />
+<glyph unicode="&#x3c;" d="M96 651v121l977 488v-195l-733 -344l733 -303v-197z" />
+<glyph unicode="=" d="M102 432v178h963v-178h-963zM102 831v179h963v-179h-963z" />
+<glyph unicode="&#x3e;" d="M96 221v197l733 303l-733 344v195l977 -488v-121z" />
+<glyph unicode="?" horiz-adv-x="928" d="M16 1370q203 113 435 113q196 0 311 -96t115 -265q0 -75 -22 -133.5t-66.5 -111.5t-153.5 -138q-93 -73 -124.5 -121t-31.5 -129v-45h-196v64q0 110 40 183t140 151q119 94 153.5 146t34.5 124q0 84 -56 129t-161 45q-95 0 -176 -27t-158 -65zM242 125q0 151 147 151 q72 0 110 -39.5t38 -111.5q0 -71 -38.5 -112.5t-109.5 -41.5t-109 40.5t-38 113.5z" />
+<glyph unicode="@" horiz-adv-x="1839" d="M111 586q0 261 112 464.5t310.5 311.5t449.5 108q217 0 386.5 -90t263 -256.5t93.5 -384.5q0 -143 -45 -261.5t-126.5 -184.5t-188.5 -66q-79 0 -137 42t-78 114h-12q-49 -78 -121 -117t-162 -39q-163 0 -256.5 105t-93.5 284q0 206 124 334.5t333 128.5 q76 0 168.5 -13.5t164.5 -37.5l-22 -465v-24q0 -160 104 -160q79 0 125.5 102t46.5 260q0 171 -70 300.5t-199 199.5t-296 70q-213 0 -370.5 -88t-240.5 -251.5t-83 -379.5q0 -290 155 -446t445 -156q221 0 461 90v-164q-210 -86 -457 -86q-370 0 -577 199.5t-207 556.5z M698 612q0 -233 183 -233q193 0 211 293l12 239q-63 17 -135 17q-128 0 -199.5 -85t-71.5 -231z" />
+<glyph unicode="A" horiz-adv-x="1354" d="M0 0l547 1468h260l547 -1468h-254l-146 406h-559l-143 -406h-252zM465 612h426l-137 398q-15 40 -41.5 126t-36.5 126q-27 -123 -79 -269z" />
+<glyph unicode="B" horiz-adv-x="1352" d="M193 0v1462h434q302 0 436.5 -88t134.5 -278q0 -128 -66 -213t-190 -107v-10q154 -29 226.5 -114.5t72.5 -231.5q0 -197 -137.5 -308.5t-382.5 -111.5h-528zM432 201h254q150 0 226.5 57.5t76.5 181.5q0 114 -78 169t-237 55h-242v-463zM432 858h230q150 0 219 47.5 t69 161.5q0 103 -74.5 149t-236.5 46h-207v-404z" />
+<glyph unicode="C" horiz-adv-x="1298" d="M121 731q0 228 83.5 399t241.5 262t371 91q224 0 414 -94l-86 -199q-74 35 -156.5 61.5t-173.5 26.5q-206 0 -324 -146t-118 -403q0 -269 113.5 -407t328.5 -138q93 0 180 18.5t181 47.5v-205q-172 -65 -390 -65q-321 0 -493 194.5t-172 556.5z" />
+<glyph unicode="D" horiz-adv-x="1503" d="M193 0v1462h452q349 0 543 -188t194 -529q0 -362 -201 -553.5t-579 -191.5h-409zM432 201h170q528 0 528 536q0 525 -491 525h-207v-1061z" />
+<glyph unicode="E" horiz-adv-x="1143" d="M193 0v1462h827v-202h-588v-398h551v-200h-551v-459h588v-203h-827z" />
+<glyph unicode="F" horiz-adv-x="1090" d="M193 0v1462h825v-202h-588v-457h551v-203h-551v-600h-237z" />
+<glyph unicode="G" horiz-adv-x="1487" d="M121 731q0 353 203 552.5t559 199.5q229 0 434 -88l-84 -199q-178 82 -356 82q-234 0 -370 -147t-136 -402q0 -268 122.5 -407.5t352.5 -139.5q116 0 248 29v377h-303v205h538v-734q-132 -43 -253.5 -61t-262.5 -18q-332 0 -512 196.5t-180 554.5z" />
+<glyph unicode="H" horiz-adv-x="1538" d="M193 0v1462h239v-598h674v598h240v-1462h-240v659h-674v-659h-239z" />
+<glyph unicode="I" horiz-adv-x="625" d="M193 0v1462h239v-1462h-239z" />
+<glyph unicode="J" horiz-adv-x="612" d="M-156 -182q84 -21 146 -21q196 0 196 248v1417h240v-1409q0 -224 -106.5 -342.5t-311.5 -118.5q-98 0 -164 25v201z" />
+<glyph unicode="K" horiz-adv-x="1309" d="M193 0v1462h239v-698q98 120 195 231l395 467h272q-383 -450 -549 -641l564 -821h-277l-459 662l-141 -115v-547h-239z" />
+<glyph unicode="L" horiz-adv-x="1110" d="M193 0v1462h239v-1257h619v-205h-858z" />
+<glyph unicode="M" horiz-adv-x="1890" d="M193 0v1462h337l406 -1163h6l418 1163h338v-1462h-230v723q0 109 5.5 284t9.5 212h-8l-439 -1219h-211l-424 1221h-8q17 -272 17 -510v-711h-217z" />
+<glyph unicode="N" horiz-adv-x="1604" d="M193 0v1462h290l717 -1159h6q-2 23 -8 167.5t-6 225.5v766h219v-1462h-293l-719 1165h-8l5 -65q14 -186 14 -340v-760h-217z" />
+<glyph unicode="O" horiz-adv-x="1612" d="M121 735q0 362 178.5 556t509.5 194q326 0 504 -197t178 -555q0 -357 -178.5 -555t-505.5 -198q-331 0 -508.5 196.5t-177.5 558.5zM375 733q0 -270 109 -409.5t323 -139.5q213 0 321.5 138t108.5 411q0 269 -107.5 408t-320.5 139q-215 0 -324.5 -139t-109.5 -408z" />
+<glyph unicode="P" horiz-adv-x="1260" d="M193 0v1462h421q274 0 410.5 -112t136.5 -330q0 -229 -150 -351t-427 -122h-152v-547h-239zM432 748h127q184 0 270 64t86 200q0 126 -77 188t-240 62h-166v-514z" />
+<glyph unicode="Q" horiz-adv-x="1612" d="M121 735q0 362 178.5 556t509.5 194q326 0 504 -197t178 -555q0 -266 -101.5 -448t-295.5 -256l350 -377h-322l-276 328h-39q-331 0 -508.5 196.5t-177.5 558.5zM375 733q0 -270 109 -409.5t323 -139.5q213 0 321.5 138t108.5 411q0 269 -107.5 408t-320.5 139 q-215 0 -324.5 -139t-109.5 -408z" />
+<glyph unicode="R" horiz-adv-x="1309" d="M193 0v1462h413q283 0 419 -106t136 -320q0 -273 -284 -389l413 -647h-272l-350 584h-236v-584h-239zM432 782h166q167 0 242 62t75 184q0 124 -81 178t-244 54h-158v-478z" />
+<glyph unicode="S" horiz-adv-x="1126" d="M100 57v226q100 -47 212.5 -74t209.5 -27q142 0 209.5 54t67.5 145q0 82 -62 139t-256 135q-200 81 -282 185t-82 250q0 183 130 288t349 105q210 0 418 -92l-76 -195q-195 82 -348 82q-116 0 -176 -50.5t-60 -133.5q0 -57 24 -97.5t79 -76.5t198 -95q161 -67 236 -125 t110 -131t35 -172q0 -195 -141 -306t-389 -111t-406 77z" />
+<glyph unicode="T" horiz-adv-x="1159" d="M29 1257v205h1099v-205h-430v-1257h-239v1257h-430z" />
+<glyph unicode="U" horiz-adv-x="1520" d="M180 520v942h240v-925q0 -181 84 -267t258 -86q338 0 338 355v923h239v-946q0 -162 -69.5 -283.5t-201 -187t-314.5 -65.5q-272 0 -423 144t-151 396z" />
+<glyph unicode="V" horiz-adv-x="1274" d="M0 1462h246l305 -909q24 -65 51 -167.5t35 -152.5q13 76 40 176t44 148l305 905h248l-512 -1462h-252z" />
+<glyph unicode="W" horiz-adv-x="1937" d="M12 1462h244l209 -852q49 -205 70 -362q11 85 33 190t40 170l238 854h237l244 -858q35 -119 74 -356q15 143 72 364l208 850h242l-381 -1462h-260l-248 872q-16 57 -40 164.5t-29 149.5q-10 -64 -32.5 -166t-37.5 -152l-242 -868h-260l-189 732z" />
+<glyph unicode="X" horiz-adv-x="1274" d="M4 0l485 758l-454 704h266l338 -553l338 553h258l-457 -708l492 -754h-275l-366 598l-369 -598h-256z" />
+<glyph unicode="Y" horiz-adv-x="1212" d="M0 1462h260l346 -667l346 667h260l-487 -895v-567h-240v559z" />
+<glyph unicode="Z" horiz-adv-x="1178" d="M66 0v166l737 1091h-717v205h1006v-168l-740 -1089h760v-205h-1046z" />
+<glyph unicode="[" horiz-adv-x="676" d="M154 -324v1786h471v-176h-256v-1433h256v-177h-471z" />
+<glyph unicode="\" horiz-adv-x="799" d="M16 1462h222l544 -1462h-221z" />
+<glyph unicode="]" horiz-adv-x="676" d="M51 -147h256v1433h-256v176h469v-1786h-469v177z" />
+<glyph unicode="^" horiz-adv-x="1100" d="M29 535l436 935h121l485 -935h-194l-349 694l-307 -694h-192z" />
+<glyph unicode="_" horiz-adv-x="879" d="M-4 -184h887v-135h-887v135z" />
+<glyph unicode="`" horiz-adv-x="1212" d="M362 1548v21h273q38 -70 103.5 -161t109.5 -142v-25h-158q-69 52 -174.5 150.5t-153.5 156.5z" />
+<glyph unicode="a" horiz-adv-x="1188" d="M90 317q0 171 127 258t387 95l191 6v59q0 106 -49.5 158.5t-153.5 52.5q-85 0 -163 -25t-150 -59l-76 168q90 47 197 71.5t202 24.5q211 0 318.5 -92t107.5 -289v-745h-168l-47 154h-8q-80 -101 -161 -137.5t-208 -36.5q-163 0 -254.5 88t-91.5 249zM334 315 q0 -74 44 -114.5t132 -40.5q128 0 205.5 71.5t77.5 200.5v96l-142 -6q-166 -6 -241.5 -55.5t-75.5 -151.5z" />
+<glyph unicode="b" horiz-adv-x="1276" d="M168 0v1556h235v-370q0 -41 -4 -122t-6 -103h10q112 165 330 165q207 0 322.5 -150t115.5 -421q0 -272 -117 -423.5t-325 -151.5q-210 0 -326 151h-16l-43 -131h-176zM403 555q0 -202 64 -292.5t209 -90.5q125 0 189.5 99t64.5 286q0 377 -258 377q-142 0 -204.5 -83.5 t-64.5 -279.5v-16z" />
+<glyph unicode="c" horiz-adv-x="1014" d="M102 547q0 279 136.5 429t394.5 150q175 0 315 -65l-71 -189q-149 58 -246 58q-287 0 -287 -381q0 -186 71.5 -279.5t209.5 -93.5q157 0 297 78v-205q-63 -37 -134.5 -53t-173.5 -16q-251 0 -381.5 146.5t-130.5 420.5z" />
+<glyph unicode="d" horiz-adv-x="1276" d="M102 551q0 272 117.5 423.5t325.5 151.5q218 0 332 -161h12q-17 119 -17 188v403h236v-1556h-184l-41 145h-11q-113 -165 -331 -165q-207 0 -323 150t-116 421zM344 547q0 -184 65 -280.5t195 -96.5q145 0 211 81.5t68 264.5v33q0 209 -68 297t-213 88 q-124 0 -191 -100.5t-67 -286.5z" />
+<glyph unicode="e" horiz-adv-x="1180" d="M102 545q0 271 135 426t371 155q219 0 346 -133t127 -366v-127h-737q5 -161 87 -247.5t231 -86.5q98 0 182.5 18.5t181.5 61.5v-191q-86 -41 -174 -58t-201 -17q-258 0 -403.5 150.5t-145.5 414.5zM348 670h502q-2 137 -66 207.5t-176 70.5t-179.5 -71t-80.5 -207z" />
+<glyph unicode="f" horiz-adv-x="743" d="M35 928v110l182 72v72q0 196 92 290.5t281 94.5q124 0 244 -41l-62 -178q-87 28 -166 28q-80 0 -116.5 -49.5t-36.5 -148.5v-72h270v-178h-270v-928h-236v928h-182z" />
+<glyph unicode="g" horiz-adv-x="1139" d="M23 -184q0 102 64.5 171.5t180.5 96.5q-47 20 -77.5 64.5t-30.5 93.5q0 62 35 105t104 85q-86 37 -139.5 120.5t-53.5 195.5q0 180 113.5 279t323.5 99q47 0 98.5 -6.5t77.5 -13.5h383v-129l-189 -35q26 -35 43 -86t17 -108q0 -171 -118 -269t-325 -98q-53 0 -96 8 q-76 -47 -76 -110q0 -38 35.5 -57t130.5 -19h193q183 0 278 -78t95 -225q0 -188 -155 -290t-448 -102q-226 0 -345 80t-119 228zM233 -172q0 -76 68.5 -117t192.5 -41q192 0 286 55t94 146q0 72 -51.5 102.5t-191.5 30.5h-178q-101 0 -160.5 -47.5t-59.5 -128.5zM334 748 q0 -104 53.5 -160t153.5 -56q204 0 204 218q0 108 -50.5 166.5t-153.5 58.5q-102 0 -154.5 -58t-52.5 -169z" />
+<glyph unicode="h" horiz-adv-x="1300" d="M168 0v1556h235v-395q0 -95 -12 -203h15q48 80 133.5 124t199.5 44q402 0 402 -405v-721h-236v680q0 128 -51.5 191t-163.5 63q-148 0 -217.5 -88.5t-69.5 -296.5v-549h-235z" />
+<glyph unicode="i" horiz-adv-x="571" d="M154 1399q0 63 34.5 97t98.5 34q62 0 96.5 -34t34.5 -97q0 -60 -34.5 -94.5t-96.5 -34.5q-64 0 -98.5 34.5t-34.5 94.5zM168 0v1106h235v-1106h-235z" />
+<glyph unicode="j" horiz-adv-x="571" d="M-121 -281q68 -18 139 -18q150 0 150 170v1235h235v-1251q0 -171 -89.5 -259t-258.5 -88q-106 0 -176 25v186zM154 1399q0 63 34.5 97t98.5 34q62 0 96.5 -34t34.5 -97q0 -60 -34.5 -94.5t-96.5 -34.5q-64 0 -98.5 34.5t-34.5 94.5z" />
+<glyph unicode="k" horiz-adv-x="1171" d="M168 0v1556h233v-759l-12 -213h6l133 166l334 356h271l-445 -475l473 -631h-276l-355 485l-129 -106v-379h-233z" />
+<glyph unicode="l" horiz-adv-x="571" d="M168 0v1556h235v-1556h-235z" />
+<glyph unicode="m" horiz-adv-x="1958" d="M168 0v1106h184l33 -145h12q46 79 133.5 122t192.5 43q255 0 338 -174h16q49 82 138 128t204 46q198 0 288.5 -100t90.5 -305v-721h-235v682q0 127 -48.5 189.5t-150.5 62.5q-137 0 -200.5 -85.5t-63.5 -262.5v-586h-236v682q0 127 -48 189.5t-150 62.5 q-136 0 -199.5 -88.5t-63.5 -294.5v-551h-235z" />
+<glyph unicode="n" horiz-adv-x="1300" d="M168 0v1106h184l33 -145h12q50 79 142 122t204 43q398 0 398 -405v-721h-236v680q0 128 -51.5 191t-163.5 63q-149 0 -218 -88t-69 -295v-551h-235z" />
+<glyph unicode="o" horiz-adv-x="1251" d="M102 555q0 269 138 420t389 151q240 0 380 -154.5t140 -416.5q0 -271 -139 -423t-387 -152q-155 0 -274 70t-183 201t-64 304zM344 555q0 -383 283 -383q280 0 280 383q0 379 -282 379q-148 0 -214.5 -98t-66.5 -281z" />
+<glyph unicode="p" horiz-adv-x="1276" d="M168 -492v1598h190q8 -31 33 -148h12q110 168 330 168q207 0 322.5 -150t115.5 -421t-117.5 -423t-324.5 -152q-210 0 -326 151h-14q14 -140 14 -170v-453h-235zM403 555q0 -202 64 -292.5t209 -90.5q122 0 188 100t66 285q0 186 -65.5 281.5t-192.5 95.5 q-140 0 -204.5 -82t-64.5 -262v-35z" />
+<glyph unicode="q" horiz-adv-x="1276" d="M102 551q0 270 118 422.5t325 152.5q104 0 186.5 -38.5t147.5 -126.5h8l26 145h195v-1598h-236v469q0 44 4 93t7 75h-13q-104 -165 -331 -165q-205 0 -321 150.5t-116 420.5zM344 547q0 -379 262 -379q148 0 212.5 85.5t64.5 258.5v37q0 205 -66.5 295t-214.5 90 q-126 0 -192 -100t-66 -287z" />
+<glyph unicode="r" horiz-adv-x="883" d="M168 0v1106h184l31 -195h12q55 99 143.5 157t190.5 58q71 0 117 -10l-23 -219q-50 12 -104 12q-141 0 -228.5 -92t-87.5 -239v-578h-235z" />
+<glyph unicode="s" horiz-adv-x="997" d="M98 827q0 142 114.5 220.5t311.5 78.5q195 0 369 -79l-76 -177q-179 74 -301 74q-186 0 -186 -106q0 -52 48.5 -88t211.5 -99q137 -53 199 -97t92 -101.5t30 -137.5q0 -162 -118 -248.5t-338 -86.5q-221 0 -355 67v203q195 -90 363 -90q217 0 217 131q0 42 -24 70t-79 58 t-153 68q-191 74 -258.5 148t-67.5 192z" />
+<glyph unicode="t" horiz-adv-x="805" d="M39 928v104l162 86l80 234h145v-246h315v-178h-315v-592q0 -85 42.5 -125.5t111.5 -40.5q86 0 172 27v-177q-39 -17 -100.5 -28.5t-127.5 -11.5q-334 0 -334 352v596h-151z" />
+<glyph unicode="u" horiz-adv-x="1300" d="M158 383v723h237v-682q0 -127 52 -190.5t163 -63.5q148 0 217.5 88.5t69.5 296.5v551h236v-1106h-185l-33 145h-12q-49 -77 -139.5 -121t-206.5 -44q-201 0 -300 100t-99 303z" />
+<glyph unicode="v" horiz-adv-x="1096" d="M0 1106h248l225 -643q58 -162 70 -262h8q9 72 70 262l225 643h250l-422 -1106h-254z" />
+<glyph unicode="w" horiz-adv-x="1673" d="M20 1106h240l141 -545q48 -202 68 -346h6q10 73 30.5 167.5t35.5 141.5l168 582h258l163 -582q15 -49 37.5 -150t26.5 -157h8q15 123 70 344l143 545h236l-312 -1106h-264l-143 516q-26 82 -94 381h-9q-58 -270 -92 -383l-147 -514h-260z" />
+<glyph unicode="x" horiz-adv-x="1128" d="M25 0l389 565l-371 541h268l252 -387l254 387h266l-372 -541l391 -565h-266l-273 414l-272 -414h-266z" />
+<glyph unicode="y" horiz-adv-x="1098" d="M0 1106h256l225 -627q51 -134 68 -252h8q9 55 33 133.5t254 745.5h254l-473 -1253q-129 -345 -430 -345q-78 0 -152 17v186q53 -12 121 -12q170 0 239 197l41 104z" />
+<glyph unicode="z" horiz-adv-x="979" d="M68 0v145l559 781h-525v180h789v-164l-547 -762h563v-180h-839z" />
+<glyph unicode="{" horiz-adv-x="791" d="M45 473v191q135 0 200.5 45.5t65.5 138.5v311q0 156 108.5 229.5t325.5 73.5v-182q-114 -5 -165.5 -46.5t-51.5 -123.5v-297q0 -199 -229 -238v-12q229 -36 229 -237v-299q0 -82 51 -124t166 -44v-183q-231 2 -332.5 78.5t-101.5 247.5v285q0 186 -266 186z" />
+<glyph unicode="|" horiz-adv-x="1128" d="M473 -481v2033h180v-2033h-180z" />
+<glyph unicode="}" horiz-adv-x="760" d="M45 -141q95 1 148 38.5t53 129.5v262q0 121 53 187t176 87v12q-229 39 -229 238v297q0 82 -45.5 123.5t-155.5 46.5v182q223 0 320.5 -76.5t97.5 -250.5v-287q0 -100 63.5 -142t188.5 -42v-191q-123 0 -187.5 -42.5t-64.5 -143.5v-307q0 -156 -99.5 -229t-318.5 -75v183z " />
+<glyph unicode="~" d="M96 571v191q99 108 250 108q66 0 125 -13t147 -50q131 -55 220 -55q52 0 114.5 31t120.5 89v-190q-105 -111 -250 -111q-65 0 -127.5 15.5t-146.5 50.5q-127 55 -219 55q-50 0 -111.5 -30t-122.5 -91z" />
+<glyph unicode="&#xa2;" d="M166 741q0 254 100.5 397t306.5 175v170h158v-162q152 -5 283 -66l-70 -188q-146 59 -250 59q-146 0 -216 -95t-70 -288q0 -194 72 -283t210 -89q75 0 142.5 15t154.5 52v-200q-119 -59 -258 -64v-194h-156v200q-207 31 -307 171t-100 390z" />
+<glyph unicode="&#xa3;" d="M72 0v195q98 30 145 96t47 178v184h-188v172h188v256q0 188 113.5 294t312.5 106q194 0 375 -82l-76 -182q-162 71 -284 71q-205 0 -205 -219v-244h397v-172h-397v-182q0 -91 -33 -155t-113 -109h756v-207h-1038z" />
+<glyph unicode="&#xa5;" d="M18 1462h246l320 -665l321 665h244l-399 -760h227v-151h-281v-154h281v-153h-281v-244h-225v244h-283v153h283v154h-283v151h224z" />
+<glyph unicode="&#xa9;" horiz-adv-x="1704" d="M100 731q0 200 100 375t275 276t377 101q200 0 375 -100t276 -275t101 -377q0 -197 -97 -370t-272 -277t-383 -104q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM223 731q0 -170 84.5 -315.5t230.5 -229.5t314 -84q170 0 316 85.5t229.5 230t83.5 313.5q0 168 -84.5 314.5 t-231 230.5t-313.5 84q-168 0 -312.5 -83t-230.5 -229t-86 -317zM471 731q0 214 110 337.5t306 123.5q138 0 274 -70l-65 -143q-106 55 -203 55q-111 0 -171 -80.5t-60 -222.5q0 -147 54 -226t177 -79q55 0 118 15t109 36v-158q-115 -51 -235 -51q-197 0 -305.5 120.5 t-108.5 342.5z" />
+<glyph unicode="&#xad;" horiz-adv-x="659" d="M72 449v200h514v-200h-514z" />
+<glyph unicode="&#xae;" horiz-adv-x="1704" d="M100 731q0 200 100 375t275 276t377 101q200 0 375 -100t276 -275t101 -377q0 -197 -97 -370t-272 -277t-383 -104q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM223 731q0 -170 84.5 -315.5t230.5 -229.5t314 -84q170 0 316 85.5t229.5 230t83.5 313.5q0 168 -84.5 314.5 t-231 230.5t-313.5 84q-168 0 -312.5 -83t-230.5 -229t-86 -317zM559 279v903h262q174 0 255 -68t81 -205q0 -171 -153 -233l237 -397h-211l-192 346h-90v-346h-189zM748 770h69q74 0 112 35t38 100q0 72 -36.5 100.5t-115.5 28.5h-67v-264z" />
+<glyph unicode="&#xb4;" horiz-adv-x="1212" d="M362 1241v25q57 70 117.5 156t95.5 147h273v-21q-52 -61 -155.5 -157.5t-174.5 -149.5h-156z" />
+<glyph unicode="&#x2000;" horiz-adv-x="784" />
+<glyph unicode="&#x2001;" horiz-adv-x="1569" />
+<glyph unicode="&#x2002;" horiz-adv-x="784" />
+<glyph unicode="&#x2003;" horiz-adv-x="1569" />
+<glyph unicode="&#x2004;" horiz-adv-x="523" />
+<glyph unicode="&#x2005;" horiz-adv-x="392" />
+<glyph unicode="&#x2006;" horiz-adv-x="261" />
+<glyph unicode="&#x2007;" horiz-adv-x="261" />
+<glyph unicode="&#x2008;" horiz-adv-x="196" />
+<glyph unicode="&#x2009;" horiz-adv-x="313" />
+<glyph unicode="&#x200a;" horiz-adv-x="87" />
+<glyph unicode="&#x2010;" horiz-adv-x="659" d="M72 449v200h514v-200h-514z" />
+<glyph unicode="&#x2011;" horiz-adv-x="659" d="M72 449v200h514v-200h-514z" />
+<glyph unicode="&#x2012;" horiz-adv-x="659" d="M72 449v200h514v-200h-514z" />
+<glyph unicode="&#x2013;" horiz-adv-x="1024" d="M82 455v190h860v-190h-860z" />
+<glyph unicode="&#x2014;" horiz-adv-x="2048" d="M82 455v190h1884v-190h-1884z" />
+<glyph unicode="&#x2018;" horiz-adv-x="395" d="M25 983q20 83 71 224t105 255h170q-64 -256 -101 -501h-233z" />
+<glyph unicode="&#x2019;" horiz-adv-x="395" d="M25 961q69 289 100 501h231l15 -22q-53 -209 -176 -479h-170z" />
+<glyph unicode="&#x201c;" horiz-adv-x="813" d="M25 983q20 83 71 224t105 255h170q-64 -256 -101 -501h-233zM440 983q53 203 178 479h170q-69 -296 -100 -501h-233z" />
+<glyph unicode="&#x201d;" horiz-adv-x="813" d="M25 961q69 289 100 501h231l15 -22q-53 -209 -176 -479h-170zM440 961q69 271 103 501h231l14 -22q-53 -209 -176 -479h-172z" />
+<glyph unicode="&#x2022;" horiz-adv-x="770" d="M131 748q0 138 66 210t188 72q121 0 187.5 -72.5t66.5 -209.5q0 -135 -67 -209t-187 -74t-187 72.5t-67 210.5z" />
+<glyph unicode="&#x2026;" horiz-adv-x="1677" d="M133 125q0 73 38 112t110 39q73 0 111 -40.5t38 -110.5q0 -71 -38.5 -112.5t-110.5 -41.5t-110 41t-38 113zM690 125q0 73 38 112t110 39q73 0 111 -40.5t38 -110.5q0 -71 -38.5 -112.5t-110.5 -41.5t-110 41t-38 113zM1247 125q0 73 38 112t110 39q73 0 111 -40.5 t38 -110.5q0 -71 -38.5 -112.5t-110.5 -41.5t-110 41t-38 113z" />
+<glyph unicode="&#x202f;" horiz-adv-x="313" />
+<glyph unicode="&#x205f;" horiz-adv-x="392" />
+<glyph unicode="&#x20ac;" horiz-adv-x="1188" d="M63 494v153h136l-2 37v37l2 65h-136v154h150q38 251 191 394t395 143q200 0 358 -88l-84 -187q-154 76 -274 76q-141 0 -230.5 -84t-119.5 -254h456v-154h-471l-2 -45v-55l2 -39h408v-153h-391q64 -312 364 -312q143 0 293 62v-203q-131 -61 -305 -61q-241 0 -391.5 132 t-196.5 382h-152z" />
+<glyph unicode="&#x2122;" horiz-adv-x="1561" d="M27 1333v129h553v-129h-205v-592h-146v592h-202zM635 741v721h217l178 -534l187 534h210v-721h-147v414l4 129h-6l-193 -543h-122l-185 543h-6l4 -119v-424h-141z" />
+<glyph unicode="&#xe000;" horiz-adv-x="1105" d="M0 1105h1105v-1105h-1105v1105z" />
+</font>
+</defs></svg> 
\ No newline at end of file
diff --git a/fonts/OpenSans-Semibold-webfont.ttf b/fonts/OpenSans-Semibold-webfont.ttf
new file mode 100644
index 0000000..6f15073
Binary files /dev/null and b/fonts/OpenSans-Semibold-webfont.ttf differ
diff --git a/fonts/OpenSans-Semibold-webfont.woff b/fonts/OpenSans-Semibold-webfont.woff
new file mode 100644
index 0000000..4e47cb1
Binary files /dev/null and b/fonts/OpenSans-Semibold-webfont.woff differ
diff --git a/fonts/OpenSans-SemiboldItalic-webfont.eot b/fonts/OpenSans-SemiboldItalic-webfont.eot
new file mode 100644
index 0000000..50a8a6f
Binary files /dev/null and b/fonts/OpenSans-SemiboldItalic-webfont.eot differ
diff --git a/fonts/OpenSans-SemiboldItalic-webfont.svg b/fonts/OpenSans-SemiboldItalic-webfont.svg
new file mode 100644
index 0000000..65b50e2
--- /dev/null
+++ b/fonts/OpenSans-SemiboldItalic-webfont.svg
@@ -0,0 +1,146 @@
+<?xml version="1.0" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
+<svg xmlns="http://www.w3.org/2000/svg">
+<metadata>
+This is a custom SVG webfont generated by Font Squirrel.
+Copyright   : Digitized data copyright  20102011 Google Corporation
+Foundry     : Ascender Corporation
+Foundry URL : httpwwwascendercorpcom
+</metadata>
+<defs>
+<font id="OpenSansSemiboldItalic" horiz-adv-x="1128" >
+<font-face units-per-em="2048" ascent="1638" descent="-410" />
+<missing-glyph horiz-adv-x="532" />
+<glyph unicode=" "  horiz-adv-x="532" />
+<glyph unicode="&#x09;" horiz-adv-x="532" />
+<glyph unicode="&#xa0;" horiz-adv-x="532" />
+<glyph unicode="!" horiz-adv-x="557" d="M33 96q0 80 45.5 130t130.5 50q57 0 91 -32.5t34 -93.5q0 -79 -47 -128t-123 -49q-62 0 -96.5 33.5t-34.5 89.5zM160 444l168 1018h272l-264 -1018h-176z" />
+<glyph unicode="&#x22;" horiz-adv-x="858" d="M213 934l72 528h231l-151 -528h-152zM588 934l74 528h231l-152 -528h-153z" />
+<glyph unicode="#" horiz-adv-x="1323" d="M51 418l17 168h280l84 286h-264l16 168h295l121 422h178l-121 -422h252l121 422h174l-121 -422h252l-14 -168h-285l-84 -286h271l-15 -168h-303l-121 -418h-180l123 418h-248l-121 -418h-174l117 418h-250zM526 586h250l82 286h-250z" />
+<glyph unicode="$" d="M61 172v209q78 -42 179.5 -70t193.5 -30l84 387q-156 56 -223.5 138.5t-67.5 199.5q0 167 118.5 267.5t324.5 117.5l37 163h135l-35 -165q161 -16 289 -82l-86 -185q-134 66 -244 74l-80 -371q128 -51 186.5 -95t86.5 -101t28 -135q0 -172 -119.5 -277t-337.5 -125 l-45 -211h-135l45 211q-197 13 -334 80zM451 1016q0 -98 110 -139l68 319q-89 -11 -133.5 -57.5t-44.5 -122.5zM571 285q86 11 136.5 60t50.5 126q0 101 -115 145z" />
+<glyph unicode="%" horiz-adv-x="1688" d="M141 872q0 166 53 313.5t142.5 222.5t208.5 75q127 0 193.5 -76t66.5 -221q0 -160 -55.5 -313.5t-146.5 -230.5t-206 -77q-124 0 -190 79t-66 228zM231 0l1086 1462h194l-1085 -1462h-195zM334 866q0 -135 80 -135q52 0 95.5 58t73 175.5t29.5 219.5q0 131 -82 131 q-55 0 -99 -61t-70.5 -173t-26.5 -215zM940 279q0 171 53 320t142.5 223.5t207.5 74.5q127 0 195 -75t68 -218q0 -161 -55.5 -315.5t-146.5 -231.5t-204 -77q-127 0 -193.5 76.5t-66.5 222.5zM1133 281q0 -134 81 -134q52 0 96 58.5t73.5 174.5t29.5 220q0 131 -84 131 q-52 0 -95.5 -57.5t-72 -171t-28.5 -221.5z" />
+<glyph unicode="&#x26;" horiz-adv-x="1411" d="M66 350q0 147 85.5 254t286.5 205q-88 151 -88 283q0 180 112.5 286.5t297.5 106.5q160 0 252 -81t92 -218q0 -129 -89.5 -230t-293.5 -192l235 -326q109 112 181 295h233q-113 -270 -297 -454l205 -279h-277l-94 131q-106 -80 -211 -115.5t-229 -35.5 q-190 0 -295.5 97.5t-105.5 272.5zM305 371q0 -86 56 -140.5t147 -54.5q77 0 147 27t144 82l-264 381q-133 -74 -181.5 -141.5t-48.5 -153.5zM567 1102q0 -109 62 -201q147 75 199.5 133.5t52.5 126.5q0 66 -36 101.5t-97 35.5q-87 0 -134 -54t-47 -142z" />
+<glyph unicode="'" horiz-adv-x="483" d="M213 934l72 528h231l-151 -528h-152z" />
+<glyph unicode="(" horiz-adv-x="639" d="M78 276q0 343 124.5 632.5t379.5 553.5h209q-498 -548 -498 -1190q0 -329 115 -596h-183q-147 261 -147 600z" />
+<glyph unicode=")" horiz-adv-x="639" d="M-154 -324q498 548 498 1190q0 327 -115 596h183q147 -265 147 -602q0 -342 -123 -629.5t-381 -554.5h-209z" />
+<glyph unicode="*" horiz-adv-x="1122" d="M193 1167l71 195l354 -178l37 383l213 -43l-116 -367l403 23l-12 -205l-367 45l170 -361l-205 -61l-102 371l-227 -312l-162 144l293 266z" />
+<glyph unicode="+" d="M117 631v180h379v381h180v-381h377v-180h-377v-375h-180v375h-379z" />
+<glyph unicode="," horiz-adv-x="530" d="M-102 -264q105 238 200 502h236l8 -23q-125 -260 -266 -479h-178z" />
+<glyph unicode="-" horiz-adv-x="649" d="M47 446l45 203h502l-45 -203h-502z" />
+<glyph unicode="." horiz-adv-x="551" d="M33 94q0 83 47 132.5t131 49.5q56 0 89.5 -31.5t33.5 -92.5q0 -78 -47.5 -129.5t-124.5 -51.5q-66 0 -97.5 35.5t-31.5 87.5z" />
+<glyph unicode="/" horiz-adv-x="788" d="M-92 0l811 1462h233l-811 -1462h-233z" />
+<glyph unicode="0" d="M92 471q0 284 83 526t222.5 365t321.5 123q187 0 284 -118.5t97 -354.5q0 -306 -79 -546.5t-219 -363t-325 -122.5q-194 0 -289.5 127.5t-95.5 363.5zM330 469q0 -143 39 -218t129 -75q100 0 182.5 113.5t132 316.5t49.5 414q0 268 -162 268q-97 0 -180 -112 t-136.5 -312.5t-53.5 -394.5z" />
+<glyph unicode="1" d="M242 1145l508 317h198l-311 -1462h-238l189 870q28 150 82 324q-57 -55 -135 -102l-187 -117z" />
+<glyph unicode="2" d="M-18 0l36 180l471 422q176 159 238.5 231t90.5 133.5t28 131.5q0 85 -49.5 134.5t-139.5 49.5q-70 0 -139 -30t-170 -109l-115 160q120 97 231 138.5t228 41.5q181 0 288 -93t107 -251q0 -108 -39 -201t-123 -190.5t-284 -268.5l-311 -264v-8h622l-41 -207h-929z" />
+<glyph unicode="3" d="M31 59v215q84 -49 185.5 -75.5t195.5 -26.5q157 0 245 71.5t88 196.5q0 219 -278 219h-133l37 183h106q164 0 267.5 74.5t103.5 199.5q0 79 -49.5 124.5t-139.5 45.5q-72 0 -146.5 -25.5t-162.5 -84.5l-104 161q120 81 225.5 113.5t226.5 32.5q183 0 286 -88.5 t103 -241.5q0 -158 -99 -264t-269 -137v-7q127 -24 196.5 -106t69.5 -205q0 -133 -68 -236.5t-196.5 -160.5t-304.5 -57q-225 0 -385 79z" />
+<glyph unicode="4" d="M-4 317l37 197l803 952h254l-201 -952h201l-43 -197h-201l-68 -317h-229l69 317h-622zM262 514h397l68 309q31 136 100 377h-8q-51 -86 -135 -186z" />
+<glyph unicode="5" d="M53 59v217q167 -100 342 -100q173 0 270 83t97 230q0 105 -62 168.5t-188 63.5q-95 0 -225 -35l-88 68l200 708h713l-45 -209h-506l-106 -364q93 18 155 18q181 0 288.5 -103.5t107.5 -285.5q0 -161 -70 -283t-204 -188.5t-324 -66.5q-214 0 -355 79z" />
+<glyph unicode="6" d="M111 446q0 205 60.5 406t165 343t251 215t342.5 73q117 0 203 -25l-43 -194q-72 22 -181 22q-205 0 -337 -129.5t-197 -392.5h6q125 170 326 170q156 0 243.5 -99t87.5 -272q0 -162 -68.5 -301t-185.5 -210.5t-270 -71.5q-194 0 -298.5 120t-104.5 346zM340 418 q0 -110 49.5 -177t140.5 -67q81 0 143 48.5t96 134.5t34 188q0 200 -178 200q-51 0 -95.5 -19t-79 -48t-58.5 -64.5t-39 -82t-13 -113.5z" />
+<glyph unicode="7" d="M125 0l754 1257h-674l43 205h932l-33 -168l-758 -1294h-264z" />
+<glyph unicode="8" d="M76 348q0 297 368 432q-91 70 -130.5 145t-39.5 162q0 179 127 288.5t330 109.5q179 0 283 -89t104 -239q0 -132 -79 -229.5t-248 -163.5q120 -78 172.5 -165.5t52.5 -201.5q0 -121 -61.5 -216.5t-175.5 -148t-271 -52.5q-203 0 -317.5 100t-114.5 268zM311 369 q0 -93 59 -149t158 -56q115 0 184.5 64t69.5 167q0 91 -48.5 157.5t-139.5 119.5q-149 -54 -216 -126.5t-67 -176.5zM504 1096q0 -83 39 -137t104 -93q115 43 177.5 105t62.5 157q0 81 -48 126.5t-128 45.5q-93 0 -150 -56t-57 -148z" />
+<glyph unicode="9" d="M92 12v207q121 -43 236 -43q188 0 306 123t177 389h-6q-113 -160 -305 -160q-165 0 -255.5 102t-90.5 288q0 156 67 289t186.5 204.5t274.5 71.5q192 0 294.5 -119.5t102.5 -345.5q0 -205 -58 -414.5t-152.5 -349t-226 -207t-310.5 -67.5q-133 0 -240 32zM387 932 q0 -105 46 -160t134 -55q117 0 198 94t81 240q0 108 -48 172.5t-134 64.5q-82 0 -145.5 -47t-97.5 -130t-34 -179z" />
+<glyph unicode=":" horiz-adv-x="551" d="M33 94q0 83 47 132.5t131 49.5q56 0 89.5 -31.5t33.5 -92.5q0 -78 -47.5 -129.5t-124.5 -51.5q-66 0 -97.5 35.5t-31.5 87.5zM205 948q0 83 47 132.5t131 49.5q56 0 89.5 -31.5t33.5 -92.5q0 -79 -48.5 -130t-125.5 -51q-66 0 -96.5 35.5t-30.5 87.5z" />
+<glyph unicode=";" horiz-adv-x="551" d="M-100 -264q95 214 198 502h236l8 -23q-125 -260 -266 -479h-176zM205 948q0 83 47 132.5t131 49.5q56 0 89.5 -31.5t33.5 -92.5q0 -79 -48.5 -130t-125.5 -51q-66 0 -96.5 35.5t-30.5 87.5z" />
+<glyph unicode="&#x3c;" d="M115 651v121l936 488v-195l-697 -344l697 -303v-197z" />
+<glyph unicode="=" d="M117 430v180h936v-180h-936zM117 831v179h936v-179h-936z" />
+<glyph unicode="&#x3e;" d="M115 221v197l694 303l-694 344v195l936 -488v-121z" />
+<glyph unicode="?" horiz-adv-x="907" d="M162 94q0 83 47 132.5t131 49.5q56 0 89.5 -31.5t33.5 -92.5q0 -79 -49 -129t-125 -50q-66 0 -96.5 34.5t-30.5 86.5zM186 1370q207 113 410 113q171 0 269 -85.5t98 -242.5q0 -120 -63.5 -217.5t-231.5 -216.5q-104 -74 -150 -133t-61 -144h-197q18 133 71.5 220.5 t176.5 177.5q107 77 146.5 117t58 80.5t18.5 88.5q0 70 -42.5 114t-123.5 44q-77 0 -150 -27.5t-151 -64.5z" />
+<glyph unicode="@" horiz-adv-x="1743" d="M100 502q0 270 122.5 489t343 344t493.5 125q200 0 346 -74.5t223.5 -214.5t77.5 -325q0 -176 -59.5 -322.5t-166.5 -229.5t-239 -83q-98 0 -150.5 46t-64.5 120h-6q-101 -166 -277 -166q-123 0 -189.5 78.5t-66.5 218.5q0 151 67.5 279.5t188 203t263.5 74.5 q52 0 94.5 -5t79.5 -13t129 -39l-101 -392q-30 -114 -30 -159q0 -92 79 -92q72 0 134 66.5t97.5 174.5t35.5 230q0 228 -128.5 347.5t-363.5 119.5q-214 0 -385 -99.5t-266.5 -281.5t-95.5 -406q0 -259 140.5 -401t391.5 -142q200 0 430 86v-155q-219 -90 -454 -90 q-210 0 -367 83.5t-241.5 239.5t-84.5 365zM676 522q0 -157 112 -157q82 0 141.5 72t100.5 220l64 240q-53 16 -105 16q-86 0 -158.5 -53.5t-113.5 -144t-41 -193.5z" />
+<glyph unicode="A" horiz-adv-x="1210" d="M-121 0l783 1464h274l166 -1464h-234l-41 406h-485l-209 -406h-254zM446 614h365q-40 416 -45.5 503.5t-5.5 139.5q-55 -139 -142 -307z" />
+<glyph unicode="B" horiz-adv-x="1247" d="M70 0l309 1462h399q222 0 335.5 -84t113.5 -248q0 -146 -86.5 -243t-239.5 -127v-8q108 -28 167.5 -103.5t59.5 -183.5q0 -217 -150 -341t-417 -124h-491zM348 201h223q147 0 230.5 68t83.5 194q0 98 -60 149.5t-176 51.5h-200zM489 858h199q139 0 215 60.5t76 171.5 q0 172 -223 172h-181z" />
+<glyph unicode="C" horiz-adv-x="1225" d="M135 545q0 260 105.5 483t281.5 339t402 116q217 0 389 -92l-94 -195q-63 34 -134 58t-161 24q-154 0 -275 -89t-193.5 -259.5t-72.5 -374.5q0 -180 82.5 -275.5t243.5 -95.5q141 0 329 68v-205q-180 -67 -374 -67q-248 0 -388.5 148.5t-140.5 416.5z" />
+<glyph unicode="D" horiz-adv-x="1374" d="M70 0l309 1462h369q271 0 417 -145t146 -424q0 -271 -100 -473t-291 -311t-449 -109h-401zM348 201h135q177 0 309 86t202.5 242t70.5 356q0 184 -88 280.5t-256 96.5h-146z" />
+<glyph unicode="E" horiz-adv-x="1077" d="M70 0l309 1462h776l-43 -205h-539l-84 -395h502l-41 -203h-504l-96 -456h539l-43 -203h-776z" />
+<glyph unicode="F" horiz-adv-x="1026" d="M70 0l309 1462h774l-43 -205h-537l-96 -454h502l-45 -203h-500l-127 -600h-237z" />
+<glyph unicode="G" horiz-adv-x="1399" d="M135 539q0 264 102.5 483t290 340t426.5 121q111 0 213 -20.5t205 -69.5l-90 -203q-174 86 -334 86q-158 0 -287 -90.5t-203.5 -258t-74.5 -372.5q0 -183 89 -277t253 -94q109 0 215 33l80 371h-277l43 205h512l-157 -736q-112 -40 -218.5 -58.5t-238.5 -18.5 q-261 0 -405 146t-144 413z" />
+<glyph unicode="H" horiz-adv-x="1411" d="M70 0l309 1462h237l-127 -598h566l127 598h237l-309 -1462h-238l140 659h-566l-139 -659h-237z" />
+<glyph unicode="I" horiz-adv-x="608" d="M70 0l311 1462h235l-311 -1462h-235z" />
+<glyph unicode="J" horiz-adv-x="612" d="M-322 -383l5 201q84 -21 153 -21q201 0 254 250l299 1415h238l-305 -1446q-46 -217 -161.5 -320.5t-312.5 -103.5q-104 0 -170 25z" />
+<glyph unicode="K" horiz-adv-x="1198" d="M70 0l309 1462h237l-151 -706l141 166l492 540h284l-616 -669l321 -793h-262l-252 655l-149 -100l-117 -555h-237z" />
+<glyph unicode="L" horiz-adv-x="1016" d="M70 0l309 1462h237l-266 -1257h539l-43 -205h-776z" />
+<glyph unicode="M" horiz-adv-x="1757" d="M68 0l309 1462h323l109 -1149h6l606 1149h344l-305 -1462h-227l182 872q39 186 86 342h-6l-643 -1214h-205l-115 1214h-6q-9 -118 -55 -340l-184 -874h-219z" />
+<glyph unicode="N" horiz-adv-x="1491" d="M68 0l309 1462h268l399 -1149h7q6 54 31 192.5t40 203.5l160 753h219l-309 -1462h-260l-410 1163h-6l-10 -69q-24 -149 -35.5 -212.5t-183.5 -881.5h-219z" />
+<glyph unicode="O" horiz-adv-x="1485" d="M135 543q0 267 98.5 487.5t269.5 337.5t388 117q251 0 390.5 -149t139.5 -414q0 -279 -95 -497t-261.5 -331.5t-386.5 -113.5q-259 0 -401 149.5t-142 413.5zM383 545q0 -173 81.5 -267t227.5 -94q138 0 248.5 95.5t172 265t61.5 375.5q0 170 -79 265t-223 95 q-138 0 -250 -96t-175.5 -266.5t-63.5 -372.5z" />
+<glyph unicode="P" horiz-adv-x="1174" d="M70 0l309 1462h334q229 0 345 -100.5t116 -300.5q0 -248 -169.5 -381t-472.5 -133h-110l-115 -547h-237zM465 748h94q178 0 275.5 79.5t97.5 225.5q0 109 -58.5 159t-179.5 50h-119z" />
+<glyph unicode="Q" horiz-adv-x="1485" d="M135 543q0 267 98.5 487.5t269.5 337.5t388 117q251 0 390.5 -149t139.5 -414q0 -322 -130 -563t-355 -332l264 -375h-289l-202 328h-31q-259 0 -401 149.5t-142 413.5zM383 545q0 -173 81.5 -267t227.5 -94q138 0 248.5 94t172 263.5t61.5 378.5q0 170 -79 265t-223 95 q-138 0 -250 -96t-175.5 -266.5t-63.5 -372.5z" />
+<glyph unicode="R" horiz-adv-x="1206" d="M70 0l309 1462h338q223 0 342 -94.5t119 -290.5q0 -165 -86.5 -278.5t-257.5 -165.5l249 -633h-260l-207 584h-186l-123 -584h-237zM473 782h123q170 0 254 75t84 206q0 105 -59 151t-183 46h-119z" />
+<glyph unicode="S" horiz-adv-x="1057" d="M39 55v224q173 -97 350 -97q137 0 216 58.5t79 162.5q0 69 -41 122.5t-172 136.5q-105 67 -155 122t-76.5 120.5t-26.5 144.5q0 128 61.5 227t174 153t253.5 54q205 0 381 -92l-86 -191q-161 78 -295 78q-109 0 -175 -58.5t-66 -152.5q0 -47 15 -82.5t46.5 -66 t134.5 -95.5q155 -97 214 -187.5t59 -207.5q0 -210 -144.5 -329t-398.5 -119q-210 0 -348 75z" />
+<glyph unicode="T" horiz-adv-x="1053" d="M176 1257l45 205h998l-43 -205h-381l-267 -1257h-237l264 1257h-379z" />
+<glyph unicode="U" horiz-adv-x="1399" d="M152 391q0 83 20 170l193 901h237l-192 -905q-21 -88 -21 -158q0 -102 59.5 -158.5t180.5 -56.5q145 0 230 80.5t124 261.5l199 936h237l-202 -956q-56 -267 -208 -396.5t-403 -129.5q-217 0 -335.5 106t-118.5 305z" />
+<glyph unicode="V" horiz-adv-x="1165" d="M186 1462h232l74 -905q9 -103 11 -233l-1 -76h4q70 178 137 309l455 905h254l-764 -1462h-258z" />
+<glyph unicode="W" horiz-adv-x="1788" d="M203 1462h229l19 -850q0 -136 -13 -346h6q83 221 142 355l387 841h225l31 -839l3 -169l-3 -188h8q28 88 70 197.5t61 152.5l358 846h246l-655 -1462h-258l-37 842l-6 185l4 106h-6q-47 -144 -117 -291l-385 -842h-256z" />
+<glyph unicode="X" horiz-adv-x="1151" d="M-111 0l586 770l-250 692h246l178 -540l402 540h266l-551 -710l274 -752h-256l-192 592l-438 -592h-265z" />
+<glyph unicode="Y" horiz-adv-x="1092" d="M186 1462h242l154 -669l432 669h266l-623 -913l-114 -549h-238l119 553z" />
+<glyph unicode="Z" horiz-adv-x="1092" d="M-39 0l33 168l850 1087h-598l43 207h897l-35 -172l-852 -1085h645l-43 -205h-940z" />
+<glyph unicode="[" horiz-adv-x="631" d="M-27 -324l381 1786h430l-39 -176h-221l-303 -1433h221l-39 -177h-430z" />
+<glyph unicode="\" horiz-adv-x="788" d="M221 1462h207l219 -1462h-209z" />
+<glyph unicode="]" horiz-adv-x="631" d="M-143 -324l37 177h219l305 1433h-221l39 176h430l-381 -1786h-428z" />
+<glyph unicode="^" horiz-adv-x="1069" d="M37 537l608 933h127l272 -933h-184l-188 690l-434 -690h-201z" />
+<glyph unicode="_" horiz-adv-x="813" d="M-188 -324l30 140h817l-30 -140h-817z" />
+<glyph unicode="`" horiz-adv-x="1135" d="M541 1548v21h245q47 -154 132 -303v-25h-144q-65 63 -132 151.5t-101 155.5z" />
+<glyph unicode="a" horiz-adv-x="1186" d="M94 367q0 202 69.5 378t191.5 278.5t268 102.5q97 0 167 -45.5t109 -132.5h10l62 158h180l-236 -1106h-182l21 176h-6q-158 -196 -349 -196q-141 0 -223 101.5t-82 285.5zM332 373q0 -102 40.5 -152.5t112.5 -50.5q82 0 161 77.5t130 207.5t51 284q0 88 -47 141.5 t-123 53.5q-85 0 -160 -77t-120 -209.5t-45 -274.5z" />
+<glyph unicode="b" horiz-adv-x="1200" d="M47 0l330 1556h235l-71 -333q-13 -63 -38 -156.5t-40 -140.5h8q90 113 165 156.5t161 43.5q145 0 226 -103.5t81 -285.5q0 -202 -69.5 -379.5t-190.5 -277.5t-266 -100q-98 0 -168.5 45t-110.5 131h-10l-64 -156h-178zM369 373q0 -96 46.5 -149.5t131.5 -53.5t159 78.5 t117 210t43 274.5q0 201 -155 201q-81 0 -162 -80t-130.5 -210.5t-49.5 -270.5z" />
+<glyph unicode="c" horiz-adv-x="954" d="M94 389q0 207 73.5 376.5t206.5 265t302 95.5q164 0 297 -61l-70 -184q-122 53 -221 53q-150 0 -250 -153.5t-100 -379.5q0 -111 56 -171t155 -60q74 0 138.5 22t129.5 54v-195q-140 -71 -305 -71q-196 0 -304 106t-108 303z" />
+<glyph unicode="d" horiz-adv-x="1198" d="M94 369q0 205 71.5 383t191.5 276t266 98q179 0 268 -178h8q13 146 37 250l76 358h233l-330 -1556h-184l19 176h-7q-88 -106 -170 -151t-174 -45q-143 0 -224 101.5t-81 287.5zM332 373q0 -203 157 -203q82 0 162.5 82t129 214t48.5 267q0 91 -43.5 146t-132.5 55 q-85 0 -159 -77t-118 -211t-44 -273z" />
+<glyph unicode="e" horiz-adv-x="1075" d="M94 401q0 198 77.5 368.5t210 263.5t296.5 93q161 0 250.5 -72.5t89.5 -205.5q0 -182 -166.5 -284.5t-474.5 -102.5h-43l-2 -31v-29q0 -111 56.5 -174t168.5 -63q72 0 143 19t168 65v-187q-96 -44 -176.5 -62.5t-179.5 -18.5q-197 0 -307.5 111t-110.5 310zM362 633h29 q188 0 294 53.5t106 151.5q0 51 -32 79.5t-95 28.5q-96 0 -180.5 -86t-121.5 -227z" />
+<glyph unicode="f" horiz-adv-x="702" d="M-225 -279q64 -20 114 -20q134 0 177 205l217 1022h-179l21 106l194 76l21 92q44 198 134.5 281.5t256.5 83.5q115 0 211 -43l-61 -176q-74 28 -136 28q-69 0 -110.5 -43t-63.5 -141l-18 -86h229l-37 -178h-229l-223 -1053q-40 -189 -131 -278t-238 -89q-90 0 -149 23 v190z" />
+<glyph unicode="g" horiz-adv-x="1067" d="M-121 -211q0 103 69.5 178t223.5 127q-76 45 -76 127q0 69 46.5 119.5t146.5 97.5q-135 81 -135 252q0 196 122.5 316t323.5 120q80 0 160 -20h383l-31 -137l-192 -33q28 -58 28 -137q0 -193 -119 -306.5t-319 -113.5q-52 0 -92 8q-111 -40 -111 -104q0 -38 31.5 -52 t91.5 -22l127 -16q176 -22 252 -87.5t76 -187.5q0 -196 -151 -303t-429 -107q-203 0 -314.5 75t-111.5 206zM92 -184q0 -65 55.5 -103.5t169.5 -38.5q163 0 255 54t92 155q0 51 -45 80t-158 41l-137 14q-112 -18 -172 -71t-60 -131zM377 680q0 -71 35.5 -109.5t101.5 -38.5 q65 0 112.5 39t74 107t26.5 149q0 142 -133 142q-65 0 -114 -38.5t-76 -105t-27 -145.5z" />
+<glyph unicode="h" horiz-adv-x="1208" d="M47 0l330 1556h235l-57 -262q-27 -126 -73 -293l-19 -75h8q84 106 168.5 153t177.5 47q136 0 208.5 -77.5t72.5 -221.5q0 -76 -23 -174l-139 -653h-234l142 672q18 90 18 127q0 135 -129 135q-112 0 -209.5 -125t-142.5 -342l-98 -467h-236z" />
+<glyph unicode="i" horiz-adv-x="563" d="M47 0l236 1106h235l-235 -1106h-236zM330 1378q0 68 39 110t110 42q53 0 86 -26.5t33 -80.5q0 -71 -40 -112t-105 -41q-53 0 -88 26t-35 82z" />
+<glyph unicode="j" horiz-adv-x="563" d="M-262 -279q64 -20 117 -20q131 0 170 186l260 1219h233l-266 -1247q-38 -181 -127.5 -266t-237.5 -85q-90 0 -149 23v190zM332 1378q0 68 38 110t109 42q54 0 86.5 -26.5t32.5 -80.5q0 -71 -40 -112t-105 -41q-53 0 -87 25.5t-34 82.5z" />
+<glyph unicode="k" horiz-adv-x="1081" d="M47 0l330 1556h235q-135 -627 -159.5 -729.5t-59.5 -226.5h4l490 506h272l-483 -485l291 -621h-262l-209 471l-136 -96l-77 -375h-236z" />
+<glyph unicode="l" horiz-adv-x="563" d="M47 0l330 1556h235l-331 -1556h-234z" />
+<glyph unicode="m" horiz-adv-x="1819" d="M47 0l236 1106h184l-21 -205h9q148 225 352 225q220 0 254 -235h8q75 116 170.5 175.5t198.5 59.5q133 0 202.5 -76.5t69.5 -215.5q0 -64 -22 -181l-140 -653h-235l143 672q19 95 19 133q0 129 -121 129q-108 0 -201.5 -124t-136.5 -329l-101 -481h-235l143 672 q17 82 17 127q0 135 -117 135q-110 0 -203.5 -127t-138.5 -338l-98 -469h-236z" />
+<glyph unicode="n" horiz-adv-x="1208" d="M47 0l236 1106h184l-21 -205h9q83 118 171 171.5t191 53.5q134 0 207.5 -76t73.5 -216q0 -69 -23 -181l-137 -653h-236l142 672q18 90 18 131q0 131 -129 131q-72 0 -142 -57t-126 -164.5t-84 -243.5l-98 -469h-236z" />
+<glyph unicode="o" horiz-adv-x="1174" d="M94 408q0 199 71.5 365t200.5 258.5t298 92.5q195 0 305 -116t110 -316q0 -202 -73 -367.5t-200.5 -254t-293.5 -88.5q-192 0 -305 114.5t-113 311.5zM332 403q0 -111 49.5 -170t146.5 -59q90 0 162 68t112 190.5t40 269.5q0 107 -49 167.5t-140 60.5q-93 0 -166.5 -71.5 t-114 -194t-40.5 -261.5z" />
+<glyph unicode="p" horiz-adv-x="1200" d="M-55 -492l338 1598h184l-21 -188h9q157 208 344 208q143 0 224 -103t81 -286q0 -204 -70 -381.5t-190.5 -276.5t-265.5 -99q-181 0 -269 176h-10q-7 -97 -25 -185l-96 -463h-233zM369 373q0 -96 46.5 -149.5t131.5 -53.5t159 78.5t117 210t43 274.5q0 201 -155 201 q-81 0 -161 -79.5t-130.5 -210.5t-50.5 -271z" />
+<glyph unicode="q" horiz-adv-x="1198" d="M94 367q0 208 73 387t192.5 275.5t265.5 96.5q183 0 274 -178h10l64 158h178l-340 -1598h-233l75 349q12 56 43.5 180t38.5 141h-8q-84 -108 -164 -153t-170 -45q-139 0 -219 102.5t-80 284.5zM332 373q0 -203 160 -203q80 0 159 81t127.5 213t48.5 269q0 94 -45.5 147.5 t-126.5 53.5q-86 0 -160 -77.5t-118.5 -209.5t-44.5 -274z" />
+<glyph unicode="r" horiz-adv-x="836" d="M47 0l236 1106h184l-21 -205h9q83 120 166 172.5t176 52.5q62 0 108 -12l-51 -219q-54 14 -102 14q-126 0 -225 -113t-138 -296l-106 -500h-236z" />
+<glyph unicode="s" horiz-adv-x="922" d="M14 47v203q153 -90 312 -90q97 0 157 40t60 109q0 51 -34.5 87.5t-141.5 97.5q-125 67 -176.5 136.5t-51.5 164.5q0 155 107 243t289 88q196 0 346 -84l-76 -176q-140 76 -266 76q-73 0 -118.5 -33t-45.5 -92q0 -45 33 -80t135 -90q105 -59 149 -101t67 -91.5t23 -114.5 q0 -173 -118 -266.5t-328 -93.5q-190 0 -322 67z" />
+<glyph unicode="t" horiz-adv-x="752" d="M92 928l21 110l190 82l129 232h146l-52 -246h279l-39 -178h-277l-122 -572q-13 -55 -13 -92q0 -43 25 -68.5t76 -25.5q68 0 151 31v-178q-35 -17 -95 -30t-120 -13q-274 0 -274 247q0 57 16 131l121 570h-162z" />
+<glyph unicode="u" horiz-adv-x="1208" d="M111 274q0 63 12 124.5t24 123.5l123 584h236l-129 -610q-31 -141 -31 -193q0 -133 127 -133q72 0 143 57t126 162.5t85 247.5l99 469h233l-233 -1106h-185l21 205h-8q-82 -116 -171 -170.5t-192 -54.5q-134 0 -207 76t-73 218z" />
+<glyph unicode="v" horiz-adv-x="997" d="M100 1106h232l55 -598q14 -159 14 -297h7q28 74 70 165t65 132l311 598h250l-598 -1106h-275z" />
+<glyph unicode="w" horiz-adv-x="1540" d="M121 1106h221l13 -646q-2 -87 -11 -245h6q66 176 109 272l278 619h254l19 -604l1 -53l-3 -234h6q17 50 57 158.5t63.5 163.5t251.5 569h244l-518 -1106h-268l-19 627l-1 70l3 200q-25 -62 -51.5 -125t-345.5 -772h-262z" />
+<glyph unicode="x" horiz-adv-x="1032" d="M-86 0l475 569l-231 537h245l144 -373l287 373h274l-461 -549l248 -557h-246l-160 387l-305 -387h-270z" />
+<glyph unicode="y" horiz-adv-x="1004" d="M-170 -285q75 -16 125 -16q74 0 134 43.5t124 155.5l51 92l-164 1116h232l63 -531q9 -62 16 -174.5t7 -181.5h6q86 215 135 313l293 574h254l-688 -1280q-90 -165 -196 -241.5t-249 -76.5q-76 0 -143 19v188z" />
+<glyph unicode="z" horiz-adv-x="920" d="M-39 0l29 147l635 781h-439l39 178h705l-37 -170l-623 -758h486l-37 -178h-758z" />
+<glyph unicode="{" horiz-adv-x="721" d="M8 485l39 187q120 0 191.5 42.5t93.5 143.5l59 275q28 134 73 201.5t120 97.5t198 30h60l-41 -184q-96 0 -139.5 -34t-61.5 -116l-70 -309q-24 -108 -87 -170.5t-179 -79.5v-6q160 -45 160 -215q0 -38 -16 -121l-43 -194q-11 -48 -11 -74q0 -51 32.5 -74.5t109.5 -23.5 v-185h-39q-316 0 -316 236q0 61 17 133l45 201q14 65 14 98q0 141 -209 141z" />
+<glyph unicode="|" d="M498 -481v2033h178v-2033h-178z" />
+<glyph unicode="}" horiz-adv-x="721" d="M-88 -141q106 2 152.5 36.5t64.5 114.5l70 309q24 109 87 170t179 78v6q-158 48 -158 215q0 55 17 121l43 197q10 44 10 74q0 58 -43 78t-121 20l35 184h22q318 0 318 -235q0 -61 -17 -133l-45 -203q-14 -65 -14 -98q0 -142 209 -142l-39 -186q-121 0 -192 -42t-93 -142 l-63 -306q-34 -165 -123.5 -232t-269.5 -67h-29v183z" />
+<glyph unicode="~" d="M111 571v191q100 108 249 108q64 0 118.5 -12t146.5 -51q70 -30 115 -42.5t94 -12.5q50 0 112.5 31t120.5 89v-190q-103 -111 -250 -111q-63 0 -124 16.5t-138 49.5q-76 32 -119.5 43.5t-91.5 11.5q-51 0 -112 -31t-121 -90z" />
+<glyph unicode="&#xa2;" d="M195 586q0 190 63.5 351t178 260.5t261.5 121.5l35 164h156l-37 -164q124 -12 221 -57l-69 -185q-125 53 -222 53q-99 0 -180 -71.5t-125.5 -194.5t-44.5 -266q0 -111 56 -171t155 -60q74 0 138.5 21.5t129.5 53.5v-194q-133 -69 -293 -74l-40 -194h-156l45 213 q-132 34 -202 134.5t-70 258.5z" />
+<glyph unicode="&#xa3;" d="M-18 0l38 193q200 45 250 276l35 164h-196l36 172h197l61 299q38 185 153 282t300 97q188 0 352 -86l-88 -183q-143 74 -258 74q-185 0 -227 -205l-57 -278h333l-34 -172h-336l-33 -152q-21 -98 -68.5 -165t-130.5 -109h690l-45 -207h-972z" />
+<glyph unicode="&#xa5;" d="M106 244l33 155h273l30 148h-272l35 155h211l-199 760h232l145 -669l432 669h248l-518 -760h217l-35 -155h-274l-31 -148h274l-33 -155h-272l-53 -244h-221l51 244h-273z" />
+<glyph unicode="&#xa9;" horiz-adv-x="1704" d="M131 731q0 200 100 375t275 276t377 101q199 0 373.5 -99t276 -275.5t101.5 -377.5q0 -199 -98.5 -373t-272.5 -276t-380 -102q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM254 731q0 -168 83 -312.5t229 -230.5t317 -86q173 0 319.5 87t227.5 231.5t81 310.5 q0 165 -82 310.5t-227.5 232t-318.5 86.5q-168 0 -314.5 -84.5t-230.5 -231t-84 -313.5zM502 727q0 216 113.5 340.5t312.5 124.5q138 0 266 -66l-68 -147q-106 55 -196 55q-113 0 -175.5 -76t-62.5 -231q0 -301 238 -301q47 0 112 16t109 35v-158q-117 -51 -240 -51 q-197 0 -303 123.5t-106 335.5z" />
+<glyph unicode="&#xad;" horiz-adv-x="649" d="M47 446l45 203h502l-45 -203h-502z" />
+<glyph unicode="&#xae;" horiz-adv-x="1704" d="M131 731q0 200 100 375t275 276t377 101q199 0 373.5 -99t276 -275.5t101.5 -377.5q0 -199 -98.5 -373t-272.5 -276t-380 -102q-207 0 -382 103.5t-272.5 276.5t-97.5 371zM254 731q0 -168 83 -312.5t229 -230.5t317 -86q173 0 319.5 87t227.5 231.5t81 310.5 q0 165 -82 310.5t-227.5 232t-318.5 86.5q-168 0 -314.5 -84.5t-230.5 -231t-84 -313.5zM608 291v878h269q337 0 337 -262q0 -83 -45.5 -145t-130.5 -98l211 -373h-200l-172 325h-91v-325h-178zM786 760h72q84 0 129 36t45 99q0 73 -45.5 101t-128.5 28h-72v-264z" />
+<glyph unicode="&#xb4;" horiz-adv-x="1135" d="M508 1241v25q97 108 225 303h264v-19q-54 -66 -158 -161.5t-175 -147.5h-156z" />
+<glyph unicode="&#x2000;" horiz-adv-x="784" />
+<glyph unicode="&#x2001;" horiz-adv-x="1569" />
+<glyph unicode="&#x2002;" horiz-adv-x="784" />
+<glyph unicode="&#x2003;" horiz-adv-x="1569" />
+<glyph unicode="&#x2004;" horiz-adv-x="523" />
+<glyph unicode="&#x2005;" horiz-adv-x="392" />
+<glyph unicode="&#x2006;" horiz-adv-x="261" />
+<glyph unicode="&#x2007;" horiz-adv-x="261" />
+<glyph unicode="&#x2008;" horiz-adv-x="196" />
+<glyph unicode="&#x2009;" horiz-adv-x="313" />
+<glyph unicode="&#x200a;" horiz-adv-x="87" />
+<glyph unicode="&#x2010;" horiz-adv-x="649" d="M47 446l45 203h502l-45 -203h-502z" />
+<glyph unicode="&#x2011;" horiz-adv-x="649" d="M47 446l45 203h502l-45 -203h-502z" />
+<glyph unicode="&#x2012;" horiz-adv-x="649" d="M47 446l45 203h502l-45 -203h-502z" />
+<glyph unicode="&#x2013;" horiz-adv-x="983" d="M47 453l43 194h838l-43 -194h-838z" />
+<glyph unicode="&#x2014;" horiz-adv-x="1966" d="M47 453l43 194h1821l-43 -194h-1821z" />
+<glyph unicode="&#x2018;" horiz-adv-x="393" d="M119 983q34 76 106.5 209t159.5 270h176q-122 -286 -199 -501h-237z" />
+<glyph unicode="&#x2019;" horiz-adv-x="393" d="M115 961q43 95 106 255t92 246h238l8 -22q-37 -83 -110.5 -217.5t-155.5 -261.5h-178z" />
+<glyph unicode="&#x201c;" horiz-adv-x="803" d="M119 983q34 76 106.5 209t159.5 270h176q-122 -286 -199 -501h-237zM526 983q84 190 267 479h176q-122 -286 -199 -501h-235z" />
+<glyph unicode="&#x201d;" horiz-adv-x="803" d="M115 961q43 95 106 255t92 246h238l8 -22q-37 -83 -110.5 -217.5t-155.5 -261.5h-178zM522 961q51 114 109 261t90 240h237l9 -22q-98 -220 -269 -479h-176z" />
+<glyph unicode="&#x2022;" horiz-adv-x="756" d="M152 684q0 156 83.5 252t223.5 96q100 0 158.5 -54.5t58.5 -168.5q0 -156 -82 -252t-227 -96q-102 0 -158.5 57.5t-56.5 165.5z" />
+<glyph unicode="&#x2026;" horiz-adv-x="1634" d="M834 94q0 83 47 132.5t131 49.5q56 0 89.5 -31.5t33.5 -92.5q0 -78 -47.5 -129.5t-124.5 -51.5q-66 0 -97.5 35.5t-31.5 87.5zM594 94q0 83 47 132.5t131 49.5q56 0 89.5 -31.5t33.5 -92.5q0 -78 -47.5 -129.5t-124.5 -51.5q-66 0 -97.5 35.5t-31.5 87.5zM293 94 q0 83 47 132.5t131 49.5q56 0 89.5 -31.5t33.5 -92.5q0 -78 -47.5 -129.5t-124.5 -51.5q-66 0 -97.5 35.5t-31.5 87.5z" />
+<glyph unicode="&#x202f;" horiz-adv-x="313" />
+<glyph unicode="&#x205f;" horiz-adv-x="392" />
+<glyph unicode="&#x20ac;" d="M51 492l33 155h139q15 95 27 139h-137l32 154h148q92 260 255.5 401.5t371.5 141.5q88 0 164.5 -22t156.5 -77l-102 -180q-54 34 -107 56t-119 22q-118 0 -214.5 -87t-161.5 -255h387l-33 -154h-402q-18 -67 -28 -139h340l-33 -155h-319q0 -161 60.5 -234.5t195.5 -73.5 q120 0 258 60v-203q-129 -61 -306 -61q-216 0 -330 130t-114 382h-162z" />
+<glyph unicode="&#x2122;" horiz-adv-x="1534" d="M113 1335v127h540v-127h-198v-594h-146v594h-196zM709 741v721h215l170 -534l182 534h205v-721h-146v418l4 121h-6l-184 -539h-119l-178 539h-6l4 -115v-424h-141z" />
+<glyph unicode="&#xe000;" horiz-adv-x="1105" d="M0 1105h1105v-1105h-1105v1105z" />
+</font>
+</defs></svg> 
\ No newline at end of file
diff --git a/fonts/OpenSans-SemiboldItalic-webfont.ttf b/fonts/OpenSans-SemiboldItalic-webfont.ttf
new file mode 100644
index 0000000..55ba312
Binary files /dev/null and b/fonts/OpenSans-SemiboldItalic-webfont.ttf differ
diff --git a/fonts/OpenSans-SemiboldItalic-webfont.woff b/fonts/OpenSans-SemiboldItalic-webfont.woff
new file mode 100644
index 0000000..0adc6df
Binary files /dev/null and b/fonts/OpenSans-SemiboldItalic-webfont.woff differ
diff --git a/images/bullet.png b/images/bullet.png
new file mode 100644
index 0000000..22ea543
Binary files /dev/null and b/images/bullet.png differ
diff --git a/images/hr.gif b/images/hr.gif
new file mode 100644
index 0000000..bdb4168
Binary files /dev/null and b/images/hr.gif differ
diff --git a/images/nav-bg.gif b/images/nav-bg.gif
new file mode 100644
index 0000000..4743965
Binary files /dev/null and b/images/nav-bg.gif differ
diff --git a/index.html b/index.html
new file mode 100644
index 0000000..b9f545f
--- /dev/null
+++ b/index.html
@@ -0,0 +1,115 @@
+<!doctype html>
+<html>
+  <head>
+    <meta charset="utf-8">
+    <meta http-equiv="X-UA-Compatible" content="chrome=1">
+    <title>Javascript-data-structures by Bishop92</title>
+    <link rel="stylesheet" href="stylesheets/styles.css">
+    <link rel="stylesheet" href="stylesheets/pygment_trac.css">
+    <script src="https://ajax.googleapis.com/ajax/libs/jquery/1.7.1/jquery.min.js"></script>
+    <script src="javascripts/respond.js"></script>
+    <!--[if lt IE 9]>
+      <script src="//html5shiv.googlecode.com/svn/trunk/html5.js"></script>
+    <![endif]-->
+    <!--[if lt IE 8]>
+    <link rel="stylesheet" href="stylesheets/ie.css">
+    <![endif]-->
+    <meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no">
+
+  </head>
+  <body>
+      <div id="header">
+        <nav>
+          <li class="fork"><a href="https://github.com/Bishop92/JavaScript-Data-Structures">View On GitHub</a></li>
+          <li class="downloads"><a href="https://github.com/Bishop92/JavaScript-Data-Structures/zipball/master">ZIP</a></li>
+          <li class="downloads"><a href="https://github.com/Bishop92/JavaScript-Data-Structures/tarball/master">TAR</a></li>
+          <li class="title">DOWNLOADS</li>
+        </nav>
+      </div><!-- end header -->
+
+    <div class="wrapper">
+
+      <section>
+        <div id="title">
+          <h1>Javascript-data-structures</h1>
+          <p>A library for data structure in JavaScript</p>
+          <hr>
+          <span class="credits left">Project maintained by <a href="https://github.com/Bishop92">Bishop92</a></span>
+          <span class="credits right">Hosted on GitHub Pages &mdash; Theme by <a href="https://twitter.com/michigangraham">mattgraham</a></span>
+        </div>
+
+        <h1>
+<a name="data-structures" class="anchor" href="#data-structures"><span class="octicon octicon-link"></span></a><a href="https://github.com/Bishop92/JavaScript-Data-Structures">Data Structures</a>
+</h1>
+
+<p><strong>A library for data structures in JavaScript</strong></p>
+
+<p>DataStructures is a JavaScript library where you can find the most common data structures and also other data
+structures more advanced. Various method are also provided in order to manipulate data structures.</p>
+
+<p>This library implements the <a href="http://en.wikipedia.org/wiki/Iterator_pattern">iterator</a> pattern in order to hide
+the data structure that work for storing your data.</p>
+
+<h2>
+<a name="supported-data-structures" class="anchor" href="#supported-data-structures"><span class="octicon octicon-link"></span></a>Supported data structures</h2>
+
+<ul>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Stack.html">Stack</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Queue.html">Queue</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/PriorityQueue.html">Priority Queue</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/CircularBuffer.html">Circular Buffer</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/HashTable.html">Hash Table</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/LinkedList.html">Linked List</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/DoubleLinkedList.html">Double Linked List</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/BSTree.html">Binary Search Tree</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/RBTree.html">Red-Black Tree</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/RBTreeList.html">Red-Black Tree List</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/BTree.html">B-Tree</a></li>
+<li><a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Set.html">Set</a></li>
+</ul><h2>
+<a name="how-to-use" class="anchor" href="#how-to-use"><span class="octicon octicon-link"></span></a>How to use</h2>
+
+<ol>
+<li><p>Download the minimized library <a href="https://raw.githubusercontent.com/Bishop92/JavaScript-Data-Structures/master/DataStructuresMinimized.js">here</a> (right click and save as...);</p></li>
+<li><p>Include the file in your project;</p></li>
+<li><p>Start to use it as any other class.</p></li>
+</ol><p>Example</p>
+
+<div class="highlight highlight-JavaScript"><pre><span class="kd">var</span> <span class="nx">listA</span> <span class="o">=</span> <span class="k">new</span> <span class="nx">DoubleLinkedList</span><span class="p">();</span>
+<span class="kd">var</span> <span class="nx">listB</span> <span class="o">=</span> <span class="k">new</span> <span class="nx">DoubleLinkedList</span><span class="p">();</span>
+<span class="nx">listA</span><span class="p">.</span><span class="nx">fromArray</span><span class="p">([</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">]);</span>
+<span class="nx">listB</span><span class="p">.</span><span class="nx">fromArray</span><span class="p">([</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">]);</span>
+<span class="nx">listA</span><span class="p">.</span><span class="nx">join</span><span class="p">(</span><span class="nx">listB</span><span class="p">);</span>
+<span class="nx">listA</span><span class="p">.</span><span class="nx">toArray</span><span class="p">();</span> <span class="c1">// [0, 1, 2, 3]</span>
+</pre></div>
+
+<h2>
+<a name="documentation" class="anchor" href="#documentation"><span class="octicon octicon-link"></span></a>Documentation</h2>
+
+<p>Follow this <a href="https://github.com/Bishop92/JavaScript-Data-Structures/wiki">link</a> to read the full documentation.
+Follow this <a href="https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/index.html">link</a> to read the JSDoc.</p>
+
+<h2>
+<a name="history" class="anchor" href="#history"><span class="octicon octicon-link"></span></a>History</h2>
+
+<h3>
+<a name="future-implementations" class="anchor" href="#future-implementations"><span class="octicon octicon-link"></span></a>Future implementations</h3>
+
+<ul>
+<li>Persistence for data structures like array and lists.</li>
+</ul><h3>
+<a name="current-state-of-the-art" class="anchor" href="#current-state-of-the-art"><span class="octicon octicon-link"></span></a>Current state of the art</h3>
+
+<ul>
+<li>v 1.0.0 First release of the library.</li>
+</ul><h2>
+<a name="support" class="anchor" href="#support"><span class="octicon octicon-link"></span></a>Support</h2>
+
+<p>Battistella Stefano, <a href="mailto:stefano.battistella.92@gmail.com">stefano.battistella.92@gmail.com</a></p>
+      </section>
+
+    </div>
+    <!--[if !IE]><script>fixScale(document);</script><![endif]-->
+    
+  </body>
+</html>
\ No newline at end of file
diff --git a/javascripts/respond.js b/javascripts/respond.js
new file mode 100644
index 0000000..76bc260
--- /dev/null
+++ b/javascripts/respond.js
@@ -0,0 +1,779 @@
+if(typeof Object.create!=="function"){
+Object.create=function(o){
+function F(){
+};
+F.prototype=o;
+return new F();
+};
+}
+var ua={toString:function(){
+return navigator.userAgent;
+},test:function(s){
+return this.toString().toLowerCase().indexOf(s.toLowerCase())>-1;
+}};
+ua.version=(ua.toString().toLowerCase().match(/[\s\S]+(?:rv|it|ra|ie)[\/: ]([\d.]+)/)||[])[1];
+ua.webkit=ua.test("webkit");
+ua.gecko=ua.test("gecko")&&!ua.webkit;
+ua.opera=ua.test("opera");
+ua.ie=ua.test("msie")&&!ua.opera;
+ua.ie6=ua.ie&&document.compatMode&&typeof document.documentElement.style.maxHeight==="undefined";
+ua.ie7=ua.ie&&document.documentElement&&typeof document.documentElement.style.maxHeight!=="undefined"&&typeof XDomainRequest==="undefined";
+ua.ie8=ua.ie&&typeof XDomainRequest!=="undefined";
+var domReady=function(){
+var _1=[];
+var _2=function(){
+if(!arguments.callee.done){
+arguments.callee.done=true;
+for(var i=0;i<_1.length;i++){
+_1[i]();
+}
+}
+};
+if(document.addEventListener){
+document.addEventListener("DOMContentLoaded",_2,false);
+}
+if(ua.ie){
+(function(){
+try{
+document.documentElement.doScroll("left");
+}
+catch(e){
+setTimeout(arguments.callee,50);
+return;
+}
+_2();
+})();
+document.onreadystatechange=function(){
+if(document.readyState==="complete"){
+document.onreadystatechange=null;
+_2();
+}
+};
+}
+if(ua.webkit&&document.readyState){
+(function(){
+if(document.readyState!=="loading"){
+_2();
+}else{
+setTimeout(arguments.callee,10);
+}
+})();
+}
+window.onload=_2;
+return function(fn){
+if(typeof fn==="function"){
+_1[_1.length]=fn;
+}
+return fn;
+};
+}();
+var cssHelper=function(){
+var _3={BLOCKS:/[^\s{][^{]*\{(?:[^{}]*\{[^{}]*\}[^{}]*|[^{}]*)*\}/g,BLOCKS_INSIDE:/[^\s{][^{]*\{[^{}]*\}/g,DECLARATIONS:/[a-zA-Z\-]+[^;]*:[^;]+;/g,RELATIVE_URLS:/url\(['"]?([^\/\)'"][^:\)'"]+)['"]?\)/g,REDUNDANT_COMPONENTS:/(?:\/\*([^*\\\\]|\*(?!\/))+\*\/|@import[^;]+;)/g,REDUNDANT_WHITESPACE:/\s*(,|:|;|\{|\})\s*/g,MORE_WHITESPACE:/\s{2,}/g,FINAL_SEMICOLONS:/;\}/g,NOT_WHITESPACE:/\S+/g};
+var _4,_5=false;
+var _6=[];
+var _7=function(fn){
+if(typeof fn==="function"){
+_6[_6.length]=fn;
+}
+};
+var _8=function(){
+for(var i=0;i<_6.length;i++){
+_6[i](_4);
+}
+};
+var _9={};
+var _a=function(n,v){
+if(_9[n]){
+var _b=_9[n].listeners;
+if(_b){
+for(var i=0;i<_b.length;i++){
+_b[i](v);
+}
+}
+}
+};
+var _c=function(_d,_e,_f){
+if(ua.ie&&!window.XMLHttpRequest){
+window.XMLHttpRequest=function(){
+return new ActiveXObject("Microsoft.XMLHTTP");
+};
+}
+if(!XMLHttpRequest){
+return "";
+}
+var r=new XMLHttpRequest();
+try{
+r.open("get",_d,true);
+r.setRequestHeader("X_REQUESTED_WITH","XMLHttpRequest");
+}
+catch(e){
+_f();
+return;
+}
+var _10=false;
+setTimeout(function(){
+_10=true;
+},5000);
+document.documentElement.style.cursor="progress";
+r.onreadystatechange=function(){
+if(r.readyState===4&&!_10){
+if(!r.status&&location.protocol==="file:"||(r.status>=200&&r.status<300)||r.status===304||navigator.userAgent.indexOf("Safari")>-1&&typeof r.status==="undefined"){
+_e(r.responseText);
+}else{
+_f();
+}
+document.documentElement.style.cursor="";
+r=null;
+}
+};
+r.send("");
+};
+var _11=function(_12){
+_12=_12.replace(_3.REDUNDANT_COMPONENTS,"");
+_12=_12.replace(_3.REDUNDANT_WHITESPACE,"$1");
+_12=_12.replace(_3.MORE_WHITESPACE," ");
+_12=_12.replace(_3.FINAL_SEMICOLONS,"}");
+return _12;
+};
+var _13={mediaQueryList:function(s){
+var o={};
+var idx=s.indexOf("{");
+var lt=s.substring(0,idx);
+s=s.substring(idx+1,s.length-1);
+var mqs=[],rs=[];
+var qts=lt.toLowerCase().substring(7).split(",");
+for(var i=0;i<qts.length;i++){
+mqs[mqs.length]=_13.mediaQuery(qts[i],o);
+}
+var rts=s.match(_3.BLOCKS_INSIDE);
+if(rts!==null){
+for(i=0;i<rts.length;i++){
+rs[rs.length]=_13.rule(rts[i],o);
+}
+}
+o.getMediaQueries=function(){
+return mqs;
+};
+o.getRules=function(){
+return rs;
+};
+o.getListText=function(){
+return lt;
+};
+o.getCssText=function(){
+return s;
+};
+return o;
+},mediaQuery:function(s,mql){
+s=s||"";
+var not=false,_14;
+var exp=[];
+var _15=true;
+var _16=s.match(_3.NOT_WHITESPACE);
+for(var i=0;i<_16.length;i++){
+var _17=_16[i];
+if(!_14&&(_17==="not"||_17==="only")){
+if(_17==="not"){
+not=true;
+}
+}else{
+if(!_14){
+_14=_17;
+}else{
+if(_17.charAt(0)==="("){
+var _18=_17.substring(1,_17.length-1).split(":");
+exp[exp.length]={mediaFeature:_18[0],value:_18[1]||null};
+}
+}
+}
+}
+return {getList:function(){
+return mql||null;
+},getValid:function(){
+return _15;
+},getNot:function(){
+return not;
+},getMediaType:function(){
+return _14;
+},getExpressions:function(){
+return exp;
+}};
+},rule:function(s,mql){
+var o={};
+var idx=s.indexOf("{");
+var st=s.substring(0,idx);
+var ss=st.split(",");
+var ds=[];
+var dts=s.substring(idx+1,s.length-1).split(";");
+for(var i=0;i<dts.length;i++){
+ds[ds.length]=_13.declaration(dts[i],o);
+}
+o.getMediaQueryList=function(){
+return mql||null;
+};
+o.getSelectors=function(){
+return ss;
+};
+o.getSelectorText=function(){
+return st;
+};
+o.getDeclarations=function(){
+return ds;
+};
+o.getPropertyValue=function(n){
+for(var i=0;i<ds.length;i++){
+if(ds[i].getProperty()===n){
+return ds[i].getValue();
+}
+}
+return null;
+};
+return o;
+},declaration:function(s,r){
+var idx=s.indexOf(":");
+var p=s.substring(0,idx);
+var v=s.substring(idx+1);
+return {getRule:function(){
+return r||null;
+},getProperty:function(){
+return p;
+},getValue:function(){
+return v;
+}};
+}};
+var _19=function(el){
+if(typeof el.cssHelperText!=="string"){
+return;
+}
+var o={mediaQueryLists:[],rules:[],selectors:{},declarations:[],properties:{}};
+var _1a=o.mediaQueryLists;
+var ors=o.rules;
+var _1b=el.cssHelperText.match(_3.BLOCKS);
+if(_1b!==null){
+for(var i=0;i<_1b.length;i++){
+if(_1b[i].substring(0,7)==="@media "){
+_1a[_1a.length]=_13.mediaQueryList(_1b[i]);
+ors=o.rules=ors.concat(_1a[_1a.length-1].getRules());
+}else{
+ors[ors.length]=_13.rule(_1b[i]);
+}
+}
+}
+var oss=o.selectors;
+var _1c=function(r){
+var ss=r.getSelectors();
+for(var i=0;i<ss.length;i++){
+var n=ss[i];
+if(!oss[n]){
+oss[n]=[];
+}
+oss[n][oss[n].length]=r;
+}
+};
+for(i=0;i<ors.length;i++){
+_1c(ors[i]);
+}
+var ods=o.declarations;
+for(i=0;i<ors.length;i++){
+ods=o.declarations=ods.concat(ors[i].getDeclarations());
+}
+var ops=o.properties;
+for(i=0;i<ods.length;i++){
+var n=ods[i].getProperty();
+if(!ops[n]){
+ops[n]=[];
+}
+ops[n][ops[n].length]=ods[i];
+}
+el.cssHelperParsed=o;
+_4[_4.length]=el;
+return o;
+};
+var _1d=function(el,s){
+el.cssHelperText=_11(s||el.innerHTML);
+return _19(el);
+};
+var _1e=function(){
+_5=true;
+_4=[];
+var _1f=[];
+var _20=function(){
+for(var i=0;i<_1f.length;i++){
+_19(_1f[i]);
+}
+var _21=document.getElementsByTagName("style");
+for(i=0;i<_21.length;i++){
+_1d(_21[i]);
+}
+_5=false;
+_8();
+};
+var _22=document.getElementsByTagName("link");
+for(var i=0;i<_22.length;i++){
+var _23=_22[i];
+if(_23.getAttribute("rel").indexOf("style")>-1&&_23.href&&_23.href.length!==0&&!_23.disabled){
+_1f[_1f.length]=_23;
+}
+}
+if(_1f.length>0){
+var c=0;
+var _24=function(){
+c++;
+if(c===_1f.length){
+_20();
+}
+};
+var _25=function(_26){
+var _27=_26.href;
+_c(_27,function(_28){
+_28=_11(_28).replace(_3.RELATIVE_URLS,"url("+_27.substring(0,_27.lastIndexOf("/"))+"/$1)");
+_26.cssHelperText=_28;
+_24();
+},_24);
+};
+for(i=0;i<_1f.length;i++){
+_25(_1f[i]);
+}
+}else{
+_20();
+}
+};
+var _29={mediaQueryLists:"array",rules:"array",selectors:"object",declarations:"array",properties:"object"};
+var _2a={mediaQueryLists:null,rules:null,selectors:null,declarations:null,properties:null};
+var _2b=function(_2c,v){
+if(_2a[_2c]!==null){
+if(_29[_2c]==="array"){
+return (_2a[_2c]=_2a[_2c].concat(v));
+}else{
+var c=_2a[_2c];
+for(var n in v){
+if(v.hasOwnProperty(n)){
+if(!c[n]){
+c[n]=v[n];
+}else{
+c[n]=c[n].concat(v[n]);
+}
+}
+}
+return c;
+}
+}
+};
+var _2d=function(_2e){
+_2a[_2e]=(_29[_2e]==="array")?[]:{};
+for(var i=0;i<_4.length;i++){
+_2b(_2e,_4[i].cssHelperParsed[_2e]);
+}
+return _2a[_2e];
+};
+domReady(function(){
+var els=document.body.getElementsByTagName("*");
+for(var i=0;i<els.length;i++){
+els[i].checkedByCssHelper=true;
+}
+if(document.implementation.hasFeature("MutationEvents","2.0")||window.MutationEvent){
+document.body.addEventListener("DOMNodeInserted",function(e){
+var el=e.target;
+if(el.nodeType===1){
+_a("DOMElementInserted",el);
+el.checkedByCssHelper=true;
+}
+},false);
+}else{
+setInterval(function(){
+var els=document.body.getElementsByTagName("*");
+for(var i=0;i<els.length;i++){
+if(!els[i].checkedByCssHelper){
+_a("DOMElementInserted",els[i]);
+els[i].checkedByCssHelper=true;
+}
+}
+},1000);
+}
+});
+var _2f=function(d){
+if(typeof window.innerWidth!="undefined"){
+return window["inner"+d];
+}else{
+if(typeof document.documentElement!="undefined"&&typeof document.documentElement.clientWidth!="undefined"&&document.documentElement.clientWidth!=0){
+return document.documentElement["client"+d];
+}
+}
+};
+return {addStyle:function(s,_30){
+var el=document.createElement("style");
+el.setAttribute("type","text/css");
+document.getElementsByTagName("head")[0].appendChild(el);
+if(el.styleSheet){
+el.styleSheet.cssText=s;
+}else{
+el.appendChild(document.createTextNode(s));
+}
+el.addedWithCssHelper=true;
+if(typeof _30==="undefined"||_30===true){
+cssHelper.parsed(function(_31){
+var o=_1d(el,s);
+for(var n in o){
+if(o.hasOwnProperty(n)){
+_2b(n,o[n]);
+}
+}
+_a("newStyleParsed",el);
+});
+}else{
+el.parsingDisallowed=true;
+}
+return el;
+},removeStyle:function(el){
+return el.parentNode.removeChild(el);
+},parsed:function(fn){
+if(_5){
+_7(fn);
+}else{
+if(typeof _4!=="undefined"){
+if(typeof fn==="function"){
+fn(_4);
+}
+}else{
+_7(fn);
+_1e();
+}
+}
+},mediaQueryLists:function(fn){
+cssHelper.parsed(function(_32){
+fn(_2a.mediaQueryLists||_2d("mediaQueryLists"));
+});
+},rules:function(fn){
+cssHelper.parsed(function(_33){
+fn(_2a.rules||_2d("rules"));
+});
+},selectors:function(fn){
+cssHelper.parsed(function(_34){
+fn(_2a.selectors||_2d("selectors"));
+});
+},declarations:function(fn){
+cssHelper.parsed(function(_35){
+fn(_2a.declarations||_2d("declarations"));
+});
+},properties:function(fn){
+cssHelper.parsed(function(_36){
+fn(_2a.properties||_2d("properties"));
+});
+},broadcast:_a,addListener:function(n,fn){
+if(typeof fn==="function"){
+if(!_9[n]){
+_9[n]={listeners:[]};
+}
+_9[n].listeners[_9[n].listeners.length]=fn;
+}
+},removeListener:function(n,fn){
+if(typeof fn==="function"&&_9[n]){
+var ls=_9[n].listeners;
+for(var i=0;i<ls.length;i++){
+if(ls[i]===fn){
+ls.splice(i,1);
+i-=1;
+}
+}
+}
+},getViewportWidth:function(){
+return _2f("Width");
+},getViewportHeight:function(){
+return _2f("Height");
+}};
+}();
+domReady(function enableCssMediaQueries(){
+var _37;
+var _38={LENGTH_UNIT:/[0-9]+(em|ex|px|in|cm|mm|pt|pc)$/,RESOLUTION_UNIT:/[0-9]+(dpi|dpcm)$/,ASPECT_RATIO:/^[0-9]+\/[0-9]+$/,ABSOLUTE_VALUE:/^[0-9]*(\.[0-9]+)*$/};
+var _39=[];
+var _3a=function(){
+var id="css3-mediaqueries-test";
+var el=document.createElement("div");
+el.id=id;
+var _3b=cssHelper.addStyle("@media all and (width) { #"+id+" { width: 1px !important; } }",false);
+document.body.appendChild(el);
+var ret=el.offsetWidth===1;
+_3b.parentNode.removeChild(_3b);
+el.parentNode.removeChild(el);
+_3a=function(){
+return ret;
+};
+return ret;
+};
+var _3c=function(){
+_37=document.createElement("div");
+_37.style.cssText="position:absolute;top:-9999em;left:-9999em;"+"margin:0;border:none;padding:0;width:1em;font-size:1em;";
+document.body.appendChild(_37);
+if(_37.offsetWidth!==16){
+_37.style.fontSize=16/_37.offsetWidth+"em";
+}
+_37.style.width="";
+};
+var _3d=function(_3e){
+_37.style.width=_3e;
+var _3f=_37.offsetWidth;
+_37.style.width="";
+return _3f;
+};
+var _40=function(_41,_42){
+var l=_41.length;
+var min=(_41.substring(0,4)==="min-");
+var max=(!min&&_41.substring(0,4)==="max-");
+if(_42!==null){
+var _43;
+var _44;
+if(_38.LENGTH_UNIT.exec(_42)){
+_43="length";
+_44=_3d(_42);
+}else{
+if(_38.RESOLUTION_UNIT.exec(_42)){
+_43="resolution";
+_44=parseInt(_42,10);
+var _45=_42.substring((_44+"").length);
+}else{
+if(_38.ASPECT_RATIO.exec(_42)){
+_43="aspect-ratio";
+_44=_42.split("/");
+}else{
+if(_38.ABSOLUTE_VALUE){
+_43="absolute";
+_44=_42;
+}else{
+_43="unknown";
+}
+}
+}
+}
+}
+var _46,_47;
+if("device-width"===_41.substring(l-12,l)){
+_46=screen.width;
+if(_42!==null){
+if(_43==="length"){
+return ((min&&_46>=_44)||(max&&_46<_44)||(!min&&!max&&_46===_44));
+}else{
+return false;
+}
+}else{
+return _46>0;
+}
+}else{
+if("device-height"===_41.substring(l-13,l)){
+_47=screen.height;
+if(_42!==null){
+if(_43==="length"){
+return ((min&&_47>=_44)||(max&&_47<_44)||(!min&&!max&&_47===_44));
+}else{
+return false;
+}
+}else{
+return _47>0;
+}
+}else{
+if("width"===_41.substring(l-5,l)){
+_46=document.documentElement.clientWidth||document.body.clientWidth;
+if(_42!==null){
+if(_43==="length"){
+return ((min&&_46>=_44)||(max&&_46<_44)||(!min&&!max&&_46===_44));
+}else{
+return false;
+}
+}else{
+return _46>0;
+}
+}else{
+if("height"===_41.substring(l-6,l)){
+_47=document.documentElement.clientHeight||document.body.clientHeight;
+if(_42!==null){
+if(_43==="length"){
+return ((min&&_47>=_44)||(max&&_47<_44)||(!min&&!max&&_47===_44));
+}else{
+return false;
+}
+}else{
+return _47>0;
+}
+}else{
+if("device-aspect-ratio"===_41.substring(l-19,l)){
+return _43==="aspect-ratio"&&screen.width*_44[1]===screen.height*_44[0];
+}else{
+if("color-index"===_41.substring(l-11,l)){
+var _48=Math.pow(2,screen.colorDepth);
+if(_42!==null){
+if(_43==="absolute"){
+return ((min&&_48>=_44)||(max&&_48<_44)||(!min&&!max&&_48===_44));
+}else{
+return false;
+}
+}else{
+return _48>0;
+}
+}else{
+if("color"===_41.substring(l-5,l)){
+var _49=screen.colorDepth;
+if(_42!==null){
+if(_43==="absolute"){
+return ((min&&_49>=_44)||(max&&_49<_44)||(!min&&!max&&_49===_44));
+}else{
+return false;
+}
+}else{
+return _49>0;
+}
+}else{
+if("resolution"===_41.substring(l-10,l)){
+var res;
+if(_45==="dpcm"){
+res=_3d("1cm");
+}else{
+res=_3d("1in");
+}
+if(_42!==null){
+if(_43==="resolution"){
+return ((min&&res>=_44)||(max&&res<_44)||(!min&&!max&&res===_44));
+}else{
+return false;
+}
+}else{
+return res>0;
+}
+}else{
+return false;
+}
+}
+}
+}
+}
+}
+}
+}
+};
+var _4a=function(mq){
+var _4b=mq.getValid();
+var _4c=mq.getExpressions();
+var l=_4c.length;
+if(l>0){
+for(var i=0;i<l&&_4b;i++){
+_4b=_40(_4c[i].mediaFeature,_4c[i].value);
+}
+var not=mq.getNot();
+return (_4b&&!not||not&&!_4b);
+}
+};
+var _4d=function(mql){
+var mqs=mql.getMediaQueries();
+var t={};
+for(var i=0;i<mqs.length;i++){
+if(_4a(mqs[i])){
+t[mqs[i].getMediaType()]=true;
+}
+}
+var s=[],c=0;
+for(var n in t){
+if(t.hasOwnProperty(n)){
+if(c>0){
+s[c++]=",";
+}
+s[c++]=n;
+}
+}
+if(s.length>0){
+_39[_39.length]=cssHelper.addStyle("@media "+s.join("")+"{"+mql.getCssText()+"}",false);
+}
+};
+var _4e=function(_4f){
+for(var i=0;i<_4f.length;i++){
+_4d(_4f[i]);
+}
+if(ua.ie){
+document.documentElement.style.display="block";
+setTimeout(function(){
+document.documentElement.style.display="";
+},0);
+setTimeout(function(){
+cssHelper.broadcast("cssMediaQueriesTested");
+},100);
+}else{
+cssHelper.broadcast("cssMediaQueriesTested");
+}
+};
+var _50=function(){
+for(var i=0;i<_39.length;i++){
+cssHelper.removeStyle(_39[i]);
+}
+_39=[];
+cssHelper.mediaQueryLists(_4e);
+};
+var _51=0;
+var _52=function(){
+var _53=cssHelper.getViewportWidth();
+var _54=cssHelper.getViewportHeight();
+if(ua.ie){
+var el=document.createElement("div");
+el.style.position="absolute";
+el.style.top="-9999em";
+el.style.overflow="scroll";
+document.body.appendChild(el);
+_51=el.offsetWidth-el.clientWidth;
+document.body.removeChild(el);
+}
+var _55;
+var _56=function(){
+var vpw=cssHelper.getViewportWidth();
+var vph=cssHelper.getViewportHeight();
+if(Math.abs(vpw-_53)>_51||Math.abs(vph-_54)>_51){
+_53=vpw;
+_54=vph;
+clearTimeout(_55);
+_55=setTimeout(function(){
+if(!_3a()){
+_50();
+}else{
+cssHelper.broadcast("cssMediaQueriesTested");
+}
+},500);
+}
+};
+window.onresize=function(){
+var x=window.onresize||function(){
+};
+return function(){
+x();
+_56();
+};
+}();
+};
+var _57=document.documentElement;
+_57.style.marginLeft="-32767px";
+setTimeout(function(){
+_57.style.marginTop="";
+},20000);
+return function(){
+if(!_3a()){
+cssHelper.addListener("newStyleParsed",function(el){
+_4e(el.cssHelperParsed.mediaQueryLists);
+});
+cssHelper.addListener("cssMediaQueriesTested",function(){
+if(ua.ie){
+_57.style.width="1px";
+}
+setTimeout(function(){
+_57.style.width="";
+_57.style.marginLeft="";
+},0);
+cssHelper.removeListener("cssMediaQueriesTested",arguments.callee);
+});
+_3c();
+_50();
+}else{
+_57.style.marginLeft="";
+}
+_52();
+};
+}());
+try{
+document.execCommand("BackgroundImageCache",false,true);
+}
+catch(e){
+}
+
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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/params.json b/params.json
new file mode 100644
index 0000000..1c6b374
--- /dev/null
+++ b/params.json
@@ -0,0 +1 @@
+{"name":"Javascript-data-structures","tagline":"A library for data structure in JavaScript","body":"[Data Structures](https://github.com/Bishop92/JavaScript-Data-Structures)\r\n=================\r\n**A library for data structures in JavaScript**\r\n\r\nDataStructures is a JavaScript library where you can find the most common data structures and also other data\r\nstructures more advanced. Various method are also provided in order to manipulate data structures.\r\n\r\nThis library implements the [iterator] (http://en.wikipedia.org/wiki/Iterator_pattern) pattern in order to hide\r\nthe data structure that work for storing your data.\r\n\r\nSupported data structures\r\n-------------------------\r\n- [Stack](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Stack.html)\r\n- [Queue](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Queue.html)\r\n- [Priority Queue](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/PriorityQueue.html)\r\n- [Circular Buffer](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/CircularBuffer.html)\r\n- [Hash Table](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/HashTable.html)\r\n- [Linked List](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/LinkedList.html)\r\n- [Double Linked List](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/DoubleLinkedList.html)\r\n- [Binary Search Tree](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/BSTree.html)\r\n- [Red-Black Tree](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/RBTree.html)\r\n- [Red-Black Tree List](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/RBTreeList.html)\r\n- [B-Tree](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/BTree.html)\r\n- [Set](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/symbols/Set.html)\r\n\r\nHow to use\r\n----------\r\n1. Download the minimized library [here](https://raw.githubusercontent.com/Bishop92/JavaScript-Data-Structures/master/DataStructuresMinimized.js) (right click and save as...);\r\n\r\n2. Include the file in your project;\r\n\r\n3. Start to use it as any other class.\r\n\r\nExample\r\n\r\n```JavaScript\r\nvar listA = new DoubleLinkedList();\r\nvar listB = new DoubleLinkedList();\r\nlistA.fromArray([0, 1]);\r\nlistB.fromArray([2, 3]);\r\nlistA.join(listB);\r\nlistA.toArray(); // [0, 1, 2, 3]\r\n```\r\n\r\nDocumentation\r\n-------------\r\nFollow this [link](https://github.com/Bishop92/JavaScript-Data-Structures/wiki) to read the full documentation.\r\nFollow this [link](https://rawgit.com/Bishop92/JavaScript-Data-Structures/master/doc/index.html) to read the JSDoc.\r\n\r\nHistory\r\n-------\r\n\r\n### Future implementations\r\n\r\n- Persistence for data structures like array and lists.\r\n\r\n### Current state of the art\r\n- v 1.0.0 First release of the library.\r\n\r\nSupport\r\n-------\r\nBattistella Stefano, [stefano.battistella.92@gmail.com](mailto:stefano.battistella.92@gmail.com)","google":"","note":"Don't delete this file! It's used internally to help with page regeneration."}
\ No newline at end of file
diff --git a/stylesheets/ie.css b/stylesheets/ie.css
new file mode 100644
index 0000000..43882f2
--- /dev/null
+++ b/stylesheets/ie.css
@@ -0,0 +1,3 @@
+nav {
+  display: none;
+}
diff --git a/stylesheets/normalize.css b/stylesheets/normalize.css
new file mode 100644
index 0000000..bc2ba93
--- /dev/null
+++ b/stylesheets/normalize.css
@@ -0,0 +1,459 @@
+/* normalize.css 2012-02-07T12:37 UTC - http://github.com/necolas/normalize.css */
+/* =============================================================================
+   HTML5 display definitions
+   ========================================================================== */
+/*
+ * Corrects block display not defined in IE6/7/8/9 & FF3
+ */
+article,
+aside,
+details,
+figcaption,
+figure,
+footer,
+header,
+hgroup,
+nav,
+section,
+summary {
+  display: block;
+}
+
+/*
+ * Corrects inline-block display not defined in IE6/7/8/9 & FF3
+ */
+audio,
+canvas,
+video {
+  display: inline-block;
+  *display: inline;
+  *zoom: 1;
+}
+
+/*
+ * Prevents modern browsers from displaying 'audio' without controls
+ */
+audio:not([controls]) {
+  display: none;
+}
+
+/*
+ * Addresses styling for 'hidden' attribute not present in IE7/8/9, FF3, S4
+ * Known issue: no IE6 support
+ */
+[hidden] {
+  display: none;
+}
+
+/* =============================================================================
+   Base
+   ========================================================================== */
+/*
+ * 1. Corrects text resizing oddly in IE6/7 when body font-size is set using em units
+ *    http://clagnut.com/blog/348/#c790
+ * 2. Prevents iOS text size adjust after orientation change, without disabling user zoom
+ *    www.456bereastreet.com/archive/201012/controlling_text_size_in_safari_for_ios_without_disabling_user_zoom/
+ */
+html {
+  font-size: 100%;
+  /* 1 */
+  -webkit-text-size-adjust: 100%;
+  /* 2 */
+  -ms-text-size-adjust: 100%;
+  /* 2 */
+}
+
+/*
+ * Addresses font-family inconsistency between 'textarea' and other form elements.
+ */
+html,
+button,
+input,
+select,
+textarea {
+  font-family: sans-serif;
+}
+
+/*
+ * Addresses margins handled incorrectly in IE6/7
+ */
+body {
+  margin: 0;
+}
+
+/* =============================================================================
+   Links
+   ========================================================================== */
+/*
+ * Addresses outline displayed oddly in Chrome
+ */
+a:focus {
+  outline: thin dotted;
+}
+
+/*
+ * Improves readability when focused and also mouse hovered in all browsers
+ * people.opera.com/patrickl/experiments/keyboard/test
+ */
+a:hover,
+a:active {
+  outline: 0;
+}
+
+/* =============================================================================
+   Typography
+   ========================================================================== */
+/*
+ * Addresses font sizes and margins set differently in IE6/7
+ * Addresses font sizes within 'section' and 'article' in FF4+, Chrome, S5
+ */
+h1 {
+  font-size: 2em;
+  margin: 0.67em 0;
+}
+
+h2 {
+  font-size: 1.5em;
+  margin: 0.83em 0;
+}
+
+h3 {
+  font-size: 1.17em;
+  margin: 1em 0;
+}
+
+h4 {
+  font-size: 1em;
+  margin: 1.33em 0;
+}
+
+h5 {
+  font-size: 0.83em;
+  margin: 1.67em 0;
+}
+
+h6 {
+  font-size: 0.75em;
+  margin: 2.33em 0;
+}
+
+/*
+ * Addresses styling not present in IE7/8/9, S5, Chrome
+ */
+abbr[title] {
+  border-bottom: 1px dotted;
+}
+
+/*
+ * Addresses style set to 'bolder' in FF3+, S4/5, Chrome
+*/
+b,
+strong {
+  font-weight: bold;
+}
+
+blockquote {
+  margin: 1em 40px;
+}
+
+/*
+ * Addresses styling not present in S5, Chrome
+ */
+dfn {
+  font-style: italic;
+}
+
+/*
+ * Addresses styling not present in IE6/7/8/9
+ */
+mark {
+  background: #ff0;
+  color: #000;
+}
+
+/*
+ * Addresses margins set differently in IE6/7
+ */
+p,
+pre {
+  margin: 1em 0;
+}
+
+/*
+ * Corrects font family set oddly in IE6, S4/5, Chrome
+ * en.wikipedia.org/wiki/User:Davidgothberg/Test59
+ */
+pre,
+code,
+kbd,
+samp {
+  font-family: monospace, serif;
+  _font-family: 'courier new', monospace;
+  font-size: 1em;
+}
+
+/*
+ * 1. Addresses CSS quotes not supported in IE6/7
+ * 2. Addresses quote property not supported in S4
+ */
+/* 1 */
+q {
+  quotes: none;
+}
+
+/* 2 */
+q:before,
+q:after {
+  content: '';
+  content: none;
+}
+
+small {
+  font-size: 75%;
+}
+
+/*
+ * Prevents sub and sup affecting line-height in all browsers
+ * gist.github.com/413930
+ */
+sub,
+sup {
+  font-size: 75%;
+  line-height: 0;
+  position: relative;
+  vertical-align: baseline;
+}
+
+sup {
+  top: -0.5em;
+}
+
+sub {
+  bottom: -0.25em;
+}
+
+/* =============================================================================
+   Lists
+   ========================================================================== */
+/*
+ * Addresses margins set differently in IE6/7
+ */
+dl,
+menu,
+ol,
+ul {
+  margin: 1em 0;
+}
+
+dd {
+  margin: 0 0 0 40px;
+}
+
+/*
+ * Addresses paddings set differently in IE6/7
+ */
+menu,
+ol,
+ul {
+  padding: 0 0 0 40px;
+}
+
+/*
+ * Corrects list images handled incorrectly in IE7
+ */
+nav ul,
+nav ol {
+  list-style: none;
+  list-style-image: none;
+}
+
+/* =============================================================================
+   Embedded content
+   ========================================================================== */
+/*
+ * 1. Removes border when inside 'a' element in IE6/7/8/9, FF3
+ * 2. Improves image quality when scaled in IE7
+ *    code.flickr.com/blog/2008/11/12/on-ui-quality-the-little-things-client-side-image-resizing/
+ */
+img {
+  border: 0;
+  /* 1 */
+  -ms-interpolation-mode: bicubic;
+  /* 2 */
+}
+
+/*
+ * Corrects overflow displayed oddly in IE9
+ */
+svg:not(:root) {
+  overflow: hidden;
+}
+
+/* =============================================================================
+   Figures
+   ========================================================================== */
+/*
+ * Addresses margin not present in IE6/7/8/9, S5, O11
+ */
+figure {
+  margin: 0;
+}
+
+/* =============================================================================
+   Forms
+   ========================================================================== */
+/*
+ * Corrects margin displayed oddly in IE6/7
+ */
+form {
+  margin: 0;
+}
+
+/*
+ * Define consistent border, margin, and padding
+ */
+fieldset {
+  border: 1px solid #c0c0c0;
+  margin: 0 2px;
+  padding: 0.35em 0.625em 0.75em;
+}
+
+/*
+ * 1. Corrects color not being inherited in IE6/7/8/9
+ * 2. Corrects text not wrapping in FF3 
+ * 3. Corrects alignment displayed oddly in IE6/7
+ */
+legend {
+  border: 0;
+  /* 1 */
+  padding: 0;
+  white-space: normal;
+  /* 2 */
+  *margin-left: -7px;
+  /* 3 */
+}
+
+/*
+ * 1. Corrects font size not being inherited in all browsers
+ * 2. Addresses margins set differently in IE6/7, FF3+, S5, Chrome
+ * 3. Improves appearance and consistency in all browsers
+ */
+button,
+input,
+select,
+textarea {
+  font-size: 100%;
+  /* 1 */
+  margin: 0;
+  /* 2 */
+  vertical-align: baseline;
+  /* 3 */
+  *vertical-align: middle;
+  /* 3 */
+}
+
+/*
+ * Addresses FF3/4 setting line-height on 'input' using !important in the UA stylesheet
+ */
+button,
+input {
+  line-height: normal;
+  /* 1 */
+}
+
+/*
+ * 1. Improves usability and consistency of cursor style between image-type 'input' and others
+ * 2. Corrects inability to style clickable 'input' types in iOS
+ * 3. Removes inner spacing in IE7 without affecting normal text inputs
+ *    Known issue: inner spacing remains in IE6
+ */
+button,
+input[type="button"],
+input[type="reset"],
+input[type="submit"] {
+  cursor: pointer;
+  /* 1 */
+  -webkit-appearance: button;
+  /* 2 */
+  *overflow: visible;
+  /* 3 */
+}
+
+/*
+ * Re-set default cursor for disabled elements
+ */
+button[disabled],
+input[disabled] {
+  cursor: default;
+}
+
+/*
+ * 1. Addresses box sizing set to content-box in IE8/9
+ * 2. Removes excess padding in IE8/9
+ * 3. Removes excess padding in IE7
+      Known issue: excess padding remains in IE6
+ */
+input[type="checkbox"],
+input[type="radio"] {
+  box-sizing: border-box;
+  /* 1 */
+  padding: 0;
+  /* 2 */
+  *height: 13px;
+  /* 3 */
+  *width: 13px;
+  /* 3 */
+}
+
+/*
+ * 1. Addresses appearance set to searchfield in S5, Chrome
+ * 2. Addresses box-sizing set to border-box in S5, Chrome (include -moz to future-proof)
+ */
+input[type="search"] {
+  -webkit-appearance: textfield;
+  /* 1 */
+  -moz-box-sizing: content-box;
+  -webkit-box-sizing: content-box;
+  /* 2 */
+  box-sizing: content-box;
+}
+
+/*
+ * Removes inner padding and search cancel button in S5, Chrome on OS X
+ */
+input[type="search"]::-webkit-search-decoration,
+input[type="search"]::-webkit-search-cancel-button {
+  -webkit-appearance: none;
+}
+
+/*
+ * Removes inner padding and border in FF3+
+ * www.sitepen.com/blog/2008/05/14/the-devils-in-the-details-fixing-dojos-toolbar-buttons/
+ */
+button::-moz-focus-inner,
+input::-moz-focus-inner {
+  border: 0;
+  padding: 0;
+}
+
+/*
+ * 1. Removes default vertical scrollbar in IE6/7/8/9
+ * 2. Improves readability and alignment in all browsers
+ */
+textarea {
+  overflow: auto;
+  /* 1 */
+  vertical-align: top;
+  /* 2 */
+}
+
+/* =============================================================================
+   Tables
+   ========================================================================== */
+/*
+ * Remove most spacing between table cells
+ */
+table {
+  border-collapse: collapse;
+  border-spacing: 0;
+}
diff --git a/stylesheets/pygment_trac.css b/stylesheets/pygment_trac.css
new file mode 100644
index 0000000..c79bef4
--- /dev/null
+++ b/stylesheets/pygment_trac.css
@@ -0,0 +1,70 @@
+.highlight .hll { background-color: #404040 }
+.highlight  { color: #d0d0d0 }
+.highlight .c { color: #999999; font-style: italic } /* Comment */
+.highlight .err { color: #a61717; background-color: #e3d2d2 } /* Error */
+.highlight .g { color: #d0d0d0 } /* Generic */
+.highlight .k { color: #6ab825; font-weight: normal } /* Keyword */
+.highlight .l { color: #d0d0d0 } /* Literal */
+.highlight .n { color: #d0d0d0 } /* Name */
+.highlight .o { color: #d0d0d0 } /* Operator */
+.highlight .x { color: #d0d0d0 } /* Other */
+.highlight .p { color: #d0d0d0 } /* Punctuation */
+.highlight .cm { color: #999999; font-style: italic } /* Comment.Multiline */
+.highlight .cp { color: #cd2828; font-weight: normal } /* Comment.Preproc */
+.highlight .c1 { color: #999999; font-style: italic } /* Comment.Single */
+.highlight .cs { color: #e50808; font-weight: normal; background-color: #520000 } /* Comment.Special */
+.highlight .gd { color: #d22323 } /* Generic.Deleted */
+.highlight .ge { color: #d0d0d0; font-style: italic } /* Generic.Emph */
+.highlight .gr { color: #d22323 } /* Generic.Error */
+.highlight .gh { color: #ffffff; font-weight: normal } /* Generic.Heading */
+.highlight .gi { color: #589819 } /* Generic.Inserted */
+.highlight .go { color: #cccccc } /* Generic.Output */
+.highlight .gp { color: #aaaaaa } /* Generic.Prompt */
+.highlight .gs { color: #d0d0d0; font-weight: normal } /* Generic.Strong */
+.highlight .gu { color: #ffffff; text-decoration: underline } /* Generic.Subheading */
+.highlight .gt { color: #d22323 } /* Generic.Traceback */
+.highlight .kc { color: #6ab825; font-weight: normal } /* Keyword.Constant */
+.highlight .kd { color: #6ab825; font-weight: normal } /* Keyword.Declaration */
+.highlight .kn { color: #6ab825; font-weight: normal } /* Keyword.Namespace */
+.highlight .kp { color: #6ab825 } /* Keyword.Pseudo */
+.highlight .kr { color: #6ab825; font-weight: normal } /* Keyword.Reserved */
+.highlight .kt { color: #6ab825; font-weight: normal } /* Keyword.Type */
+.highlight .ld { color: #d0d0d0 } /* Literal.Date */
+.highlight .m { color: #3677a9 } /* Literal.Number */
+.highlight .s { color: #9dd5f1 } /* Literal.String */
+.highlight .na { color: #bbbbbb } /* Name.Attribute */
+.highlight .nb { color: #24909d } /* Name.Builtin */
+.highlight .nc { color: #447fcf; text-decoration: underline } /* Name.Class */
+.highlight .no { color: #40ffff } /* Name.Constant */
+.highlight .nd { color: #ffa500 } /* Name.Decorator */
+.highlight .ni { color: #d0d0d0 } /* Name.Entity */
+.highlight .ne { color: #bbbbbb } /* Name.Exception */
+.highlight .nf { color: #447fcf } /* Name.Function */
+.highlight .nl { color: #d0d0d0 } /* Name.Label */
+.highlight .nn { color: #447fcf; text-decoration: underline } /* Name.Namespace */
+.highlight .nx { color: #d0d0d0 } /* Name.Other */
+.highlight .py { color: #d0d0d0 } /* Name.Property */
+.highlight .nt { color: #6ab825;} /* Name.Tag */
+.highlight .nv { color: #40ffff } /* Name.Variable */
+.highlight .ow { color: #6ab825; font-weight: normal } /* Operator.Word */
+.highlight .w { color: #666666 } /* Text.Whitespace */
+.highlight .mf { color: #3677a9 } /* Literal.Number.Float */
+.highlight .mh { color: #3677a9 } /* Literal.Number.Hex */
+.highlight .mi { color: #3677a9 } /* Literal.Number.Integer */
+.highlight .mo { color: #3677a9 } /* Literal.Number.Oct */
+.highlight .sb { color: #9dd5f1 } /* Literal.String.Backtick */
+.highlight .sc { color: #9dd5f1 } /* Literal.String.Char */
+.highlight .sd { color: #9dd5f1 } /* Literal.String.Doc */
+.highlight .s2 { color: #9dd5f1 } /* Literal.String.Double */
+.highlight .se { color: #9dd5f1 } /* Literal.String.Escape */
+.highlight .sh { color: #9dd5f1 } /* Literal.String.Heredoc */
+.highlight .si { color: #9dd5f1 } /* Literal.String.Interpol */
+.highlight .sx { color: #ffa500 } /* Literal.String.Other */
+.highlight .sr { color: #9dd5f1 } /* Literal.String.Regex */
+.highlight .s1 { color: #9dd5f1 } /* Literal.String.Single */
+.highlight .ss { color: #9dd5f1 } /* Literal.String.Symbol */
+.highlight .bp { color: #24909d } /* Name.Builtin.Pseudo */
+.highlight .vc { color: #40ffff } /* Name.Variable.Class */
+.highlight .vg { color: #40ffff } /* Name.Variable.Global */
+.highlight .vi { color: #40ffff } /* Name.Variable.Instance */
+.highlight .il { color: #3677a9 } /* Literal.Number.Integer.Long */
\ No newline at end of file
diff --git a/stylesheets/styles.css b/stylesheets/styles.css
new file mode 100644
index 0000000..e7b4ffc
--- /dev/null
+++ b/stylesheets/styles.css
@@ -0,0 +1,851 @@
+@font-face {
+  font-family: 'OpenSansLight';
+  src: url("../fonts/OpenSans-Light-webfont.eot");
+  src: url("../fonts/OpenSans-Light-webfont.eot?#iefix") format("embedded-opentype"), url("../fonts/OpenSans-Light-webfont.woff") format("woff"), url("../fonts/OpenSans-Light-webfont.ttf") format("truetype"), url("../fonts/OpenSans-Light-webfont.svg#OpenSansLight") format("svg");
+  font-weight: normal;
+  font-style: normal;
+}
+
+@font-face {
+  font-family: 'OpenSansLightItalic';
+  src: url("../fonts/OpenSans-LightItalic-webfont.eot");
+  src: url("../fonts/OpenSans-LightItalic-webfont.eot?#iefix") format("embedded-opentype"), url("../fonts/OpenSans-LightItalic-webfont.woff") format("woff"), url("../fonts/OpenSans-LightItalic-webfont.ttf") format("truetype"), url("../fonts/OpenSans-LightItalic-webfont.svg#OpenSansLightItalic") format("svg");
+  font-weight: normal;
+  font-style: normal;
+}
+
+@font-face {
+  font-family: 'OpenSansRegular';
+  src: url("../fonts/OpenSans-Regular-webfont.eot");
+  src: url("../fonts/OpenSans-Regular-webfont.eot?#iefix") format("embedded-opentype"), url("../fonts/OpenSans-Regular-webfont.woff") format("woff"), url("../fonts/OpenSans-Regular-webfont.ttf") format("truetype"), url("../fonts/OpenSans-Regular-webfont.svg#OpenSansRegular") format("svg");
+  font-weight: normal;
+  font-style: normal;
+  -webkit-font-smoothing: antialiased;
+}
+
+@font-face {
+  font-family: 'OpenSansItalic';
+  src: url("../fonts/OpenSans-Italic-webfont.eot");
+  src: url("../fonts/OpenSans-Italic-webfont.eot?#iefix") format("embedded-opentype"), url("../fonts/OpenSans-Italic-webfont.woff") format("woff"), url("../fonts/OpenSans-Italic-webfont.ttf") format("truetype"), url("../fonts/OpenSans-Italic-webfont.svg#OpenSansItalic") format("svg");
+  font-weight: normal;
+  font-style: normal;
+  -webkit-font-smoothing: antialiased;
+}
+
+@font-face {
+  font-family: 'OpenSansSemibold';
+  src: url("../fonts/OpenSans-Semibold-webfont.eot");
+  src: url("../fonts/OpenSans-Semibold-webfont.eot?#iefix") format("embedded-opentype"), url("../fonts/OpenSans-Semibold-webfont.woff") format("woff"), url("../fonts/OpenSans-Semibold-webfont.ttf") format("truetype"), url("../fonts/OpenSans-Semibold-webfont.svg#OpenSansSemibold") format("svg");
+  font-weight: normal;
+  font-style: normal;
+  -webkit-font-smoothing: antialiased;
+}
+
+@font-face {
+  font-family: 'OpenSansSemiboldItalic';
+  src: url("../fonts/OpenSans-SemiboldItalic-webfont.eot");
+  src: url("../fonts/OpenSans-SemiboldItalic-webfont.eot?#iefix") format("embedded-opentype"), url("../fonts/OpenSans-SemiboldItalic-webfont.woff") format("woff"), url("../fonts/OpenSans-SemiboldItalic-webfont.ttf") format("truetype"), url("../fonts/OpenSans-SemiboldItalic-webfont.svg#OpenSansSemiboldItalic") format("svg");
+  font-weight: normal;
+  font-style: normal;
+  -webkit-font-smoothing: antialiased;
+}
+
+@font-face {
+  font-family: 'OpenSansBold';
+  src: url("../fonts/OpenSans-Bold-webfont.eot");
+  src: url("../fonts/OpenSans-Bold-webfont.eot?#iefix") format("embedded-opentype"), url("../fonts/OpenSans-Bold-webfont.woff") format("woff"), url("../fonts/OpenSans-Bold-webfont.ttf") format("truetype"), url("../fonts/OpenSans-Bold-webfont.svg#OpenSansBold") format("svg");
+  font-weight: normal;
+  font-style: normal;
+  -webkit-font-smoothing: antialiased;
+}
+
+@font-face {
+  font-family: 'OpenSansBoldItalic';
+  src: url("../fonts/OpenSans-BoldItalic-webfont.eot");
+  src: url("../fonts/OpenSans-BoldItalic-webfont.eot?#iefix") format("embedded-opentype"), url("../fonts/OpenSans-BoldItalic-webfont.woff") format("woff"), url("../fonts/OpenSans-BoldItalic-webfont.ttf") format("truetype"), url("../fonts/OpenSans-BoldItalic-webfont.svg#OpenSansBoldItalic") format("svg");
+  font-weight: normal;
+  font-style: normal;
+  -webkit-font-smoothing: antialiased;
+}
+
+/* normalize.css 2012-02-07T12:37 UTC - http://github.com/necolas/normalize.css */
+/* =============================================================================
+   HTML5 display definitions
+   ========================================================================== */
+/*
+ * Corrects block display not defined in IE6/7/8/9 & FF3
+ */
+article,
+aside,
+details,
+figcaption,
+figure,
+footer,
+header,
+hgroup,
+nav,
+section,
+summary {
+  display: block;
+}
+
+/*
+ * Corrects inline-block display not defined in IE6/7/8/9 & FF3
+ */
+audio,
+canvas,
+video {
+  display: inline-block;
+  *display: inline;
+  *zoom: 1;
+}
+
+/*
+ * Prevents modern browsers from displaying 'audio' without controls
+ */
+audio:not([controls]) {
+  display: none;
+}
+
+/*
+ * Addresses styling for 'hidden' attribute not present in IE7/8/9, FF3, S4
+ * Known issue: no IE6 support
+ */
+[hidden] {
+  display: none;
+}
+
+/* =============================================================================
+   Base
+   ========================================================================== */
+/*
+ * 1. Corrects text resizing oddly in IE6/7 when body font-size is set using em units
+ *    http://clagnut.com/blog/348/#c790
+ * 2. Prevents iOS text size adjust after orientation change, without disabling user zoom
+ *    www.456bereastreet.com/archive/201012/controlling_text_size_in_safari_for_ios_without_disabling_user_zoom/
+ */
+html {
+  font-size: 100%;
+  /* 1 */
+  -webkit-text-size-adjust: 100%;
+  /* 2 */
+  -ms-text-size-adjust: 100%;
+  /* 2 */
+}
+
+/*
+ * Addresses font-family inconsistency between 'textarea' and other form elements.
+ */
+html,
+button,
+input,
+select,
+textarea {
+  font-family: sans-serif;
+}
+
+/*
+ * Addresses margins handled incorrectly in IE6/7
+ */
+body {
+  margin: 0;
+}
+
+/* =============================================================================
+   Links
+   ========================================================================== */
+/*
+ * Addresses outline displayed oddly in Chrome
+ */
+a:focus {
+  outline: thin dotted;
+}
+
+/*
+ * Improves readability when focused and also mouse hovered in all browsers
+ * people.opera.com/patrickl/experiments/keyboard/test
+ */
+a:hover,
+a:active {
+  outline: 0;
+}
+
+/* =============================================================================
+   Typography
+   ========================================================================== */
+/*
+ * Addresses font sizes and margins set differently in IE6/7
+ * Addresses font sizes within 'section' and 'article' in FF4+, Chrome, S5
+ */
+h1 {
+  font-size: 2em;
+  margin: 0.67em 0;
+}
+
+h2 {
+  font-size: 1.5em;
+  margin: 0.83em 0;
+}
+
+h3 {
+  font-size: 1.17em;
+  margin: 1em 0;
+}
+
+h4 {
+  font-size: 1em;
+  margin: 1.33em 0;
+}
+
+h5 {
+  font-size: 0.83em;
+  margin: 1.67em 0;
+}
+
+h6 {
+  font-size: 0.75em;
+  margin: 2.33em 0;
+}
+
+/*
+ * Addresses styling not present in IE7/8/9, S5, Chrome
+ */
+abbr[title] {
+  border-bottom: 1px dotted;
+}
+
+/*
+ * Addresses style set to 'bolder' in FF3+, S4/5, Chrome
+*/
+b,
+strong {
+  font-weight: bold;
+}
+
+blockquote {
+  margin: 1em 40px;
+}
+
+/*
+ * Addresses styling not present in S5, Chrome
+ */
+dfn {
+  font-style: italic;
+}
+
+/*
+ * Addresses styling not present in IE6/7/8/9
+ */
+mark {
+  background: #ff0;
+  color: #000;
+}
+
+/*
+ * Addresses margins set differently in IE6/7
+ */
+p,
+pre {
+  margin: 1em 0;
+}
+
+/*
+ * Corrects font family set oddly in IE6, S4/5, Chrome
+ * en.wikipedia.org/wiki/User:Davidgothberg/Test59
+ */
+pre,
+code,
+kbd,
+samp {
+  font-family: monospace, serif;
+  _font-family: 'courier new', monospace;
+  font-size: 1em;
+}
+
+/*
+ * 1. Addresses CSS quotes not supported in IE6/7
+ * 2. Addresses quote property not supported in S4
+ */
+/* 1 */
+q {
+  quotes: none;
+}
+
+/* 2 */
+q:before,
+q:after {
+  content: '';
+  content: none;
+}
+
+small {
+  font-size: 75%;
+}
+
+/*
+ * Prevents sub and sup affecting line-height in all browsers
+ * gist.github.com/413930
+ */
+sub,
+sup {
+  font-size: 75%;
+  line-height: 0;
+  position: relative;
+  vertical-align: baseline;
+}
+
+sup {
+  top: -0.5em;
+}
+
+sub {
+  bottom: -0.25em;
+}
+
+/* =============================================================================
+   Lists
+   ========================================================================== */
+/*
+ * Addresses margins set differently in IE6/7
+ */
+dl,
+menu,
+ol,
+ul {
+  margin: 1em 0;
+}
+
+dd {
+  margin: 0 0 0 40px;
+}
+
+/*
+ * Addresses paddings set differently in IE6/7
+ */
+menu,
+ol,
+ul {
+  padding: 0 0 0 40px;
+}
+
+/*
+ * Corrects list images handled incorrectly in IE7
+ */
+nav ul,
+nav ol {
+  list-style: none;
+  list-style-image: none;
+}
+
+/* =============================================================================
+   Embedded content
+   ========================================================================== */
+/*
+ * 1. Removes border when inside 'a' element in IE6/7/8/9, FF3
+ * 2. Improves image quality when scaled in IE7
+ *    code.flickr.com/blog/2008/11/12/on-ui-quality-the-little-things-client-side-image-resizing/
+ */
+img {
+  border: 0;
+  /* 1 */
+  -ms-interpolation-mode: bicubic;
+  /* 2 */
+}
+
+/*
+ * Corrects overflow displayed oddly in IE9
+ */
+svg:not(:root) {
+  overflow: hidden;
+}
+
+/* =============================================================================
+   Figures
+   ========================================================================== */
+/*
+ * Addresses margin not present in IE6/7/8/9, S5, O11
+ */
+figure {
+  margin: 0;
+}
+
+/* =============================================================================
+   Forms
+   ========================================================================== */
+/*
+ * Corrects margin displayed oddly in IE6/7
+ */
+form {
+  margin: 0;
+}
+
+/*
+ * Define consistent border, margin, and padding
+ */
+fieldset {
+  border: 1px solid #c0c0c0;
+  margin: 0 2px;
+  padding: 0.35em 0.625em 0.75em;
+}
+
+/*
+ * 1. Corrects color not being inherited in IE6/7/8/9
+ * 2. Corrects text not wrapping in FF3 
+ * 3. Corrects alignment displayed oddly in IE6/7
+ */
+legend {
+  border: 0;
+  /* 1 */
+  padding: 0;
+  white-space: normal;
+  /* 2 */
+  *margin-left: -7px;
+  /* 3 */
+}
+
+/*
+ * 1. Corrects font size not being inherited in all browsers
+ * 2. Addresses margins set differently in IE6/7, FF3+, S5, Chrome
+ * 3. Improves appearance and consistency in all browsers
+ */
+button,
+input,
+select,
+textarea {
+  font-size: 100%;
+  /* 1 */
+  margin: 0;
+  /* 2 */
+  vertical-align: baseline;
+  /* 3 */
+  *vertical-align: middle;
+  /* 3 */
+}
+
+/*
+ * Addresses FF3/4 setting line-height on 'input' using !important in the UA stylesheet
+ */
+button,
+input {
+  line-height: normal;
+  /* 1 */
+}
+
+/*
+ * 1. Improves usability and consistency of cursor style between image-type 'input' and others
+ * 2. Corrects inability to style clickable 'input' types in iOS
+ * 3. Removes inner spacing in IE7 without affecting normal text inputs
+ *    Known issue: inner spacing remains in IE6
+ */
+button,
+input[type="button"],
+input[type="reset"],
+input[type="submit"] {
+  cursor: pointer;
+  /* 1 */
+  -webkit-appearance: button;
+  /* 2 */
+  *overflow: visible;
+  /* 3 */
+}
+
+/*
+ * Re-set default cursor for disabled elements
+ */
+button[disabled],
+input[disabled] {
+  cursor: default;
+}
+
+/*
+ * 1. Addresses box sizing set to content-box in IE8/9
+ * 2. Removes excess padding in IE8/9
+ * 3. Removes excess padding in IE7
+      Known issue: excess padding remains in IE6
+ */
+input[type="checkbox"],
+input[type="radio"] {
+  box-sizing: border-box;
+  /* 1 */
+  padding: 0;
+  /* 2 */
+  *height: 13px;
+  /* 3 */
+  *width: 13px;
+  /* 3 */
+}
+
+/*
+ * 1. Addresses appearance set to searchfield in S5, Chrome
+ * 2. Addresses box-sizing set to border-box in S5, Chrome (include -moz to future-proof)
+ */
+input[type="search"] {
+  -webkit-appearance: textfield;
+  /* 1 */
+  -moz-box-sizing: content-box;
+  -webkit-box-sizing: content-box;
+  /* 2 */
+  box-sizing: content-box;
+}
+
+/*
+ * Removes inner padding and search cancel button in S5, Chrome on OS X
+ */
+input[type="search"]::-webkit-search-decoration,
+input[type="search"]::-webkit-search-cancel-button {
+  -webkit-appearance: none;
+}
+
+/*
+ * Removes inner padding and border in FF3+
+ * www.sitepen.com/blog/2008/05/14/the-devils-in-the-details-fixing-dojos-toolbar-buttons/
+ */
+button::-moz-focus-inner,
+input::-moz-focus-inner {
+  border: 0;
+  padding: 0;
+}
+
+/*
+ * 1. Removes default vertical scrollbar in IE6/7/8/9
+ * 2. Improves readability and alignment in all browsers
+ */
+textarea {
+  overflow: auto;
+  /* 1 */
+  vertical-align: top;
+  /* 2 */
+}
+
+/* =============================================================================
+   Tables
+   ========================================================================== */
+/*
+ * Remove most spacing between table cells
+ */
+table {
+  border-collapse: collapse;
+  border-spacing: 0;
+}
+
+body {
+  padding: 0px 0 20px 0px;
+  margin: 0px;
+  font: 14px/1.5 "OpenSansRegular", "Helvetica Neue", Helvetica, Arial, sans-serif;
+  color: #f0e7d5;
+  font-weight: normal;
+  background: #252525;
+  background-attachment: fixed !important;
+  background: -webkit-gradient(linear, 50% 0%, 50% 100%, color-stop(0%, #2a2a29), color-stop(100%, #1c1c1c));
+  background: -webkit-linear-gradient(#2a2a29, #1c1c1c);
+  background: -moz-linear-gradient(#2a2a29, #1c1c1c);
+  background: -o-linear-gradient(#2a2a29, #1c1c1c);
+  background: -ms-linear-gradient(#2a2a29, #1c1c1c);
+  background: linear-gradient(#2a2a29, #1c1c1c);
+}
+
+h1, h2, h3, h4, h5, h6 {
+  color: #e8e8e8;
+  margin: 0 0 10px;
+  font-family: 'OpenSansRegular', "Helvetica Neue", Helvetica, Arial, sans-serif;
+  font-weight: normal;
+}
+
+p, ul, ol, table, pre, dl {
+  margin: 0 0 20px;
+}
+
+h1, h2, h3 {
+  line-height: 1.1;
+}
+
+h1 {
+  font-size: 28px;
+}
+
+h2 {
+  font-size: 24px;
+}
+
+h4, h5, h6 {
+  color: #e8e8e8;
+}
+
+h3 {
+  font-size: 18px;
+  line-height: 24px;
+  font-family: 'OpenSansRegular', "Helvetica Neue", Helvetica, Arial, sans-serif !important;
+  font-weight: normal;
+  color: #b6b6b6;
+}
+
+a {
+  color: #ffcc00;
+  font-weight: 400;
+  text-decoration: none;
+}
+a:hover {
+  color: #ffeb9b;
+}
+
+a small {
+  font-size: 11px;
+  color: #666;
+  margin-top: -0.6em;
+  display: block;
+}
+
+ul {
+  list-style-image: url("../images/bullet.png");
+}
+
+strong {
+  font-family: 'OpenSansBold', "Helvetica Neue", Helvetica, Arial, sans-serif !important;
+  font-weight: normal;
+}
+
+.wrapper {
+  max-width: 650px;
+  margin: 0 auto;
+  position: relative;
+  padding: 0 20px;
+}
+
+section img {
+  max-width: 100%;
+}
+
+blockquote {
+  border-left: 3px solid #ffcc00;
+  margin: 0;
+  padding: 0 0 0 20px;
+  font-style: italic;
+}
+
+code {
+  font-family: "Lucida Sans", Monaco, Bitstream Vera Sans Mono, Lucida Console, Terminal;
+  color: #efefef;
+  font-size: 13px;
+  margin: 0 4px;
+  padding: 4px 6px;
+  -moz-border-radius: 2px;
+  -webkit-border-radius: 2px;
+  -o-border-radius: 2px;
+  -ms-border-radius: 2px;
+  -khtml-border-radius: 2px;
+  border-radius: 2px;
+}
+
+pre {
+  padding: 8px 15px;
+  background: #191919;
+  -moz-border-radius: 2px;
+  -webkit-border-radius: 2px;
+  -o-border-radius: 2px;
+  -ms-border-radius: 2px;
+  -khtml-border-radius: 2px;
+  border-radius: 2px;
+  border: 1px solid #121212;
+  -moz-box-shadow: inset 0 1px 3px rgba(0, 0, 0, 0.3);
+  -webkit-box-shadow: inset 0 1px 3px rgba(0, 0, 0, 0.3);
+  -o-box-shadow: inset 0 1px 3px rgba(0, 0, 0, 0.3);
+  box-shadow: inset 0 1px 3px rgba(0, 0, 0, 0.3);
+  overflow: auto;
+  overflow-y: hidden;
+}
+pre code {
+  color: #efefef;
+  text-shadow: 0px 1px 0px #000;
+  margin: 0;
+  padding: 0;
+}
+
+table {
+  width: 100%;
+  border-collapse: collapse;
+}
+
+th {
+  text-align: left;
+  padding: 5px 10px;
+  border-bottom: 1px solid #434343;
+  color: #b6b6b6;
+  font-family: 'OpenSansSemibold', "Helvetica Neue", Helvetica, Arial, sans-serif !important;
+  font-weight: normal;
+}
+
+td {
+  text-align: left;
+  padding: 5px 10px;
+  border-bottom: 1px solid #434343;
+}
+
+hr {
+  border: 0;
+  outline: none;
+  height: 3px;
+  background: transparent url("../images/hr.gif") center center repeat-x;
+  margin: 0 0 20px;
+}
+
+dt {
+  color: #F0E7D5;
+  font-family: 'OpenSansSemibold', "Helvetica Neue", Helvetica, Arial, sans-serif !important;
+  font-weight: normal;
+}
+
+#header {
+  z-index: 100;
+  left: 0;
+  top: 0px;
+  height: 60px;
+  width: 100%;
+  position: fixed;
+  background: url(../images/nav-bg.gif) #353535;
+  border-bottom: 4px solid #434343;
+  -moz-box-shadow: 0px 1px 3px rgba(0, 0, 0, 0.25);
+  -webkit-box-shadow: 0px 1px 3px rgba(0, 0, 0, 0.25);
+  -o-box-shadow: 0px 1px 3px rgba(0, 0, 0, 0.25);
+  box-shadow: 0px 1px 3px rgba(0, 0, 0, 0.25);
+}
+#header nav {
+  max-width: 650px;
+  margin: 0 auto;
+  padding: 0 10px;
+  background: blue;
+  margin: 6px auto;
+}
+#header nav li {
+  font-family: 'OpenSansLight', "Helvetica Neue", Helvetica, Arial, sans-serif;
+  font-weight: normal;
+  list-style: none;
+  display: inline;
+  color: white;
+  line-height: 50px;
+  text-shadow: 0px 1px 0px rgba(0, 0, 0, 0.2);
+  font-size: 14px;
+}
+#header nav li a {
+  color: white;
+  border: 1px solid #5d910b;
+  background: -webkit-gradient(linear, 50% 0%, 50% 100%, color-stop(0%, #93bd20), color-stop(100%, #659e10));
+  background: -webkit-linear-gradient(#93bd20, #659e10);
+  background: -moz-linear-gradient(#93bd20, #659e10);
+  background: -o-linear-gradient(#93bd20, #659e10);
+  background: -ms-linear-gradient(#93bd20, #659e10);
+  background: linear-gradient(#93bd20, #659e10);
+  -moz-border-radius: 2px;
+  -webkit-border-radius: 2px;
+  -o-border-radius: 2px;
+  -ms-border-radius: 2px;
+  -khtml-border-radius: 2px;
+  border-radius: 2px;
+  -moz-box-shadow: inset 0px 1px 0px rgba(255, 255, 255, 0.3), 0px 3px 7px rgba(0, 0, 0, 0.7);
+  -webkit-box-shadow: inset 0px 1px 0px rgba(255, 255, 255, 0.3), 0px 3px 7px rgba(0, 0, 0, 0.7);
+  -o-box-shadow: inset 0px 1px 0px rgba(255, 255, 255, 0.3), 0px 3px 7px rgba(0, 0, 0, 0.7);
+  box-shadow: inset 0px 1px 0px rgba(255, 255, 255, 0.3), 0px 3px 7px rgba(0, 0, 0, 0.7);
+  background-color: #93bd20;
+  padding: 10px 12px;
+  margin-top: 6px;
+  line-height: 14px;
+  font-size: 14px;
+  display: inline-block;
+  text-align: center;
+}
+#header nav li a:hover {
+  background: -webkit-gradient(linear, 50% 0%, 50% 100%, color-stop(0%, #749619), color-stop(100%, #527f0e));
+  background: -webkit-linear-gradient(#749619, #527f0e);
+  background: -moz-linear-gradient(#749619, #527f0e);
+  background: -o-linear-gradient(#749619, #527f0e);
+  background: -ms-linear-gradient(#749619, #527f0e);
+  background: linear-gradient(#749619, #527f0e);
+  background-color: #659e10;
+  border: 1px solid #527f0e;
+  -moz-box-shadow: inset 0px 1px 1px rgba(0, 0, 0, 0.2), 0px 1px 0px rgba(0, 0, 0, 0);
+  -webkit-box-shadow: inset 0px 1px 1px rgba(0, 0, 0, 0.2), 0px 1px 0px rgba(0, 0, 0, 0);
+  -o-box-shadow: inset 0px 1px 1px rgba(0, 0, 0, 0.2), 0px 1px 0px rgba(0, 0, 0, 0);
+  box-shadow: inset 0px 1px 1px rgba(0, 0, 0, 0.2), 0px 1px 0px rgba(0, 0, 0, 0);
+}
+#header nav li.fork {
+  float: left;
+  margin-left: 0px;
+}
+#header nav li.downloads {
+  float: right;
+  margin-left: 6px;
+}
+#header nav li.title {
+  float: right;
+  margin-right: 10px;
+  font-size: 11px;
+}
+
+section {
+  max-width: 650px;
+  padding: 30px 0px 50px 0px;
+  margin: 20px 0;
+  margin-top: 70px;
+}
+section #title {
+  border: 0;
+  outline: none;
+  margin: 0 0 50px 0;
+  padding: 0 0 5px 0;
+}
+section #title h1 {
+  font-family: 'OpenSansLight', "Helvetica Neue", Helvetica, Arial, sans-serif;
+  font-weight: normal;
+  font-size: 40px;
+  text-align: center;
+  line-height: 36px;
+}
+section #title p {
+  color: #d7cfbe;
+  font-family: 'OpenSansLight', "Helvetica Neue", Helvetica, Arial, sans-serif;
+  font-weight: normal;
+  font-size: 18px;
+  text-align: center;
+}
+section #title .credits {
+  font-size: 11px;
+  font-family: 'OpenSansRegular', "Helvetica Neue", Helvetica, Arial, sans-serif;
+  font-weight: normal;
+  color: #696969;
+  margin-top: -10px;
+}
+section #title .credits.left {
+  float: left;
+}
+section #title .credits.right {
+  float: right;
+}
+
+@media print, screen and (max-width: 720px) {
+  #title .credits {
+    display: block;
+    width: 100%;
+    line-height: 30px;
+    text-align: center;
+  }
+  #title .credits .left {
+    float: none;
+    display: block;
+  }
+  #title .credits .right {
+    float: none;
+    display: block;
+  }
+}
+@media print, screen and (max-width: 480px) {
+  #header {
+    margin-top: -20px;
+  }
+
+  section {
+    margin-top: 40px;
+  }
+
+  nav {
+    display: none;
+  }
+}