A circular linked list, quickly whipped up based on the implementation in jcoglan's article.
Useful in place of an array when you don't need indexing but you do need to be able add/remove elements really quickly.
npm install circular-list
The linked list class definition.
Creates a new linked list, which you can add/remove nodes from.
Nodes are used to represent an item in the list. These are just wrappers so
you don't have to modify the original object. They contain first
and last
properties so that they can be traversed, and a data
property which contains
the original value passed to the node.
Appends a node to the end of a list.
Inserts the after
node after before
in the list.
Removes a node from the list.
Iterates over the list, calling iterator(node.data)
for each node.