| /******************************************************************************* |
| * Copyright (C) 2013 The University of Manchester |
| * |
| * Modifications to the initial code base are copyright of their |
| * respective authors, or their employers as appropriate. |
| * |
| * This program is free software; you can redistribute it and/or |
| * modify it under the terms of the GNU Lesser General Public License |
| * as published by the Free Software Foundation; either version 2.1 of |
| * the License, or (at your option) any later version. |
| * |
| * This program is distributed in the hope that it will be useful, but |
| * WITHOUT ANY WARRANTY; without even the implied warranty of |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| * Lesser General Public License for more details. |
| * |
| * You should have received a copy of the GNU Lesser General Public |
| * License along with this program; if not, write to the Free Software |
| * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 |
| ******************************************************************************/ |
| package net.sf.taverna.t2.workbench.views.results; |
| |
| import static javax.swing.SwingUtilities.invokeLater; |
| |
| import java.util.HashMap; |
| import java.util.Map; |
| import java.util.SortedSet; |
| |
| import javax.swing.tree.DefaultMutableTreeNode; |
| import javax.swing.tree.DefaultTreeModel; |
| import javax.swing.tree.MutableTreeNode; |
| |
| import net.sf.taverna.t2.workbench.ui.Updatable; |
| import uk.org.taverna.platform.report.Invocation; |
| import uk.org.taverna.platform.report.StatusReport; |
| |
| /** |
| * TreeModel for displaying invocations. |
| * |
| * @author David Withers |
| */ |
| @SuppressWarnings("serial") |
| public class InvocationTreeModel extends DefaultTreeModel implements Updatable { |
| private final StatusReport<?, ?> report; |
| private Map<String, InvocationTreeNode> nodes = new HashMap<>(); |
| |
| /** |
| * Constructs a new TreeModel for displaying invocations. |
| * |
| * @param report |
| * the report to display |
| */ |
| public InvocationTreeModel(StatusReport<?, ?> report) { |
| super(new DefaultMutableTreeNode()); |
| this.report = report; |
| updateTree(report.getInvocations()); |
| } |
| |
| public InvocationTreeNode getFirstInvocationNode() { |
| return nodes.get(report.getInvocations().first().getId()); |
| } |
| |
| private void updateTree(SortedSet<Invocation> invocations) { |
| for (Invocation invocation : invocations) { |
| String invocationId = invocation.getId(); |
| if (!nodes.containsKey(invocationId)) |
| nodes.put(invocationId, createNode(invocation)); |
| } |
| } |
| |
| private InvocationTreeNode createNode(Invocation invocation) { |
| InvocationTreeNode node = new InvocationTreeNode(invocation); |
| Invocation parent = invocation.getParent(); |
| if (parent != null) { |
| Invocation grandParent = parent.getParent(); |
| if (grandParent != null) { |
| Invocation greatGrandParent = grandParent.getParent(); |
| if (greatGrandParent != null) { |
| String invocationId = greatGrandParent.getId(); |
| if (!nodes.containsKey(invocationId)) |
| nodes.put(invocationId, createNode(greatGrandParent)); |
| MutableTreeNode parentNode = nodes.get(invocationId); |
| insertNodeInto(node, parentNode, parentNode.getChildCount()); |
| return node; |
| } |
| } |
| } |
| |
| MutableTreeNode parentNode = ((MutableTreeNode) getRoot()); |
| insertNodeInto(node, parentNode, parentNode.getChildCount()); |
| return node; |
| } |
| |
| @Override |
| public void update() { |
| invokeLater(new Runnable() { |
| @Override |
| public void run() { |
| updateTree(report.getInvocations()); |
| } |
| }); |
| } |
| } |