This is a Javascipt implementation of a doubly linked list.

I needed a doubly linked list for a project I was doing, and thought I would post the code here in case it was useful for anyone else.

Works in both the browser and node.js.

node.js.

var DLL = require('doubly-linked-list.js');
var list = new DLL.DoublyLinkedList();

list.append('data1');
node = list.append('data2');
list.append('data3');

size = list.size; // 3
node.prev.data; // data1
node.next.data; // data3

node = list.item(1);
data = node.data; // data2
prev = node.prev; // data1
next = node.next; // data3

node = list.head();
data = node.data; // data1

node = list.tail();
data = node.data; // data3

list.prepend('data4');

size = list.size; // 4

node = list.head();
data = node.data; // data4
prev = node.prev; // null
next = node.next; // data1

Browser.

<script src="doubly-linked-list.js"></script>
<script>
    var list = new DLL.DoublyLinkedList();
    // as above
</script>

Creates a new DoublyLinkedList. Takes no arguments.

Appends a node to the end of the list. Returns the node.

See item(index) for notes on the structure of the node returned.

Prepends a node to the end of the list. Returns the node.

See item(index) for notes on the structure of the node returned.

Returns the node at the specified index. The index starts at 0.

Note: When the node is returned, it looks like this:

{
    // pointers to the previous and next nodes
    prev: node,
    next: node,
    // your data
    data: data
}

This allows you to easily walk the list.

Returns the node at the head of the list. See item(index) for notes on the structure of the node returned.

Returns the node at the tail of the list. See item(index) for notes on the structure of the node returned.

Returns the size of the list.

Removes the item at the index.

Note: Not currently implemented. Patches (with tests) welcome.

https://github.com/playcraft/gamecore.js/blob/master/src/linkedlist.js