JavaScript Doubly Linked List Class
by Nicholas C. Zakas
If you find this useful, please consider supporting my work with a donation.
Overview
A JavaScript implementation of a doubly linked list. This class uses the conventions of built-in JavaScript collection objects, such as:
- There is a
[Symbol.iterator]
method so each instance is iterable. - The
size
getter property instead of a length
data property to indicate that the size of the list is dynamically counted rather than stored. - Defining a
values()
generator method. - Defining a
find()
method for searching the list to return data. - Defining a
findIndex()
method for searching the list to return an index. - Returning
undefined
from get()
when no such index exists.
Read the blog post about the design of this class.
Usage
Use CommonJS to get access to the DoublyLinkedList
constructor:
const { DoublyLinkedList } = require("@humanwhocodes/doubly-linked-list");
Each instance of DoublyLinkedList
has the following properties and methods:
const list = new DoublyLinkedList();
list.add("foo");
list.insertBefore("bar", 0);
list.insertAfter("baz", 1);
let value = list.get(0);
let count = list.size;
let index = list.indexOf("foo");
let result = list.find(value => value.length > 3);
let foundIndex = list.findIndex(value => value.length > 3);
let array1 = [...list.values()];
let array2 = [...list];
let array3 = [...list.reverse()];
let data = list.remove(0);
list.clear();
Note on Code Style
You may find the code style of this module to be overly verbose with a lot of comments. That is intentional, as the primary use of this module is intended to be for educational purposes. There are frequently more concise ways of implementing the details of this class, but the more concise ways are difficult for newcomers who are unfamiliar with linked lists as a concept or JavaScript as a whole.
Issues and Pull Requests
As this is part of series of tutorials I'm writing, only bug fixes will be accepted. No new functionality will be added to this module.
License
MIT