Examples of javax.swing.tree.DefaultMutableTreeNode$PathBetweenNodesEnumeration

javax.swing.tree.DefaultMutableTreeNode
oracle.com/javase/tutorial/uiswing/components/tree.html">How to Use Trees in The Java Tutorial.
A tree node may have at most one parent and 0 or more children. DefaultMutableTreeNode provides operations for examining and modifying a node's parent and children and also operations for examining the tree that the node is a part of. A node's tree is the set of all nodes that can be reached by starting at the node and following all the possible links to parents and children. A node with no parent is the root of its tree; a node with no children is a leaf. A tree may consist of many subtrees, each node acting as the root for its own subtree.
This class provides enumerations for efficiently traversing a tree or subtree in various orders or for following the path between two nodes. A DefaultMutableTreeNode may also hold a reference to a user object, the use of which is left to the user. Asking a DefaultMutableTreeNode for its string representation with toString() returns the string representation of its user object.
This is not a thread safe class.If you intend to use a DefaultMutableTreeNode (or a tree of TreeNodes) in more than one thread, you need to do your own synchronizing. A good convention to adopt is synchronizing on the root node of a tree.
While DefaultMutableTreeNode implements the MutableTreeNode interface and will allow you to add in any implementation of MutableTreeNode not all of the methods in DefaultMutableTreeNode will be applicable to all MutableTreeNodes implementations. Especially with some of the enumerations that are provided, using some of these methods assumes the DefaultMutableTreeNode contains only DefaultMutableNode instances. All of the TreeNode/MutableTreeNode methods will behave as defined no matter what implementations are added.
Warning: Serialized objects of this class will not be compatible with future Swing releases. The current serialization support is appropriate for short term storage or RMI between applications running the same version of Swing. As of 1.4, support for long term storage of all JavaBeans™ has been added to the java.beans package. Please see {@link java.beans.XMLEncoder}. @see MutableTreeNode @author Rob Davis

    /** Return all sub task for the tree node base */
    public ArrayList getAllChildTask(Task task) {
        ArrayList res = new ArrayList();
        if (task == null)
            return null;
        DefaultMutableTreeNode base = (DefaultMutableTreeNode) getNode(task
                .getTaskID());
        if (base == null)
            return res;
        Enumeration e = base.children();
        while (e.hasMoreElements()) {
            res.add(e.nextElement());
        }
        return res;
    }

View Full Code Here

    }


    /** Remove the current node.
     * @param current */
    void removeCurrentNode(DefaultMutableTreeNode currentNode) {
            DefaultMutableTreeNode parent = (DefaultMutableTreeNode) (currentNode
                    .getParent());
            getTaskManager().deleteTask((Task) currentNode.getUserObject());
            if (parent != null) {
                ((GanttTreeTableModel) treeModel)
                        .removeNodeFromParent(currentNode);

View Full Code Here

        while (it.hasNext())
            selectTask((Task) it.next(), true);
    }


    public void selectTask(Task task, boolean multipleSelection) {
        DefaultMutableTreeNode taskNode = null;
        for (Enumeration nodes = rootNode.preorderEnumeration(); nodes
                .hasMoreElements();) {
            DefaultMutableTreeNode nextNode = (DefaultMutableTreeNode) nodes
                    .nextElement();
            if (!(nextNode instanceof TaskNode))
                continue;
            if (nextNode.getUserObject().equals(task)) {
                taskNode = nextNode;
                break;
            }
        }
        if (taskNode != null) {

View Full Code Here

    /** Returne the mother task. */
    public DefaultMutableTreeNode getFatherNode(Task node) {
        if (node == null) {
            return null;
        }
        DefaultMutableTreeNode tmp = (DefaultMutableTreeNode) getNode(node
                .getTaskID());
        if (tmp == null) {
            return null;
        }


        return (DefaultMutableTreeNode) tmp.getParent();
    }

View Full Code Here

     * Hides the selected tasks.
     */
    public void hideSelectedNodes() {
        DefaultMutableTreeNode[] t = getSelectedNodes();
        for (int i = 0; i < t.length; i++) {
            DefaultMutableTreeNode parent = (DefaultMutableTreeNode) t[i]
                    .getParent();
            hiddenTask.add(new HiddenTask(t[i], parent, parent.getIndex(t[i])));
        }


        for (int i = 0; i < hiddenTask.size(); i++) {
            HiddenTask ht = (HiddenTask) hiddenTask.get(i);
            TreeNode parent = ht.node.getParent();

View Full Code Here

     */
    public void displayHiddenTasks() {
        for (int i = 0; i < hiddenTask.size(); i++) {
            HiddenTask ht = (HiddenTask) hiddenTask.get(i);


            DefaultMutableTreeNode node = ht.getNode();
            DefaultMutableTreeNode parent = ht.getParent();
            node.setParent(parent);
        }
        Collections.sort(hiddenTask);
        for (int i = 0; i < hiddenTask.size(); i++) {
            HiddenTask ht = (HiddenTask) hiddenTask.get(i);


            DefaultMutableTreeNode node = ht.getNode();
            DefaultMutableTreeNode parent = ht.getParent();
            int index = ht.getIndex();
            node.setParent(null);
            ((GanttTreeTableModel) getTreeTable().getTreeTableModel())
                    .insertNodeInto(node, parent, index);

View Full Code Here

        appli.getUndoManager().undoableEdit("Up", new Runnable() {
            public void run()
            {
                for (int i = 0; i < cdmtn.length; i++)
                {
                    DefaultMutableTreeNode father = gt2.getFatherNode(cdmtn[i]);
                    int index = father.getIndex((TreeNode) cdmtn[i]);


                    index--;


                    Task task = (Task) cdmtn[i].getUserObject();


                    if (index >= 0)
                    {
                      DefaultMutableTreeNode [] child = new DefaultMutableTreeNode[cdmtn[i].getChildCount()];


                      if(task.getExpand())
                      {
                        for(int j=0; j<cdmtn[i].getChildCount(); j++)
                        {
                          child[j] = (DefaultMutableTreeNode)cdmtn[i].getChildAt(j);
                        }


                        for(int j=0; j<child.length; j++)
                        {
                          child[j].removeFromParent();
                          treeModel.nodesWereRemoved(cdmtn[i],
                              new int[] { 0 },
                              new Object[] { child });
                        }
                      }


                      cdmtn[i].removeFromParent();
                        treeModel.nodesWereRemoved(father,
                                        new int[] { index + 1 },
                                        new Object[] { cdmtn });


                        father.insert(cdmtn[i], index);
                        treeModel.nodesWereInserted(father, new int[] {index});


                        if(task.getExpand())
                        {
                          for(int j=0; j<child.length; j++)

View Full Code Here

        appli.getUndoManager().undoableEdit("Down", new Runnable(){
            public void run()
            {
                for (int i = cdmtn.length - 1; i >= 0; i--)
                {
                    DefaultMutableTreeNode father = gt2.getFatherNode(cdmtn[i]);
                    int index = father.getIndex((TreeNode) cdmtn[i]);
                    index++;


                    Task task = (Task) cdmtn[i].getUserObject();


                    // New position
                    if ((index < father.getChildCount()))
                    {
                      DefaultMutableTreeNode [] child = new DefaultMutableTreeNode[cdmtn[i].getChildCount()];


                      if(task.getExpand())
                      {
                        for(int j=0; j<cdmtn[i].getChildCount(); j++)
                        {
                          child[j] = (DefaultMutableTreeNode)cdmtn[i].getChildAt(j);
                        }


                        for(int j=0; j<child.length; j++)
                        {
                          child[j].removeFromParent();
                          treeModel.nodesWereRemoved(cdmtn[i],
                              new int[] { 0 },
                              new Object[] { child });
                        }
                      }


                      cdmtn[i].removeFromParent();
                        treeModel.nodesWereRemoved(father,
                                        new int[] { index - 1 },
                                        new Object[] { cdmtn });


                        father.insert(cdmtn[i], index);
                        treeModel.nodesWereInserted(father, new int[] {index});


                        if(task.getExpand())
                        {
                          for(int j=0; j<child.length; j++)

View Full Code Here

        area.repaint();
    }


    public DefaultMutableTreeNode removeChild(DefaultMutableTreeNode node)
    {
      DefaultMutableTreeNode nodeCopy = new DefaultMutableTreeNode(node.getUserObject());
      Enumeration children = node.children();
      while(children.hasMoreElements())
      {
        DefaultMutableTreeNode child = (DefaultMutableTreeNode)children.nextElement();


        DefaultMutableTreeNode childCopy = this.removeChild(child);
        nodeCopy.add(childCopy);


        child.removeFromParent();
        treeModel.nodesWereRemoved(node,
                    new int[] { 0 },

View Full Code Here

      Enumeration children = copy.children();


      int index = 0;
      while(children.hasMoreElements())
      {
        DefaultMutableTreeNode childCopy = (DefaultMutableTreeNode)children.nextElement();
        DefaultMutableTreeNode child = new DefaultMutableTreeNode(childCopy.getUserObject());
        node.insert(child, index);
        treeModel.nodesWereInserted(node, new int[] {index});
        this.insertChild(child, childCopy);
        index++;
      }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of javax.swing.tree.DefaultMutableTreeNode$PathBetweenNodesEnumeration

ca.uhn.hl7v2.view.TreePanel

com.edgytech.umongo.DocView

com.explodingpixels.macwidgets.SourceList

com.google.gwt.dev.shell.log.SwingLoggerPanel

com.google.gwt.dev.shell.log.SwingLoggerPanel$TreeRenderer

com.google.gwt.dev.shell.log.SwingTreeLogger

com.k42b3.zubat.TreePanel$TreeTransferHandler

com.moneydance.modules.features.invextension.ReportConfigTreePanel

com.sun.messaging.jmq.admin.apps.console.AExplorer

de.chris_soft.nanodoa.gui.tree.ArchiveTree

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.