Package javax.swing.tree

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

101
102
103
104
105
106
107
108
109
110
111
   */
  private static void expandAll(final JTree tree, final TreePath parent, final boolean expand) {
    // Traverse children
    final TreeNode node = (TreeNode) parent.getLastPathComponent();
    if (node.getChildCount() >= 0)
      for (final Enumeration<?> e = node.children(); e.hasMoreElements();) {
        final TreeNode n = (TreeNode) e.nextElement();
        final TreePath path = parent.pathByAddingChild(n);
        expandAll(tree, path, expand);
      }
    // Expansion or collapse must be done bottom-up
View Full Code Here
179
180
181
182
183
184
185
186
187
188
189
    @SuppressWarnings("unchecked")
  private 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);
                this._expandAll(tree, path, expand);
            }
        }
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
    @SuppressWarnings("unchecked")
  private 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
149
150
151
152
153
154
155
156
157
158
159
    @SuppressWarnings("unchecked")
  private 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
44
45
46
47
48
49
50
51
52
53
54
  private void fullyExpandTreeNode(final TreePath path) {
    // expand the path
    theTree.expandPath(path);
    // expand the children
    final TreeNode node = (TreeNode) path.getLastPathComponent();
    final Enumeration<?> children = node.children();
    while (children.hasMoreElements()) {
      TreeNode child = (TreeNode) children.nextElement();
      fullyExpandTreeNode(path.pathByAddingChild(child));
    }
  }
View Full Code Here
398
399
400
401
402
403
404
405
406
407
408
    private 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
177
178
179
180
181
182
183
184
185
186
187
   */
  private static void expandAll(JTree tree, TreePath parent, boolean expand) {
    // Traverse children
    TreeNode node = (TreeNode) parent.getLastPathComponent();
    if (node.getChildCount() >= 0) {
      for (Enumeration<TreeNode> en = node.children(); en
          .hasMoreElements();) {
        TreeNode n = en.nextElement();
        TreePath path = parent.pathByAddingChild(n);
        expandAll(tree, path, expand);
      }
View Full Code Here
19
20
21
22
23
24
25
26
27
28
29
    }

    private static void expandAll(JTree tree, TreePath parent, boolean expand) {
        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
833
834
835
836
837
838
839
840
841
842
843
    {
      // 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
92
93
94
95
96
97
98
99
100
101
102
    public void treeExpanded(javax.swing.event.TreeExpansionEvent treeExpansionEvent) {
        TreeNode node = (TreeNode) treeExpansionEvent.getPath().getLastPathComponent();
        if (node instanceof AccessibilityNode) {
            // Calling oneway methods from an UNO thread may cause
            // deadlocks, so adding the listeners here.
            for (java.util.Enumeration e = node.children(); e.hasMoreElements(); ) {
                ((AccessibilityNode) e.nextElement()).setAttached(true);
            }
        }
    }
   
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.