1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276
|
/* InvariantTreeComponent.java
* =========================================================================
* This file is part of the GrInvIn project - http://www.grinvin.org
*
* Copyright (C) 2005-2008 Universiteit Gent
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 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
* General Public License for more details.
*
* A copy of the GNU General Public License can be found in the file
* LICENSE.txt provided with the source distribution of this program (see
* the META-INF directory in the source jar). This license can also be
* found on the GNU website at http://www.gnu.org/licenses/gpl.html.
*
* If you did not receive a copy of the GNU General Public License along
* with this program, contact the lead developer, or write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301, USA.
*/
package org.grinvin.gui.components;
import be.ugent.caagt.swirl.dnd.DragHandler;
import be.ugent.caagt.swirl.dnd.LocalTransferHandler;
import java.awt.Color;
import java.awt.Component;
import java.util.Collection;
import java.util.LinkedHashSet;
import java.util.Set;
import javax.swing.JComponent;
import javax.swing.JTree;
import javax.swing.tree.DefaultMutableTreeNode;
import javax.swing.tree.DefaultTreeCellRenderer;
import javax.swing.tree.MutableTreeNode;
import javax.swing.tree.TreeCellRenderer;
import javax.swing.tree.TreeModel;
import javax.swing.tree.TreePath;
import org.grinvin.graphs.GraphURIType;
import org.grinvin.invariants.Invariant;
import org.grinvin.invariants.InvariantFactory;
import org.grinvin.invariants.InvariantManager;
import org.grinvin.invariants.InvariantManagerListener;
import org.grinvin.list.invariants.InvariantTreeModel;
/**
* Tree component with leaves of type {@link Invariant}. Provides drag support
* for invariants. Dropping is not allowed.
*/
public class InvariantTreeComponent extends JTree {
// shared transfer handler
private static final LocalTransferHandler TRANSFER_HANDLER;
// shared instance
private static final TreeCellRenderer RENDERER = new TreeRenderer ();
static {
TRANSFER_HANDLER = new LocalTransferHandler ();
TRANSFER_HANDLER.setDragHandler (new InvariantTreeDragHandler ());
}
/** Creates a new instance of InvariantList */
public InvariantTreeComponent (InvariantTreeModel model) {
super (model);
setTransferHandler (TRANSFER_HANDLER);
setDragEnabled (true);
setCellRenderer (RENDERER);
setRootVisible (false);
setShowsRootHandles (true);
//expandRow (0);
if (model.getInsertionPoint ("local") != null)
InvariantManager.getInstance ().addListener (
new NewInvariantListener ());
}
// drag handler for lists of type SomeList
private static class InvariantTreeDragHandler implements DragHandler {
InvariantTreeDragHandler () {
// avoid creation of access type
}
//
public int getSourceActions (JComponent source) {
return LocalTransferHandler.COPY;
}
//
public void exportDone (JComponent source, JComponent target, Object[] objects, Class<?> type, int action) {
// MOVE not supported
}
//
private static final Object[] DUMMY_ARRAY = new Object[0];
/**
* Either exports an array of invariants or a single invariant factory.
*/
public Object getExportedObjects (JComponent source) {
// TODO: check for incompatible multiple selections
TreePath[] paths = getSelectedChildren(((InvariantTreeComponent)source).getSelectionPaths(), ((InvariantTreeComponent)source).getModel());
Object[] results = new Object[paths.length];
InvariantFactory factory = null;
int count = 0;
for (TreePath path : paths) {
Object obj = ((DefaultMutableTreeNode)path.getLastPathComponent ()).getUserObject ();
if (obj instanceof Invariant)
results[count++] = obj;
else if (obj instanceof InvariantFactory) {
factory = (InvariantFactory)obj;
}
}
if (count == 0) {
if (factory == null)
return DUMMY_ARRAY;
else
return factory;
} else if (count == results.length) {
return results; // most common case
} else {
// discards the factory
Object[] newResults = new Object[count];
System.arraycopy (results, 0, newResults, 0, count);
return newResults;
}
}
//
private TreePath[] getSelectedChildren(TreePath paths[], TreeModel model) {
Set<TreePath> result = new LinkedHashSet<TreePath>();
for(TreePath path : paths)
recurseChildren(path, model, result);
return result.toArray(new TreePath[0]);
}
//
private void recurseChildren(TreePath path, TreeModel model, Collection<TreePath> result) {
int childCount = model.getChildCount(path.getLastPathComponent());
if (childCount == 0)
result.add(path);
else
for(int i = 0; i<childCount; i++)
recurseChildren(path.pathByAddingChild(model.getChild(path.getLastPathComponent(), i)), model, result);
}
//
private static final Class INVARIANT = Invariant.class;
//
private static final Class INVARIANT_FACTORY = InvariantFactory.class;
//
public Class getExportedClass (JComponent source) {
TreePath[] paths = ((InvariantTreeComponent)source).getSelectionPaths ();
boolean hasFactory = false;
int count = 0;
for (TreePath path : paths) {
Object obj = ((DefaultMutableTreeNode)path.getLastPathComponent ()).getUserObject ();
if (obj instanceof Invariant)
count ++;
else if (obj instanceof InvariantFactory) {
hasFactory = true;
}
}
if (count == 0 && hasFactory)
return INVARIANT_FACTORY;
else
return INVARIANT;
}
//
public boolean isTransferAllowed (JComponent source, JComponent target) {
return true;
}
}
//
private static class TreeRenderer extends DefaultTreeCellRenderer {
//
private final Color stdNonSelectionColor;
//
private final Color stdSelectionColor;
//
public TreeRenderer() {
this.stdNonSelectionColor = getTextNonSelectionColor();
this.stdSelectionColor = getTextSelectionColor();
}
//
public Component getTreeCellRendererComponent (JTree tree, Object value, boolean sel, boolean expanded, boolean leaf, int row, boolean hasFocus) {
// displays invariants as leaf nodes
if (value instanceof DefaultMutableTreeNode) {
Object userObject = ((DefaultMutableTreeNode)value).getUserObject ();
if (userObject instanceof Invariant) {
leaf = true;
setLeafIcon(GraphURIType.INVARIANT.getSmallIcon());
if (InvariantManager.getInstance().getInvariantComputerFor((Invariant)userObject) == null) {
setTextNonSelectionColor(Color.RED);
setTextSelectionColor(Color.RED);
} else {
setTextNonSelectionColor(stdNonSelectionColor);
setTextSelectionColor(stdSelectionColor);
}
} else if (userObject instanceof InvariantFactory) {
leaf = true;
setLeafIcon(GraphURIType.INVARIANT_FACTORY.getSmallIcon());
if (InvariantManager.getInstance().getInvariantComputerFactoryFor(((InvariantFactory)userObject).getId()) == null) {
setTextNonSelectionColor(Color.RED);
setTextSelectionColor(Color.RED);
} else {
setTextNonSelectionColor(stdNonSelectionColor);
setTextSelectionColor(stdSelectionColor);
}
} else {
leaf = false;
setTextNonSelectionColor(stdNonSelectionColor);
setTextSelectionColor(stdSelectionColor);
}
}
super.getTreeCellRendererComponent (tree, value, sel, expanded, leaf, row, hasFocus);
return this;
}
}
//
// append a node to the local subtree
void appendNode (Object obj) {
InvariantTreeModel model = (InvariantTreeModel)getModel ();
MutableTreeNode local = model.getInsertionPoint ("local");
if (local != null) {
MutableTreeNode newNode = new DefaultMutableTreeNode (obj, false);
model.insertNodeInto (newNode , local, local.getChildCount ());
makeVisible (new TreePath (model.getPathToRoot (newNode)));
}
}
/**
* Listener which reacts to the introduction of new invariants or invariant
* factories by adding them to the last sub-tree of the tree node.
*/
private class NewInvariantListener implements InvariantManagerListener {
NewInvariantListener () {
// avoid creation of access type
}
public void newInvariantFactory (InvariantFactory factory) {
appendNode (factory);
}
public void newInvariant (Invariant invariant) {
appendNode (invariant);
}
}
}
|