1 package org.simantics.browsing.ui.nattable;
\r
3 import java.util.ArrayList;
\r
4 import java.util.Collection;
\r
5 import java.util.Collections;
\r
6 import java.util.HashSet;
\r
7 import java.util.List;
\r
9 import org.eclipse.nebula.widgets.nattable.tree.ITreeData;
\r
10 import org.eclipse.nebula.widgets.nattable.tree.ITreeRowModel;
\r
11 import org.eclipse.nebula.widgets.nattable.tree.ITreeRowModelListener;
\r
13 import it.unimi.dsi.fastutil.ints.IntOpenHashSet;
\r
16 * ITreeRowModel that does not automatically expand all child nodes (as TreeRowModel does).
\r
18 * @author Marko Luukkainen <marko.luukkainen@vtt.fi>
\r
22 public class GETreeRowModel<T> implements ITreeRowModel<T>{
\r
23 //private final HashSet<Integer> parentIndexes = new HashSet<Integer>();
\r
24 //private final TIntHashSet parentIndexes = new TIntHashSet(1000, 0.8f);
\r
25 private final IntOpenHashSet expandedIndexes = new IntOpenHashSet();
\r
27 private final Collection<ITreeRowModelListener> listeners = new HashSet<ITreeRowModelListener>();
\r
29 private final ITreeData<T> treeData;
\r
31 public GETreeRowModel(ITreeData<T> treeData) {
\r
32 this.treeData = treeData;
\r
35 public void registerRowGroupModelListener(ITreeRowModelListener listener) {
\r
36 this.listeners.add(listener);
\r
39 public void notifyListeners() {
\r
40 for (ITreeRowModelListener listener : this.listeners) {
\r
41 listener.treeRowModelChanged();
\r
45 public int depth(int index) {
\r
46 return this.treeData.getDepthOfData(this.treeData.getDataAtIndex(index));
\r
49 public boolean isLeaf(int index) {
\r
50 return !hasChildren(index);
\r
53 public String getObjectAtIndexAndDepth(int index, int depth) {
\r
54 return this.treeData.formatDataForDepth(depth,this.treeData.getDataAtIndex(index));
\r
57 public boolean hasChildren(int index) {
\r
58 return this.treeData.hasChildren(this.treeData.getDataAtIndex(index));
\r
61 public boolean isCollapsed(int index) {
\r
62 return !this.expandedIndexes.contains(index);
\r
65 public void clear() {
\r
66 this.expandedIndexes.clear();
\r
70 public boolean isCollapsible(int index) {
\r
71 return hasChildren(index);
\r
75 public List<Integer> collapse(int index) {
\r
76 this.expandedIndexes.remove(index);
\r
78 List<Integer> list = getChildIndexes(index);
\r
79 //this.parentIndexes.addAll(list);
\r
86 public List<Integer> expand(int index) {
\r
87 this.expandedIndexes.add(index);
\r
89 List<Integer> children = getExpandedChildIndexes(index);
\r
94 public List<Integer> collapseAll() {
\r
100 public List<Integer> expandToLevel(int level) {
\r
101 // TODO Auto-generated method stub
\r
106 public List<Integer> expandToLevel(T object, int level) {
\r
107 // TODO Auto-generated method stub
\r
112 public List<Integer> expandAll() {
\r
113 // TODO Auto-generated method stub
\r
118 public List<Integer> expandToLevel(int parentIndex, int level) {
\r
119 // TODO Auto-generated method stub
\r
124 public List<T> getChildren(int parentIndex) {
\r
125 T t = treeData.getDataAtIndex(parentIndex);
\r
126 return treeData.getChildren(t,true);
\r
130 public List<T> getDirectChildren(int parentIndex) {
\r
131 return treeData.getChildren(parentIndex);
\r
136 public List<Integer> collapse(T object) {
\r
137 int index = treeData.indexOf(object);
\r
138 return collapse(index);
\r
142 public List<Integer> expand(T object) {
\r
143 int index = treeData.indexOf(object);
\r
144 return expand(index);
\r
148 public boolean isCollapsed(T object) {
\r
149 int index = treeData.indexOf(object);
\r
150 return isCollapsed(index);
\r
154 @SuppressWarnings("unchecked")
\r
155 public List<Integer> getChildIndexes(int parentIndex) {
\r
156 List<Integer> result = new ArrayList<Integer>();
\r
157 T t = this.treeData.getDataAtIndex(parentIndex);
\r
159 return Collections.EMPTY_LIST;
\r
160 List<T> children = this.treeData.getChildren(t);
\r
161 for (T child : children) {
\r
162 int index = this.treeData.indexOf(child);
\r
165 result.addAll(getChildIndexes(index));
\r
167 result.addAll(getChildIndexes(child));
\r
173 public List<Integer> getChildIndexes(T t) {
\r
174 List<Integer> result = new ArrayList<Integer>();
\r
175 List<T> children = this.treeData.getChildren(t);
\r
176 for (T child : children) {
\r
177 int index = this.treeData.indexOf(child);
\r
180 result.addAll(getChildIndexes(index));
\r
182 result.addAll(getChildIndexes(child));
\r
188 @SuppressWarnings("unchecked")
\r
189 public List<Integer> getExpandedChildIndexes(int parentIndex) {
\r
190 List<Integer> result = new ArrayList<Integer>();
\r
191 T t = this.treeData.getDataAtIndex(parentIndex);
\r
193 return Collections.EMPTY_LIST;
\r
194 List<T> children = this.treeData.getChildren(t);
\r
195 for (T child : children) {
\r
196 int index = this.treeData.indexOf(child);
\r
199 if (expandedIndexes.contains(index))
\r
200 result.addAll(getExpandedChildIndexes(index));
\r
202 result.addAll(getExpandedChildIndexes(child));
\r
208 public List<Integer> getExpandedChildIndexes(T t) {
\r
209 List<Integer> result = new ArrayList<Integer>();
\r
210 List<T> children = this.treeData.getChildren(t);
\r
211 for (T child : children) {
\r
212 int index = this.treeData.indexOf(child);
\r
215 if (expandedIndexes.contains(index))
\r
216 result.addAll(getExpandedChildIndexes(index));
\r
218 result.addAll(getExpandedChildIndexes(child));
\r
225 public List<Integer> getDirectChildIndexes(int parentIndex) {
\r
226 List<Integer> result = new ArrayList<Integer>();
\r
227 T t = this.treeData.getDataAtIndex(parentIndex);
\r
229 return Collections.EMPTY_LIST;
\r
230 List<T> children = this.treeData.getChildren(t);
\r
231 for (T child : children) {
\r
232 int index = this.treeData.indexOf(child);
\r
240 public ITreeData<T> getTreeData() {
\r