Java JTree Node sortNode(DefaultMutableTreeNode parent, Comparator comparator)

Here you can find the source of sortNode(DefaultMutableTreeNode parent, Comparator comparator)

Description

sort Node

License

Open Source License

Declaration

public static void sortNode(DefaultMutableTreeNode parent, Comparator<DefaultMutableTreeNode> comparator) 

Method Source Code


//package com.java2s;
import java.util.Comparator;

import javax.swing.tree.DefaultMutableTreeNode;
import javax.swing.tree.MutableTreeNode;

public class Main {
    public static void sortNode(DefaultMutableTreeNode parent, Comparator<DefaultMutableTreeNode> comparator) {
        int n = parent.getChildCount();
        for (int i = 0; i < n - 1; i++) {
            int min = i;
            for (int j = i + 1; j < n; j++) {
                if (comparator.compare((DefaultMutableTreeNode) parent.getChildAt(min),
                        (DefaultMutableTreeNode) parent.getChildAt(j)) > 0) {
                    min = j;//ww w . ja va2 s . com
                }
            }
            if (i != min) {
                MutableTreeNode a = (MutableTreeNode) parent.getChildAt(i);
                MutableTreeNode b = (MutableTreeNode) parent.getChildAt(min);
                parent.insert(b, i);
                parent.insert(a, min);
            }
        }
    }
}

Related

  1. refreshNode(final JTree tree, final TreeNode node)
  2. RemoveChildren(DefaultMutableTreeNode node)
  3. searchForNode(TreeNode node, String query)
  4. setTreeSelectedNode(JTree tree, TreeNode node)
  5. sort(DefaultMutableTreeNode node)
  6. sortTreeDepthFirst(DefaultMutableTreeNode root, Comparator comparator)
  7. sortTreeNode(DefaultMutableTreeNode root)
  8. sortTreeNodesAlphaNumeric(final DefaultMutableTreeNode node)
  9. toArray(final TreeNode node)