refactor: use LinkedList

Since the code is only adding elements to the end of the list and removing elements from the start of the list, that can be handled using a simple linked list.

Author: Kikobeats

src/create.js

@@ -6,14 +6,13 @@ class Node {
   }
 }
 
-class DoublyLinkedList {
+class LinkedList {
   enqueue (data) {
     const node = new Node(data)
     if (!this.head) {
       this.head = node
       this.tail = node
     } else {
-      node.prev = this.tail
       this.tail.next = node
       this.tail = node
     }
@@ -23,14 +22,13 @@ class DoublyLinkedList {
     if (!this.head) return
     const data = this.head.data
     this.head = this.head.next
-    if (this.head) this.head.prev = undefined
-    else this.tail = undefined
+    if (!this.head) this.tail = undefined
     return data
   }
 }
 
 module.exports = (slots = 1) => {
-  const queue = new DoublyLinkedList()
+  const queue = new LinkedList()
 
   const release = () => {
     ++slots