open-index/open-npm huggingface dataset:
npm package: @humanwhocodes/doubly-linked-list
Description: A doubly linked list implementation in JavaScript
Author: Nicholas C. Zakas
Latest version: 2.2.0

# JavaScript Doubly Linked List Class

by [Nicholas C. Zakas](https://humanwhocodes.com)

If you find this useful, please consider supporting my work with a [donation](https://humanwhocodes.com/donate).

## Overview

A JavaScript implementation of a doubly linked list. This class uses the conventions of built-in JavaScript collection objects, such as:

1. There is a `[Symbol.iterator]` method so each instance is iterable.
1. The `size` getter property instead of a `length` data property to indicate that the size of the list is dynamically counted rather than stored.
1. Defining a `values()` generator method.
1. Defining a `find()` method for searching the list to return data.
1. Defining a `findIndex()` method for searching the list to return an index.
1. Returning `undefined` from `get()` when no such index exists.

Read the [blog post](https://humanwhocodes.com/blog/2019/02/computer-science-in-javascript-doubly-linked-lists/) about the design of this class.

## Usage

Use CommonJS to get access to the `DoublyLinkedList` constructor:

```js
const { DoublyLinkedList } = require("@humanwhocodes/doubly-linked-list");
```

Each instance of `DoublyLinkedList` has the following properties and methods:

```js
const list = new DoublyLinkedList();

// add an item to the end
list.add("foo");

// insert an item
list.insertBefore("bar", 0);
list.insertAfter("baz", 1);

// get the value at an index
let value = list.get(0);

// get the number of items
let count = list.size;

// get the index of a value
let index = list.indexOf("foo");

// search for a value
let result = list.find(value => value.length > 3);
let foundIndex = list.findIndex(value => value.length > 3);

// convert to an array using iterators
let array1 = [...list.values()];
let array2 = [...list];

// convert to an array in reverse order using an iterator
let array3 = [...list.reverse()];

// remove an item at the given index and return the data that was removed
let data = list.remove(0);

// remove all items
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