/**
 * Utility class for working with trees
 *
 * @author Sergey Shishigin
 * @date 2019-10-21
 */
import { IFlatListItem } from '../../component/';
import { ITreeNode } from '../tree/Tree';
export declare class TreeUtil<T> {
    /**
     * Method for converting a flat list to a tree
     * inspired by
     * https://github.com/philipstanislaus/performant-array-to-tree/blob/master/src/arrayToTree.ts
     * https://github.com/philipstanislaus/performant-array-to-tree
     *
     * @param items {IFlatListItem[]} FlatListItem
     * @param onItemAdd
     */
    static listToTree<T>(items: Array<IFlatListItem<T>>, onItemAdd?: (item: T, node: ITreeNode<T>) => void): Array<ITreeNode<T>>;
    /**
     * Expand the entire tree (starting at any level)
     * @param tree
     */
    static expandAll<T>(tree: Array<ITreeNode<T>>): void;
    /**
     * Collapse the entire tree (starting at any level)
     * @param tree
     */
    static collapseAll<T>(tree: Array<ITreeNode<T>>): void;
    /**
     * Sorting the tree and nested sub trees
     * @param a
     * @param b
     */
    static sortTree<T extends {
        [key: string]: any;
    }>(a: ITreeNode<T>, b: ITreeNode<T>): number;
    static forEachTreeNode<T>(handler: (item: ITreeNode<T>) => void, currentList: Array<ITreeNode<T>>): void;
    static flatTree<T>(nodes: Array<ITreeNode<T>>): Array<ITreeNode<T>>;
    static mapTree<T>(handler: (item: ITreeNode<T>) => ITreeNode<T>, currentList: Array<ITreeNode<T>>): Array<ITreeNode<T>>;
    static cloneTree<T>(nodes: Array<ITreeNode<T>>): Array<ITreeNode<T>>;
    static filterTree<T>(handler: (item: ITreeNode<T>) => boolean, currentList: Array<ITreeNode<T>>): Array<ITreeNode<T>>;
    static findTreeNode<T>(handler: (item: ITreeNode<T>) => boolean, currentList: Array<ITreeNode<T>>): ITreeNode<T> | undefined;
    static findParentNode<T>(nodes: Array<ITreeNode<T>>, itemKey: string): ITreeNode<T> | undefined;
    /**
     * @deprecated
     */
    static initParents<T>(parentNode: ITreeNode<T>, recursive?: boolean): void;
}