public void updateModel(
List<? extends ChangeList> changeLists,
Trinity<List<VirtualFile>, Integer, Integer> unversionedFiles,
final List<LocallyDeletedChange> locallyDeletedFiles,
List<VirtualFile> modifiedWithoutEditing,
MultiMap<String, VirtualFile> switchedFiles,
@Nullable Map<VirtualFile, String> switchedRoots,
@Nullable List<VirtualFile> ignoredFiles,
final List<VirtualFile> lockedFolders,
@Nullable final Map<VirtualFile, LogicalLock> logicallyLockedFiles) {
TreeModelBuilder builder = new TreeModelBuilder(myProject, isShowFlatten());
final DefaultTreeModel model =
builder.buildModel(
changeLists,
unversionedFiles,
locallyDeletedFiles,
modifiedWithoutEditing,
switchedFiles,
switchedRoots,
ignoredFiles,
lockedFolders,
logicallyLockedFiles);
storeState();
DefaultTreeModel oldModel = getModel();
setModel(model);
setCellRenderer(new ChangesBrowserNodeRenderer(myProject, isShowFlatten(), true));
ChangesBrowserNode root = (ChangesBrowserNode) model.getRoot();
expandPath(new TreePath(root.getPath()));
restoreState();
expandDefaultChangeList(oldModel, root);
}
/**
* Update the layouts tree.
*
* @param current The name of the current layout or <CODE>null</CODE> if none.
*/
public void updateLayouts(Path current) throws PipelineException {
DefaultMutableTreeNode root = null;
{
root = new DefaultMutableTreeNode(new TreeData(), true);
{
Path path = new Path(PackageInfo.getSettingsPath(), "layouts");
rebuildTreeModel(path, new Path("/"), root);
}
DefaultTreeModel model = (DefaultTreeModel) pTree.getModel();
model.setRoot(root);
{
Enumeration e = root.depthFirstEnumeration();
if (e != null) {
while (e.hasMoreElements()) {
DefaultMutableTreeNode tnode = (DefaultMutableTreeNode) e.nextElement();
pTree.expandPath(new TreePath(tnode.getPath()));
}
}
}
}
pTree.clearSelection();
if (current != null) {
TreePath tpath = null;
DefaultMutableTreeNode tnode = root;
for (String comp : current.getComponents()) {
DefaultMutableTreeNode next = null;
Enumeration e = tnode.children();
if (e != null) {
while (e.hasMoreElements()) {
DefaultMutableTreeNode child = (DefaultMutableTreeNode) e.nextElement();
TreeData data = (TreeData) child.getUserObject();
if (data.toString().equals(comp)) {
tpath = new TreePath(child.getPath());
next = child;
break;
}
}
}
if (next == null) break;
tnode = next;
}
if (tpath != null) {
pTree.setSelectionPath(tpath);
pTree.makeVisible(tpath);
}
}
}
@Nullable
private TreePath findOption(@NotNull Object nodeObject, @NotNull DescriptorMatcher matcher) {
for (int i = 0; i < myTreeModel.getChildCount(nodeObject); i++) {
Object childObject = myTreeModel.getChild(nodeObject, i);
if (childObject instanceof MyTreeNode) {
Object data = ((MyTreeNode) childObject).getUserObject();
if (matcher.matches(data)) {
return new TreePath(myTreeModel.getPathToRoot((MyTreeNode) childObject));
}
}
TreePath pathInChild = findOption(childObject, matcher);
if (pathInChild != null) return pathInChild;
}
return null;
}
// {{{ removeSelectedNode() method
private void removeSelectedNode() {
TreePath path = resultTree.getSelectionPath();
if (path == null) return;
MutableTreeNode value = (MutableTreeNode) path.getLastPathComponent();
if (path.getPathCount() > 1) {
// Adjust selection so that repeating some removals
// behave naturally.
TreePath parentPath = path.getParentPath();
MutableTreeNode parent = (MutableTreeNode) parentPath.getLastPathComponent();
int removingIndex = parent.getIndex(value);
int nextIndex = removingIndex + 1;
if (nextIndex < parent.getChildCount()) {
TreeNode next = parent.getChildAt(nextIndex);
resultTree.setSelectionPath(parentPath.pathByAddingChild(next));
} else {
resultTree.setSelectionPath(parentPath);
}
resultTreeModel.removeNodeFromParent(value);
}
HyperSearchOperationNode.removeNodeFromCache(value);
if (resultTreeRoot.getChildCount() == 0) {
hideDockable();
}
} // }}}
private static IndexTreePathState removeLastPathComponent(
final DefaultTreeModel model, final TreePath pathToBeRemoved) {
final IndexTreePathState selectionState = new IndexTreePathState(pathToBeRemoved);
if (((MutableTreeNode) pathToBeRemoved.getLastPathComponent()).getParent() == null)
return selectionState;
model.removeNodeFromParent((MutableTreeNode) pathToBeRemoved.getLastPathComponent());
return selectionState;
}
public void nodeAdded(String fqn) {
MyNode n, p;
n = root.add(fqn);
if (n != null) {
p = (MyNode) n.getParent();
tree_model.reload(p);
jtree.scrollPathToVisible(new TreePath(n.getPath()));
}
}
/* Simple tree node factory method - set's parent and user object.
*/
private DefaultMutableTreeNode makeNode(Object userObject, MutableTreeNode parent) {
DefaultMutableTreeNode node = new DefaultMutableTreeNode(userObject);
if (parent != null) {
treeModel.insertNodeInto(node, parent, parent.getChildCount());
}
return node;
}
public void nodeRemoved(String fqn) {
MyNode n;
TreeNode par;
n = root.findNode(fqn);
if (n != null) {
n.removeAllChildren();
par = n.getParent();
n.removeFromParent();
tree_model.reload(par);
}
}
public void selectOptionByName(@NotNull final String optionName) {
selectPath(
findOption(
myTreeModel.getRoot(),
new DescriptorMatcher() {
@Override
public boolean matches(@NotNull Object data) {
return !optionName.isEmpty()
&& StringUtil.containsIgnoreCase(data.toString(), optionName);
}
}));
}
protected void doSort() {
Pair<ElementNode, List<ElementNode>> pair = storeSelection();
Enumeration<ParentNode> children = getRootNodeChildren();
while (children.hasMoreElements()) {
ParentNode classNode = children.nextElement();
sortNode(classNode, myComparator);
myTreeModel.nodeStructureChanged(classNode);
}
restoreSelection(pair);
}
protected void restoreTree() {
Pair<ElementNode, List<ElementNode>> selection = storeSelection();
DefaultMutableTreeNode root = getRootNode();
if (!myShowClasses || myContainerNodes.isEmpty()) {
List<ParentNode> otherObjects = new ArrayList<ParentNode>();
Enumeration<ParentNode> children = getRootNodeChildren();
ParentNode newRoot =
new ParentNode(
null, new MemberChooserObjectBase(getAllContainersNodeName()), new Ref<Integer>(0));
while (children.hasMoreElements()) {
final ParentNode nextElement = children.nextElement();
if (nextElement instanceof ContainerNode) {
final ContainerNode containerNode = (ContainerNode) nextElement;
Enumeration<MemberNode> memberNodes = containerNode.children();
List<MemberNode> memberNodesList = new ArrayList<MemberNode>();
while (memberNodes.hasMoreElements()) {
memberNodesList.add(memberNodes.nextElement());
}
for (MemberNode memberNode : memberNodesList) {
newRoot.add(memberNode);
}
} else {
otherObjects.add(nextElement);
}
}
replaceChildren(root, otherObjects);
sortNode(newRoot, myComparator);
if (newRoot.children().hasMoreElements()) root.add(newRoot);
} else {
Enumeration<ParentNode> children = getRootNodeChildren();
while (children.hasMoreElements()) {
ParentNode allClassesNode = children.nextElement();
Enumeration<MemberNode> memberNodes = allClassesNode.children();
ArrayList<MemberNode> arrayList = new ArrayList<MemberNode>();
while (memberNodes.hasMoreElements()) {
arrayList.add(memberNodes.nextElement());
}
Collections.sort(arrayList, myComparator);
for (MemberNode memberNode : arrayList) {
myNodeToParentMap.get(memberNode).add(memberNode);
}
}
replaceChildren(root, myContainerNodes);
}
myTreeModel.nodeStructureChanged(root);
defaultExpandTree();
restoreSelection(selection);
}
public void selectOptionByType(@NotNull final String attributeType) {
selectPath(
findOption(
myTreeModel.getRoot(),
new DescriptorMatcher() {
@Override
public boolean matches(@NotNull Object data) {
if (data instanceof EditorSchemeAttributeDescriptor) {
return attributeType.equals(((EditorSchemeAttributeDescriptor) data).getType());
}
return false;
}
}));
}
public void fillOptions(@NotNull ColorAndFontOptions options) {
DefaultMutableTreeNode root = new DefaultMutableTreeNode();
for (EditorSchemeAttributeDescriptor description : getOrderedDescriptors(options)) {
if (!description.getGroup().equals(myCategoryName)) continue;
List<String> path = extractPath(description);
if (path != null && path.size() > 1) {
MyTreeNode groupNode = ensureGroup(root, path, 0);
groupNode.add(new MyTreeNode(description, path.get(path.size() - 1)));
} else {
root.add(new MyTreeNode(description));
}
}
myTreeModel.setRoot(root);
}
private void expandDefaultChangeList(DefaultTreeModel oldModel, ChangesBrowserNode root) {
if (((ChangesBrowserNode) oldModel.getRoot()).getCount() == 0
&& TreeUtil.collectExpandedPaths(this).size() == 1) {
TreeNode toExpand = null;
for (int i = 0; i < root.getChildCount(); i++) {
TreeNode node = root.getChildAt(i);
if (node instanceof ChangesBrowserChangeListNode && node.getChildCount() > 0) {
ChangeList object = ((ChangesBrowserChangeListNode) node).getUserObject();
if (object instanceof LocalChangeList) {
if (((LocalChangeList) object).isDefault()) {
toExpand = node;
break;
}
}
}
}
if (toExpand != null) {
expandPath(new TreePath(new Object[] {root, toExpand}));
}
}
}
protected DefaultMutableTreeNode getRootNode() {
return (DefaultMutableTreeNode) myTreeModel.getRoot();
}
// {{{ removeAllNodes() method
private void removeAllNodes() {
resultTreeRoot.removeAllChildren();
resultTreeModel.reload(resultTreeRoot);
setSearchStatus(null);
hideDockable();
} // }}}
public static void sort(final DefaultTreeModel model, final Comparator comparator) {
sort((DefaultMutableTreeNode) model.getRoot(), comparator);
}
/* Clear all existing nodes from the tree model and rebuild from scratch.
*/
protected void refreshTree() {
DefaultMutableTreeNode propertiesNode;
DefaultMutableTreeNode leaf;
// First clear the existing tree by simply enumerating
// over the root node's children and removing them one by one.
while (treeModel.getChildCount(rootNode) > 0) {
DefaultMutableTreeNode child = (DefaultMutableTreeNode) treeModel.getChild(rootNode, 0);
treeModel.removeNodeFromParent(child);
child.removeAllChildren();
child.removeFromParent();
}
treeModel.nodeStructureChanged(rootNode);
treeModel.reload();
tScrollPane.repaint();
// Now rebuild the tree below its root
try {
// Start by naming the root node from its URL:
rootNode.setUserObject(dMeta.getURL());
// get metadata about user tables by building a vector of table names
String usertables[] = {"TABLE", "GLOBAL TEMPORARY", "VIEW"};
ResultSet result = dMeta.getTables(null, null, null, usertables);
Vector tables = new Vector();
// sqlbob@users Added remarks.
Vector remarks = new Vector();
while (result.next()) {
tables.addElement(result.getString(3));
remarks.addElement(result.getString(5));
}
result.close();
// For each table, build a tree node with interesting info
for (int i = 0; i < tables.size(); i++) {
String name = (String) tables.elementAt(i);
DefaultMutableTreeNode tableNode = makeNode(name, rootNode);
ResultSet col = dMeta.getColumns(null, null, name, null);
// sqlbob@users Added remarks.
String remark = (String) remarks.elementAt(i);
if ((remark != null) && !remark.trim().equals("")) {
makeNode(remark, tableNode);
}
// With a child for each column containing pertinent attributes
while (col.next()) {
String c = col.getString(4);
DefaultMutableTreeNode columnNode = makeNode(c, tableNode);
String type = col.getString(6);
makeNode("Type: " + type, columnNode);
boolean nullable = col.getInt(11) != DatabaseMetaData.columnNoNulls;
makeNode("Nullable: " + nullable, columnNode);
}
col.close();
DefaultMutableTreeNode indexesNode = makeNode("Indices", tableNode);
ResultSet ind = dMeta.getIndexInfo(null, null, name, false, false);
String oldiname = null;
// A child node to contain each index - and its attributes
while (ind.next()) {
DefaultMutableTreeNode indexNode = null;
boolean nonunique = ind.getBoolean(4);
String iname = ind.getString(6);
if ((oldiname == null || !oldiname.equals(iname))) {
indexNode = makeNode(iname, indexesNode);
makeNode("Unique: " + !nonunique, indexNode);
oldiname = iname;
}
// And the ordered column list for index components
makeNode(ind.getString(9), indexNode);
}
ind.close();
}
// Finally - a little additional metadata on this connection
propertiesNode = makeNode("Properties", rootNode);
makeNode("User: "******"ReadOnly: " + cConn.isReadOnly(), propertiesNode);
makeNode("AutoCommit: " + cConn.getAutoCommit(), propertiesNode);
makeNode("Driver: " + dMeta.getDriverName(), propertiesNode);
makeNode("Product: " + dMeta.getDatabaseProductName(), propertiesNode);
makeNode("Version: " + dMeta.getDatabaseProductVersion(), propertiesNode);
} catch (SQLException se) {
propertiesNode = makeNode("Error getting metadata:", rootNode);
makeNode(se.getMessage(), propertiesNode);
makeNode(se.getSQLState(), propertiesNode);
}
treeModel.nodeStructureChanged(rootNode);
treeModel.reload();
tScrollPane.repaint();
}