/**
 * Controls how a {@link List}'s <kbd>walk</kbd> operation behaves
 * after each iteration.
 */
export type ListWalkDecision<T> = {
    deleteItem?: boolean;
    insertAfter?: T;
    insertBefore?: T;
    keepWalking: boolean;
};
/**
 * Basic list-like structure.
 */
export type List<T> = {
    at(index: number): T | undefined;
    get head(): T | undefined;
    insertAt(index: number, value: T): void;
    get isEmpty(): boolean;
    get length(): number;
    pop(): T | undefined;
    push(value: T): void;
    shift(): T | undefined;
    toArray(): T[];
    unshift(value: T): void;
    values(): Generator<T, void, undefined>;
    valuesAndIndexes(): Generator<[T, number], void, undefined>;
    walk(block: (value: T, index: number) => ListWalkDecision<T>): void;
    readonly [Symbol.toStringTag]: string;
};
/**
 * Builder for a single-linked list.
 */
export declare const singleLinkedList: <T>() => List<T>;
/**
 * Mixin for additional methods available when the linked list
 * is double-linked.
 */
export type DoubleLinkedList<T> = List<T> & {
    get tail(): T | undefined;
    reverseValues(): Generator<T, void, undefined>;
    reverseValuesAndIndexes(): Generator<[T, number], void, undefined>;
    reverseWalk(block: (value: T, index: number) => ListWalkDecision<T>): void;
};
/**
 * Build a doubly-linked list.
 */
export declare const doubleLinkedList: <T>() => DoubleLinkedList<T>;
//# sourceMappingURL=linked-list.d.ts.map