/** * Represents a doubly linked list. */ export declare class LinkedList implements Iterable { private _head?; private _tail?; private _length; static of(...items: T[]): LinkedList; static from(iterable: Iterable): LinkedList; addFirst(value: T): LinkedListNode; addFirstNode(node: LinkedListNode): void; addLast(value: T): LinkedListNode; addLastNode(node: LinkedListNode): void; insertBefore(targetNode: LinkedListNode, value: T): LinkedListNode; insertBeforeNode(targetNode: LinkedListNode, newNode: LinkedListNode): void; insertAfter(targetNode: LinkedListNode, value: T): LinkedListNode; insertAfterNode(targetNode: LinkedListNode, newNode: LinkedListNode): void; private _checkAttachedNode; private _checkNewNode; private _insertEmpty; private _insertBefore; private _insertAfter; delete(value: T): boolean; removeNode(node: LinkedListNode): void; removeFirst(): boolean; removeLast(): boolean; clear(): void; private _remove; get firstNode(): LinkedListNode | undefined; get lastNode(): LinkedListNode | undefined; get length(): number; find(value: T): LinkedListNode | undefined; findLast(value: T): LinkedListNode | undefined; includes(value: T): boolean; nodes(): Iterator, void, unknown>; [Symbol.iterator](): Iterator; } export declare class LinkedListNode { value: T; constructor(value: T); get list(): LinkedList | undefined; get prev(): LinkedListNode | undefined; get next(): LinkedListNode | undefined; } //# sourceMappingURL=linkedList.d.ts.map