com.neurosys.utils

Class HierarichicalUtils

java.lang.Object

com.neurosys.utils.HierarichicalUtils

public class HierarichicalUtils
extends Object

Utilities for IHierarchialReferences

Author:

Arjun Dhar

Constructor Summary

Constructors

Constructor and Description
HierarichicalUtils()

Method Summary

Modifier and Type	Method and Description
static <T extends IHierarchialReference<I>,I> List	constructTree(List<T> flatList, Comparator<T> comparator, T filterParent) Construct a Tree of type List{children of type T | child node is either a SubTree of type Tree or node T; first node represents the parent node in the sub-tree}
static <T extends IHierarchialReference<I>,I> void	fixBrokenTree(List<T> flatList) Some nodes immediate parents may not be in data; but their ancestors maybe. A break in immediate parent can cause issue; so if we are aware it can happen allow a way for a child to refer to its nearest ancestor as a parent.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

HierarichicalUtils

public HierarichicalUtils()

Method Detail

constructTree

public static <T extends IHierarchialReference<I>,I> List constructTree(List<T> flatList,
                                                                        Comparator<T> comparator,
                                                                        T filterParent)

Construct a Tree of type List{children of type T | child node is either a SubTree of type Tree or node T; first node represents the parent node in the sub-tree}

Type Parameters:

T - as IHierarchialReference type

I - as any Id type like String, Long

Parameters:

flatList - as List of T

comparator - as Comparator of T

filterParent - as the parent to be selected (excluding the parent). If parent is nu;; then all nodes will come.

Returns:

List of IHierarchialReference

fixBrokenTree

public static <T extends IHierarchialReference<I>,I> void fixBrokenTree(List<T> flatList)

Some nodes immediate parents may not be in data; but their ancestors maybe.
A break in immediate parent can cause issue; so if we are aware it can happen allow a way for a child to refer to its nearest ancestor as a parent.

It will fix the parent references within existing nodes.

Parameters:

flatList - as List of T