Added methods filter, fromArray and toArray

Bishop92 · Bishop92 · commit b972664080d2 · 2014-04-04T19:46:07.000+02:00
diff --git a/LinkedList/LinkedList.js b/LinkedList/LinkedList.js
@@ -4,13 +4,13 @@
 
 /**
  * The single node of the list.
- * @param item The item to store in the node.
+ * @param item {*} The item to store in the node.
  * @constructor
  */
 function Node(item) {
 	/**
 	 * The item stored.
-	 * @type {Object}
+	 * @type {*}
 	 */
 	this.item = item;
 	/**
@@ -20,6 +20,9 @@ function Node(item) {
 	this.next = null;
 }
 
+LinkedList.prototype = new Aggregate();
+LinkedList.prototype.constructor = LinkedList;
+
 /**
  * Class for managing a linked list.
  * @constructor
@@ -42,9 +45,16 @@ function LinkedList() {
 	this.length = 0;
 }
 
+/**
+ * @inheritDoc
+ */
+LinkedList.prototype.getIterator = function () {
+	return new LinkedListIterator(this);
+};
+
 /**
  * Add an item at the head of the list.
- * @param item The item to add.
+ * @param item {*} The item to add.
  * @return {void}
  */
 LinkedList.prototype.pushFront = function (item) {
@@ -58,12 +68,12 @@ LinkedList.prototype.pushFront = function (item) {
 
 /**
  * Add an item at the tail of the list.
- * @param item The item to add.
+ * @param item {*} The item to add.
  * @return {void}
  */
 LinkedList.prototype.pushBack = function (item) {
 	var node = new Node(item);
-	if(this.last)
+	if (this.last)
 		this.last.next = node;
 	else
 		this.first = node;
@@ -73,10 +83,10 @@ LinkedList.prototype.pushBack = function (item) {
 
 /**
  * Remove the first element of the list.
- * @return {Object|undefined} The element removed. It's undefined if the list is empty.
+ * @return {*} The element removed. It's undefined if the list is empty.
  */
-LinkedList.prototype.popFront = function() {
-	if(this.length) {
+LinkedList.prototype.popFront = function () {
+	if (this.length) {
 		var node = this.first;
 		this.first = this.first.next;
 		this.length--;
@@ -88,16 +98,16 @@ LinkedList.prototype.popFront = function() {
 
 /**
  * Remove the last element of the list.
- * @return {Object|undefined} The element removed. It's undefined if the list is empty.
+ * @return {*} The element removed. It's undefined if the list is empty.
  */
-LinkedList.prototype.popBack = function() {
-	if(this.length) {
+LinkedList.prototype.popBack = function () {
+	if (this.length) {
 		var node = this.last;
 		var next = this.first;
-		while(next.next && next.next.next) {
+		while (next.next && next.next.next) {
 			next = next.next;
 		}
-		if(node === next)
+		if (node === next)
 			this.last = null;
 		else
 			this.last = next;
@@ -110,40 +120,82 @@ LinkedList.prototype.popBack = function() {
 
 /**
  * Remove the item at the position index.
- * @param index The position of the item to remove.
- * @return {Object|undefined}
+ * @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)
+LinkedList.prototype.removeAt = function (index) {
+	if (index < 0 || index > this.length - 1)
 		return undefined;
-	if(index === 0)
+	if (index === 0)
 		return this.popFront();
-	if(index === this.length - 1)
+	if (index === this.length - 1)
 		return this.popBack();
 	var node = this.first;
-	for( ; index > 1; index--)
+	for (; index > 1; index--)
 		node = node.next;
 	//now node is the node before the node to remove
 	//node to remove
 	var next = node.next;
-	if(next === this.last)
+	if (next === this.last)
 		this.last = node;
-	//noinspection JSPrimitiveTypeWrapperUsage
+
 	node.next = next.next;
 	this.length--;
 	return next.item;
 };
 
 /**
  * Get the item at the position index.
- * @param index The position of the item.
- * @return {Object|undefined}. It's undefined if index isn't in the queue bounds.
+ * @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 queue bounds.
  */
-LinkedList.prototype.getItem = function(index) {
-	if(index < 0 || index > this.length)
+LinkedList.prototype.getItem = function (index) {
+	if (index < 0 || index > this.length - 1)
 		return undefined;
 	var node = this.first;
-	for( ; index > 0; index--)
+	for (; index > 0; index--)
 		node = node.next;
 	return node.item;
+};
+
+/**
+ * Transform 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;
+};
+
+/**
+ * Build 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();
+};
+
+/**
+ * Return 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;
 };
