import { Box } from "./box";
/** Doubly Linked List */
export declare class Linked<T> implements Iterable<T> {
    /** Create linked list from iterator  */
    static from<T>(iter: Iterable<T>): Linked<T>;
    /** Create linked list from params  */
    static of<T>(...items: T[]): Linked<T>;
    /** The first node of the linked list
     * unsafe field */
    head?: LinkedNode<T>;
    /** The last node of the linked list
    * unsafe field */
    last?: LinkedNode<T>;
    /** Check if the linked list is empty  */
    get isEmpty(): boolean;
    /** Check if there is only one item in the linked list  */
    get onlyOne(): boolean;
    /** Get the length of the linked list  */
    get size(): number;
    /** Get the length of the linked list  */
    get length(): number;
    /** Get an iterator to traverse the list items  */
    [Symbol.iterator](): Iterator<T>;
    /** Get an iterator to traverse the list items  */
    items(): IterableIterator<T>;
    /** Get an iterator that traverses the list items in reverse  */
    backItems(): IterableIterator<T>;
    /** Get an iterator to traverse the list nodes  */
    nodes(): IterableIterator<LinkedNode<T>>;
    /** Get an iterator that traverses the list nodes in reverse  */
    backNodes(): IterableIterator<LinkedNode<T>>;
    /** Clear list items  */
    clear(): void;
    /** Add an item to the end of the linked list  */
    push(val: T): LinkedNode<T>;
    /** Add many items to the end of the linked list  */
    push(...vals: T[]): void;
    /** Add many nodes to the end of the linked list
     * unsafe method, will not verify the node  */
    pushNode(...nodes: LinkedNode<T>[]): void;
    /** Add an item to the head of the linked list  */
    unshift(val: T): void;
    /** Add many items to the head of the linked list  */
    unshift(...vals: T[]): void;
    /** Add many nodes to the head of the linked list
     * unsafe method, will not verify the node  */
    unshiftNode(...nodes: LinkedNode<T>[]): void;
    /** Remove an item from the end of the list  */
    pop(): T | undefined;
    /** Remove a node from the end of the linked list  */
    popNode(): LinkedNode<T> | undefined;
    /** Remove an item from the head of the list  */
    shift(): T | undefined;
    /** Remove a node from the head of the list  */
    shiftNode(): LinkedNode<T> | undefined;
    /** After adding an item to a node
     * unsafe method, will not verify the node  */
    addAfter(target: LinkedNode<T>, val: T): void;
    /** After adding a node to a node
     * unsafe method, will not verify the node  */
    addAfterNode(target: LinkedNode<T>, node: LinkedNode<T>): void;
    /** Before adding an item to a node
     * unsafe method, will not verify the node  */
    addBefore(target: LinkedNode<T>, val: T): void;
    /** Before adding a node to a node
     * unsafe method, will not verify the node  */
    addBeforeNode(target: LinkedNode<T>, node: LinkedNode<T>): void;
    /** Remove a node from the linked list
     * unsafe method, will not verify the node  */
    remove(target: LinkedNode<T>): LinkedNode<T> | undefined;
}
/** Linked list node  */
export declare class LinkedNode<T> implements Box<T> {
    val: T;
    prev?: LinkedNode<T> | undefined;
    next?: LinkedNode<T> | undefined;
    constructor(/** Value in node */ val: T, /** Previous node  */ prev?: LinkedNode<T> | undefined, /** Next node  */ next?: LinkedNode<T> | undefined);
}