Files
jpexs-decompiler/trunk/src/com/jpexs/asdec/abc/gui/TreeElement.java
T

169 lines
4.3 KiB
Java

/*
* Copyright (C) 2011 Paolo Cancedda, JPEXS
*
* 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.
*
* You should have received a copy of the GNU 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, USA.
*/
package com.jpexs.asdec.abc.gui;
import java.util.*;
import javax.swing.tree.TreePath;
public class TreeElement {
private SortedMap<String, TreeElement> branches;
private SortedMap<String, TreeElement> leafs;
private String name;
private String path;
private int classIndex;
private TreeElement parent;
public TreeElement(String name, String path, int classIndex, TreeElement parent) {
this.name = name;
this.path = path;
this.classIndex = classIndex;
this.parent = parent;
branches = new TreeMap<String, TreeElement>();
leafs = new TreeMap<String, TreeElement>();
}
public TreeElement getParent() {
return parent;
}
public String getName() {
return name;
}
public String getPath() {
return path;
}
public TreePath getTreePath() {
List<TreeElement> pathList = new ArrayList<TreeElement>();
TreeElement temp=this;
do{
pathList.add(0,temp);
}
while((temp=temp.getParent())!=null);
return new TreePath(pathList.toArray());
}
public int getClassIndex() {
return classIndex;
}
@Override
public String toString() {
return name;
}
TreeElement getBranch(String pathElement) {
TreeElement branch = branches.get(pathElement);
if (branch == null) {
branch = new TreeElement(pathElement, path+"."+pathElement, -1, this);
branches.put(pathElement, branch);
}
return branch;
}
void addLeaf(String pathElement, int classIndex) {
TreeElement child = new TreeElement(pathElement, path+"."+pathElement, classIndex, this);
leafs.put(pathElement, child);
}
public TreeElement getChild(int index) {
Iterator<TreeElement> iter;
int startingIndex;
if (index < branches.size()) {
iter = branches.values().iterator();
startingIndex = 0;
} else {
iter = leafs.values().iterator();
startingIndex = branches.size();
}
int ii = startingIndex;
TreeElement child = null;
while (ii <= index && iter.hasNext()) {
child = iter.next();
ii++;
}
return child;
}
public int getChildCount() {
return branches.size() + leafs.size();
}
public boolean isLeaf() {
return getChildCount() == 0;
}
public int getIndexOfChild(TreeElement child) {
if (getChildCount() < 1) {
return -1;
}
Iterator<TreeElement> iter = branches.values().iterator();
int ii = 0;
TreeElement aChild = null;
while (aChild != child && iter.hasNext()) {
aChild = iter.next();
if (aChild == child) {
return ii;
}
ii++;
}
iter = leafs.values().iterator();
while (aChild != child && iter.hasNext()) {
aChild = iter.next();
if (aChild == child) {
return ii;
}
ii++;
}
return -1;
}
void visitBranches(TreeVisitor visitor) {
Iterator<TreeElement> iter = branches.values().iterator();
while (iter.hasNext()) {
TreeElement branch = iter.next();
visitor.onBranch(branch);
branch.visitLeafs(visitor);
branch.visitBranches(visitor);
}
}
void visitLeafs(TreeVisitor visitor) {
Iterator<TreeElement> iter = leafs.values().iterator();
while (iter.hasNext()) {
TreeElement leaf = iter.next();
visitor.onLeaf(leaf);
}
}
TreeElement getByPath(String fullPath) {
TreeElement te = this;
StringTokenizer st = new StringTokenizer(fullPath, ".");
while (st.hasMoreTokens()) {
String pathElement = st.nextToken();
TreeElement nte = te.branches.get(pathElement);
if (nte == null) {
nte = te.leafs.get(pathElement);
}
te = nte;
}
return te;
}
}