Merge pull request #31 from tusharmath/linkedlist-extensions

refactor(linkedlist): add forEach helper function

Author: tusharmath

src/lib/LinkedList.ts

@@ -43,6 +43,14 @@ export class LinkedList<T> {
     return node
   }
 
+  forEach (f: ((value: T) => void)) {
+    var node = this.__head
+    while (node) {
+      f(node.value)
+      node = node.left
+    }
+  }
+
   remove (n: Node<T>) {
     if (n.left && n.right) {
       n.left.right = n.right

test/test.LinkedList.ts

@@ -1,8 +1,6 @@
 /**
  * Created by tushar.mathur on 09/10/16.
  */
-
-
 import test from 'ava'
 import {LinkedList} from '../src/lib/LinkedList'
 
@@ -70,3 +68,14 @@ test('remove(): Remove LAST', t => {
   t.deepEqual(toArray(q), [])
   t.is(q.length, 0)
 })
+
+test('forEach()', t => {
+  const results: number[] = []
+  const q = LinkedList.of<number>()
+  q.add(1)
+  q.add(2)
+  q.add(3)
+  q.add(4)
+  q.forEach(i => results.push(i * 100))
+  t.deepEqual(results, [400, 300, 200, 100])
+})