refactored from ES6 classes to factory function to Linked Lists types Data Strucutre

Author: crizstian

06-chapter-Linked-Lists-types/linked.proto.module.js

@@ -19,7 +19,7 @@
   const linked = (type) => {
 
     const link = {}
-    // private variables
+    // common private variables linked lists data structures
     let head = null
     let current = null
     let length = 0
@@ -82,21 +82,12 @@
       return false
     }
 
+    // functions for linked list
     const add = (data) => {
       let args = (!head && !current) ? [setHead] : [setNext(current)]
       compose(...args, setCurrent, setLength)(node(data))
     }
 
-    const add2 = (data) => {
-      let args = (!head && !current) ? [setHead] : [setNext(current), setPrev(current)]
-      compose(...args, setCurrent, setLength)(node(data))
-    }
-
-    const add3 = (data) => {
-      let args = (!head && !current) ? [setHead2] : [setNext2(current), setPrev2(current)]
-      compose(...args, setCurrent, setLength)(node(data))
-    }
-
     const remove = (data) => {
       let prev = findPrev(data)
       if (!(prev.next === null)) {
@@ -105,6 +96,22 @@
       setLength(false)
     }
 
+    const display = () => {
+      let c = head
+      let show = ''
+      while (!(c === null)) {
+        show += `${c.data} ${(c.next !== null) ? ' ->' : ''} `
+        c = c.next
+      }
+      return show
+    }
+
+    // functions for double linked list
+    const add2 = (data) => {
+      let args = (!head && !current) ? [setHead] : [setNext(current), setPrev(current)]
+      compose(...args, setCurrent, setLength)(node(data))
+    }
+
     const remove2 = (data) => {
       let prev = findPrev(data)
       if (!(prev.next === null)) {
@@ -113,6 +120,12 @@
       setLength(false)
     }
 
+    // functions for cirle linked list
+    const add3 = (data) => {
+      let args = (!head && !current) ? [setHead2] : [setNext2(current), setPrev2(current)]
+      compose(...args, setCurrent, setLength)(node(data))
+    }
+
     const remove3 = (data) => {
       let prev = findPrev(data)
       if (!(prev.next === null)) {
@@ -121,27 +134,6 @@
       setLength(false)
     }
 
-    link.contains = (data) => {
-      let c = head
-      while (!(c === null)) {
-        if (c.data === data) {
-          return true
-        }
-        c = c.next
-      }
-      return false
-    }
-
-    const display = () => {
-      let c = head
-      let show = ''
-      while (!(c === null)) {
-        show += `${c.data} ${(c.next !== null) ? ' ->' : ''} `
-        c = c.next
-      }
-      return show
-    }
-
     const display2 = () => {
       let c = head
       let show = `${c.data} -> `
@@ -152,6 +144,17 @@
       return show
     }
 
+    // Common functions for linked list's
+    link.contains = (data) => {
+      let c = head
+      while (!(c === null)) {
+        if (c.data === data) {
+          return true
+        }
+        c = c.next
+      }
+      return false
+    }
     link.getCurrent = () => current
     link.getList = () => head
     link.size = () => length

06-chapter-Linked-Lists-types/readme.md

@@ -2,9 +2,7 @@
 
 ### Code Examples
 
-- [Linked List Data Structure]('./linked-list.module')
-- [Double Linked List Data Structure]('./double-linked-list.module')
-- [Circular Linked List Data Structure]('./circular-linked-list.module')
+- [Single, Double, Circular, Linked List, Data Structure]('./linked.proto.module')
 - [Import complete module]('./index')
 
 ### Definition Linked List
@@ -15,11 +13,8 @@ common operations you can perform on linked list:
 
 **Additions**
 - `add`: grow the list by adding items to the end of the list.
-- `addHead`: Similar to our add method above, we always know the position of the head, so no iteration necessary.
-- `insertAfter`: have to iterate over the entire list to find the target node that your value should be inserted after.
 **Removals**
 - `remove`: will always remove from a given position in the list.
-
 **Search**
 - `contains`: will search the list for a value.
 
@@ -39,18 +34,12 @@ common operations you can perform on linked list:
 
 **Additions**
 - `add`: grow the list by adding items to the end of the list.
-- `addHead`: Similar to our add method above, we always know the position of the head, so no iteration necessary.
-- `insertAfter`: ave to iterate over the entire list to find the target node that your value should be inserted after.
-- `insertLast`: adds an element at the end of the list.
 **Removals**
 - `remove`: will always remove from a given position in the list.
-- `removeLast`: deletes an element from the end of the list.
 **Search**
 - `contains`: will search the list for a value.
 **Display**
 - `display`: displays the complete list in a forward manner.
-- `displayReverse`: displays the complete list in a backward manner.
-
 
 ### Definition Circular Linked List