1 | export declare class Yallist<T = unknown> {
|
2 | tail?: Node<T>;
|
3 | head?: Node<T>;
|
4 | length: number;
|
5 | static create<T = unknown>(list?: Iterable<T>): Yallist<T>;
|
6 | constructor(list?: Iterable<T>);
|
7 | [Symbol.iterator](): Generator<T, void, unknown>;
|
8 | removeNode(node: Node<T>): Node<T> | undefined;
|
9 | unshiftNode(node: Node<T>): void;
|
10 | pushNode(node: Node<T>): void;
|
11 | push(...args: T[]): number;
|
12 | unshift(...args: T[]): number;
|
13 | pop(): T | undefined;
|
14 | shift(): T | undefined;
|
15 | forEach(fn: (value: T, i: number, list: Yallist<T>) => any, thisp?: any): void;
|
16 | forEachReverse(fn: (value: T, i: number, list: Yallist<T>) => any, thisp?: any): void;
|
17 | get(n: number): T | undefined;
|
18 | getReverse(n: number): T | undefined;
|
19 | map<R = any>(fn: (value: T, list: Yallist<T>) => R, thisp?: any): Yallist<R>;
|
20 | mapReverse<R = any>(fn: (value: T, list: Yallist<T>) => R, thisp?: any): Yallist<R>;
|
21 | reduce(fn: (left: T, right: T, i: number) => T): T;
|
22 | reduce<R = any>(fn: (acc: R, next: T, i: number) => R, initial: R): R;
|
23 | reduceReverse(fn: (left: T, right: T, i: number) => T): T;
|
24 | reduceReverse<R = any>(fn: (acc: R, next: T, i: number) => R, initial: R): R;
|
25 | toArray(): any[];
|
26 | toArrayReverse(): any[];
|
27 | slice(from?: number, to?: number): Yallist<unknown>;
|
28 | sliceReverse(from?: number, to?: number): Yallist<unknown>;
|
29 | splice(start: number, deleteCount?: number, ...nodes: T[]): T[];
|
30 | reverse(): this;
|
31 | }
|
32 | export declare class Node<T = unknown> {
|
33 | list?: Yallist<T>;
|
34 | next?: Node<T>;
|
35 | prev?: Node<T>;
|
36 | value: T;
|
37 | constructor(value: T, prev?: Node<T> | undefined, next?: Node<T> | undefined, list?: Yallist<T> | undefined);
|
38 | }
|
39 | //# sourceMappingURL=index.d.ts.map |
\ | No newline at end of file |