Package com.macrofocus.hierarchy

Interface Hierarchy<T>

    • Method Detail

      • getRoot

        T getRoot()

      • isRoot

        boolean isRoot​(T node)

      • getParent

        T getParent​(T child)

      • hasChild

        boolean hasChild​(T parent)

      • getChildren

        java.lang.Iterable<T> getChildren​(T parent)

      • getChildList

        java.util.List<T> getChildList​(T parent)

      • getChild

        T getChild​(T parent,
           int index)

      • getChildCount

        int getChildCount​(T parent)

      • getIndexOfChild

        int getIndexOfChild​(T parent,
                    T child)

      • containsChild

        boolean containsChild​(T parent,
                      T child)

      • containsChild

        boolean containsChild​(T child)

      • preorderIterator

        java.lang.Iterable<T> preorderIterator()

      • breadthFirstIterator

        java.lang.Iterable<T> breadthFirstIterator()

      • depthFirstIterator

        java.lang.Iterable<T> depthFirstIterator()

      • leavesIterator

        java.lang.Iterable<T> leavesIterator()

      • preorderIterator

        java.lang.Iterable<T> preorderIterator​(T parent)
        Creates and returns an iterable that traverses the subhierarchy rooted at the give node in preorder. The first node returned by the iterator's next() method is the given node.
        Parameters:
        parent - the root of the hierarchy to traverse
        Returns:
        an iterable that traverses the subtree rooted at this node in preorder.

      • breadthFirstIterator

        java.lang.Iterable<T> breadthFirstIterator​(T parent)
        Creates and returns an iterable that traverses the subhierarchy rooted at the give node in breadth-first order. The first node returned by the iterator's next() method is the given node.
        Parameters:
        parent - the root of the hierarchy to traverse
        Returns:
        an iterable that traverses the subtree rooted at this node in breadth-first order.

      • depthFirstIterator

        java.lang.Iterable<T> depthFirstIterator​(T parent)
        Creates and returns an iterable that traverses the subhierarchy rooted at the give node in depth-first order. The first node returned by the iterator's next() method is the leftmost leaf.
        Parameters:
        parent - the root of the hierarchy to traverse
        Returns:
        an iterable that traverses the subtree rooted at this node in depth-first order.

      • leavesIterator

        java.lang.Iterable<T> leavesIterator​(T parent)

      • addWeakHierarchyListener

        void addWeakHierarchyListener​(HierarchyListener<T> listener)

      • removeHierarchyListener

        void removeHierarchyListener​(HierarchyListener<T> listener)

      • removeHierarchyListeners

        void removeHierarchyListeners()

      • setNotifyListeners

        void setNotifyListeners​(boolean enable)

      • getPath

        java.util.List<T> getPath​(T node)
        Returns the path from the root, to get to this node. The last element in the path is this node.
        Returns:
        an array of objects giving the path, where the first element in the path is the root and the last element is this node.

      • getPathToRoot

        java.lang.Object[] getPathToRoot​(T child)

      • notifyHierarchyNodeChanged

        void notifyHierarchyNodeChanged​(T child,
                                T parent,
                                int index,
                                boolean isAdjusting)

      • getDepth

        int getDepth()

      • getLevel

        int getLevel​(T node)

      • isLeaf

        boolean isLeaf​(T node)

      • getLeafCount

        int getLeafCount​(T node)

      • getFirstLeaf

        T getFirstLeaf​(T node)

      • getLastLeaf

        T getLastLeaf​(T node)

      • getNextLeaf

        T getNextLeaf​(T node)

      • getPreviousLeaf

        T getPreviousLeaf​(T node)