typescript-collections/dist/lib/MultiRootTree.d.ts

A complete, fully tested data structure library written in TypeScript.

export interface FlatTreeNode {
    id: string;
    level: number;
    hasParent: boolean;
    childrenCount: number;
}
export default class MultiRootTree {
    rootIds: Array<string>;
    nodes: {
        [id: string]: Array<string>;
    };
    constructor(rootIds?: Array<string>, nodes?: {
        [id: string]: Array<string>;
    });
    initRootIds(): void;
    initNodes(): void;
    createEmptyNodeIfNotExist(nodeKey: string): void;
    getRootIds(): string[];
    getNodes(): {
        [id: string]: string[];
    };
    getObject(): {
        rootIds: string[];
        nodes: {
            [id: string]: string[];
        };
    };
    toObject(): {
        rootIds: string[];
        nodes: {
            [id: string]: string[];
        };
    };
    flatten(): Array<FlatTreeNode>;
    moveIdBeforeId(moveId: string, beforeId: string): void;
    moveIdAfterId(moveId: string, afterId: string): void;
    moveIdIntoId(moveId: string, insideId: string, atStart?: boolean): void;
    swapRootIdWithRootId(rootId: string, withRootId: string): void;
    swapRootPositionWithRootPosition(swapRootPosition: number, withRootPosition: number): void;
    deleteId(id: string): void;
    insertIdBeforeId(beforeId: string, insertId: string): void;
    insertIdAfterId(belowId: string, insertId: string): void;
    insertIdIntoId(insideId: string, insertId: string): void;
    insertIdIntoRoot(id: string, position?: number): void;
    insertIdIntoNode(nodeKey: string, id: string, position?: number): void;
    private moveId(moveId, beforeId, direction);
    private swapArrayElements(arr, indexA, indexB);
    private rootDeleteId(id);
    private nodeAndSubNodesDelete(nodeKey);
    private nodeRefrencesDelete(id);
    private nodeDelete(nodeKey);
    private findRootId(id);
    private findNodeId(nodeKey, id);
    private findNode(nodeKey);
    private nodeInsertAtStart(nodeKey, id);
    private nodeInsertAtEnd(nodeKey, id);
    private rootDelete(index);
    private nodeDeleteAtIndex(nodeKey, index);
    private rootInsertAtStart(id);
    private rootInsertAtEnd(id);
}