AbstractThe type of the nodes in the list.
Abstract[iterator]Returns an iterator for traversing the list. Supports both forward and reverse traversal.
If true, the iterator will traverse the list in reverse order.
An iterator yielding nodes in the specified orders.
AbstractclearResets the list to its initial empty state.
AbstractnodeRetrieves the node at the specified index.
The zero-based index of the node to retrieve.
The node at the specified index, or undefined if the index is out of bounds.
AbstractpopRemoves and returns the last list node.
The removed node, or undefined if the list is empty.
AbstractpushAbstractshiftRemoves and returns the first list node.
The removed node, or undefined if the list is empty.
Abstractunshift
Core abstract base class for all linked list implementations.
Defines the fundamental contract that all linked lists must fulfill, providing a unified interface for basic list operations.
Example