Doubly Linked List
This package is a javascript implementation of Doubly Linked List.
API
List
list#insert(item)
- Insert to list.list#insertBeginning(item)
- Insert at beginning of list.list#insertEnd(item)
- Insert at end of list.list#insertBefore(node, item)
- Insert before node.list#insertAfter(node, item)
- Insert after node.list#remove(node)
- Remove node.list#removeByItem(item)
- Remove node by item.list#removeByIndex(index)
- Remove node by index.list#removeFirst()
- Remove first node.list#removeLast()
- Remove last node.list#getByItem(item)
- Get node by item.list#getByIndex(item)
- Get node by index.list#getFirst()
- Get first node in list.list#getLast()
- Get last node in list.list#has(item)
- Determine whether item exists in list.list#iterator()
- Return an iterator over list nodes.list#reverseIterator()
- Return an iterator over list items in reverse order.list#itemsIterator()
- Return an iterator over list items.list#itemsReverseIterator()
- Return an iterator over list items in reverse order.list#length()
- Return number of nodes.
Node
node#setNext(node)
- Set next node.node#getNext()
- Get next node.node#setPrev(node)
- Set previous node.node#getPrev()
- Get previous node.node#setItem(item)
- Set item.node#getItem()
- Get item.
Installation
npm i -S dl-list
Example
const DoubyLinkedList = ; const list = ; list;list;list;list;list; for const node of list console; list;list;list;list; for const node of list console; console;