Package javax.swing.tree

Examples of javax.swing.tree.TreeNode.children()

28
29
30
31
32
33
34
35
36
37
38
public class TreeUtils {
    public static void expandAll(JTree tree, TreePath parent, boolean expand) {
        // Traverse children
        TreeNode node = (TreeNode) parent.getLastPathComponent();
        if (node.getChildCount() >= 0) {
            for (Enumeration e = node.children(); e.hasMoreElements(); ) {
                TreeNode n = (TreeNode) e.nextElement();
                TreePath path = parent.pathByAddingChild(n);
                expandAll(tree, path, expand);
            }
        }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
    private void expandAll(TreePath parent, boolean expand) {
        // Traverse children
        TreeNode node = (TreeNode) parent.getLastPathComponent();
        if (node.getChildCount() >= 0) {
            for (Enumeration<?> e = node.children(); e.hasMoreElements();) {
                TreeNode n = (TreeNode) e.nextElement();
                TreePath path = parent.pathByAddingChild(n);
                expandAll(path, expand);
            }
        }
View Full Code Here
826
827
828
829
830
831
832
833
834
835
836
    {
      // parentNode was a leaf before this insertion event only if every one of
      // its current children is in the event's list of children
      boolean wasLeaf = true;
      List<?> eventChildren = Arrays.asList(e.getChildren());
      Enumeration<?> treeChildren = parentNode.children();
      while (wasLeaf && treeChildren.hasMoreElements())
      {
        if (!eventChildren.contains(treeChildren.nextElement()))
        {
          wasLeaf = false;
View Full Code Here
343
344
345
346
347
348
349
350
351
352
353
        else {
            TreePath parent = new TreePath(root);
            TreeNode node = (TreeNode) parent.getLastPathComponent();
            if (node.getChildCount() >= 0) {
                for (@SuppressWarnings("rawtypes")
                Enumeration e = node.children(); e.hasMoreElements();) {
                    TreeNode n = (TreeNode) e.nextElement();
                    TreePath path = parent.pathByAddingChild(n);
                    expandAll(tree, path, expand);
                }
            }
View Full Code Here
357
358
359
360
361
362
363
364
365
366
367
    private void expandAll(JTree tree, TreePath parent, boolean expand) {
        // Traverse children
        TreeNode node = (TreeNode) parent.getLastPathComponent();
        if (node.getChildCount() >= 0) {
            for (@SuppressWarnings("rawtypes")
            Enumeration e = node.children(); e.hasMoreElements();) {
                TreeNode n = (TreeNode) e.nextElement();
                TreePath path = parent.pathByAddingChild(n);
                expandAll(tree, path, expand);
            }
        }
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
                if (e.getClickCount() == 2) {
                    TreePath path = directoryChooser.getPathForLocation(e.getX(), e.getY());
                    if (path != null && path.equals(directoryChooser.getSelectionPath()) &&
                        directoryChooser.getSelectedFiles().length > 0) {
                        TreeNode o = (TreeNode) path.getLastPathComponent();
                        if (o.isLeaf() || !o.children().hasMoreElements())
                            actionListener.actionPerformed(new ActionEvent(directoryChooser, 0, null));
                    }
                }
            }
        });
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
  public void expandAll(JTree tree, TreePath parent, boolean expand) {
    // Traverse children
    final TreeNode node = (TreeNode) parent.getLastPathComponent();
    if (node.getChildCount() >= 0) {

      for (final Enumeration<TreeNode> e = node.children(); e.hasMoreElements();) {

        final TreeNode n = e.nextElement();
        final TreePath path = parent.pathByAddingChild(n);
        expandAll(tree, path, expand);
      }
View Full Code Here
257
258
259
260
261
262
263
264
265
266
267
  private void expandPath(JTree tree, TreePath path) {
    tree.expandPath(path);

    final TreeNode node = ((TreeNode)path.getLastPathComponent());
    final Enumeration children = node.children();
    while (children.hasMoreElements()) {
      TreeNode child = (TreeNode)children.nextElement();
      expandPath(tree, path.pathByAddingChild(child));
    }
  }
View Full Code Here
267
268
269
270
271
272
273
274
275
276
277
  }

  private void collapsePath(JTree tree, TreePath path) {

    final TreeNode node = ((TreeNode)path.getLastPathComponent());
    final Enumeration children = node.children();
    while (children.hasMoreElements()) {
      TreeNode child = (TreeNode)children.nextElement();
      collapsePath(tree, path.pathByAddingChild(child));
    }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
    // Traverse children
    TreeNode node = (TreeNode) parent.getLastPathComponent();

    if (node.getChildCount() >= 0)
    {
      for (Enumeration e = node.children(); e.hasMoreElements();)
      {
        TreeNode n = (TreeNode) e.nextElement();
        TreePath path = parent.pathByAddingChild(n);

        if (desiredLevel > 0)
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.