|
Lines 18-23
Link Here
|
| 18 |
import org.eclipse.swt.graphics.Rectangle; |
18 |
import org.eclipse.swt.graphics.Rectangle; |
| 19 |
import org.eclipse.swt.widgets.Control; |
19 |
import org.eclipse.swt.widgets.Control; |
| 20 |
import org.eclipse.swt.widgets.Item; |
20 |
import org.eclipse.swt.widgets.Item; |
|
|
21 |
import org.eclipse.swt.widgets.Tree; |
| 21 |
import org.eclipse.swt.widgets.TreeItem; |
22 |
import org.eclipse.swt.widgets.TreeItem; |
| 22 |
|
23 |
|
| 23 |
/** |
24 |
/** |
|
Lines 58-64
Link Here
|
| 58 |
* @see org.eclipse.jface.viewers.ViewerRow#getColumnCount() |
59 |
* @see org.eclipse.jface.viewers.ViewerRow#getColumnCount() |
| 59 |
*/ |
60 |
*/ |
| 60 |
public int getColumnCount() { |
61 |
public int getColumnCount() { |
| 61 |
return item.getParent().getItemCount(); |
62 |
return item.getParent().getColumnCount(); |
| 62 |
} |
63 |
} |
| 63 |
|
64 |
|
| 64 |
/* (non-Javadoc) |
65 |
/* (non-Javadoc) |
|
Lines 144-147
Link Here
|
| 144 |
public Control getControl() { |
145 |
public Control getControl() { |
| 145 |
return item.getParent(); |
146 |
return item.getParent(); |
| 146 |
} |
147 |
} |
|
|
148 |
|
| 149 |
|
| 150 |
public ViewerRow getNeighbor(int direction, boolean sameLevel) { |
| 151 |
if( direction == ViewerRow.ABOVE ) { |
| 152 |
return getRowAbove(sameLevel); |
| 153 |
} else if( direction == ViewerRow.BELOW ) { |
| 154 |
return getRowBelow(sameLevel); |
| 155 |
} else { |
| 156 |
throw new IllegalArgumentException("The given direction argument is not known!"); //$NON-NLS-1$ |
| 157 |
} |
| 158 |
} |
| 159 |
|
| 160 |
private ViewerRow getRowBelow(boolean sameLevel) { |
| 161 |
Tree tree = item.getParent(); |
| 162 |
|
| 163 |
// This means we have top-level item |
| 164 |
if( item.getParentItem() == null ) { |
| 165 |
if( sameLevel || ! item.getExpanded() ) { |
| 166 |
int index = tree.indexOf(item) + 1; |
| 167 |
|
| 168 |
if( index < tree.getItemCount() ) { |
| 169 |
return (ViewerRow)tree.getItem(index).getData(ViewerRow.ROWPART_KEY); |
| 170 |
} |
| 171 |
} else if( item.getExpanded() && item.getItemCount() > 0 ) { |
| 172 |
return (ViewerRow)item.getItem(0).getData(ViewerRow.ROWPART_KEY); |
| 173 |
} |
| 174 |
} else { |
| 175 |
if( sameLevel || ! item.getExpanded() ) { |
| 176 |
TreeItem parentItem = item.getParentItem(); |
| 177 |
|
| 178 |
int nextIndex = parentItem.indexOf(item) + 1; |
| 179 |
int totalIndex = parentItem.getItemCount(); |
| 180 |
|
| 181 |
TreeItem itemAfter; |
| 182 |
|
| 183 |
// This would mean that it was the last item |
| 184 |
if( nextIndex == totalIndex ) { |
| 185 |
itemAfter = findNextItem( parentItem ); |
| 186 |
} else { |
| 187 |
itemAfter = parentItem.getItem(nextIndex); |
| 188 |
} |
| 189 |
|
| 190 |
if( itemAfter != null ) { |
| 191 |
return (ViewerRow) itemAfter.getData(ViewerRow.ROWPART_KEY); |
| 192 |
} |
| 193 |
|
| 194 |
} else if( item.getExpanded() && item.getItemCount() > 0 ) { |
| 195 |
return (ViewerRow)item.getItem(0).getData(ViewerRow.ROWPART_KEY); |
| 196 |
} |
| 197 |
} |
| 198 |
|
| 199 |
return null; |
| 200 |
} |
| 201 |
|
| 202 |
private ViewerRow getRowAbove(boolean sameLevel) { |
| 203 |
Tree tree = item.getParent(); |
| 204 |
|
| 205 |
// This means we have top-level item |
| 206 |
if( item.getParentItem() == null ) { |
| 207 |
int index = tree.indexOf(item) - 1; |
| 208 |
TreeItem nextTopItem = null; |
| 209 |
|
| 210 |
if( index >= 0 ) { |
| 211 |
nextTopItem = tree.getItem(index); |
| 212 |
} |
| 213 |
|
| 214 |
if( nextTopItem != null ) { |
| 215 |
if( sameLevel ) { |
| 216 |
return (ViewerRow)nextTopItem.getData(ViewerRow.ROWPART_KEY); |
| 217 |
} |
| 218 |
|
| 219 |
return (ViewerRow) findLastVisibleItem(nextTopItem).getData(ViewerRow.ROWPART_KEY); |
| 220 |
} |
| 221 |
} else { |
| 222 |
TreeItem parentItem = item.getParentItem(); |
| 223 |
int previousIndex = parentItem.indexOf(item) - 1; |
| 224 |
|
| 225 |
TreeItem itemBefore; |
| 226 |
if( previousIndex >= 0 ) { |
| 227 |
if( sameLevel ) { |
| 228 |
itemBefore = parentItem.getItem(previousIndex); |
| 229 |
} else { |
| 230 |
itemBefore = findLowestLeave(parentItem.getItem(previousIndex)); |
| 231 |
} |
| 232 |
} else { |
| 233 |
itemBefore = parentItem; |
| 234 |
} |
| 235 |
|
| 236 |
if( itemBefore != null ) { |
| 237 |
return (ViewerRow) itemBefore.getData(ViewerRow.ROWPART_KEY); |
| 238 |
} |
| 239 |
} |
| 240 |
|
| 241 |
return null; |
| 242 |
} |
| 243 |
|
| 244 |
private TreeItem findLastVisibleItem(TreeItem parentItem) { |
| 245 |
TreeItem rv = parentItem; |
| 246 |
|
| 247 |
if( rv.getExpanded() && rv.getItemCount() > 0 ) { |
| 248 |
rv = findLastVisibleItem(rv.getItem(rv.getItemCount()-1)); |
| 249 |
} |
| 250 |
|
| 251 |
return rv; |
| 252 |
} |
| 253 |
|
| 254 |
private TreeItem findLowestLeave(TreeItem item) { |
| 255 |
TreeItem rv = item; |
| 256 |
|
| 257 |
if( rv.getExpanded() && rv.getItemCount() > 0 ) { |
| 258 |
rv = findLowestLeave(rv.getItem(rv.getItemCount()-1)); |
| 259 |
} |
| 260 |
|
| 261 |
return rv; |
| 262 |
} |
| 263 |
|
| 264 |
private TreeItem findNextItem(TreeItem item) { |
| 265 |
TreeItem rv = null; |
| 266 |
Tree tree = item.getParent(); |
| 267 |
TreeItem parentItem = item.getParentItem(); |
| 268 |
|
| 269 |
int nextIndex; |
| 270 |
int totalItems; |
| 271 |
|
| 272 |
if( parentItem == null ) { |
| 273 |
nextIndex = tree.indexOf(item) + 1; |
| 274 |
totalItems = tree.getItemCount(); |
| 275 |
} else { |
| 276 |
nextIndex = parentItem.indexOf(item) + 1; |
| 277 |
totalItems = parentItem.getItemCount(); |
| 278 |
} |
| 279 |
|
| 280 |
// This is once more the last item in the tree |
| 281 |
// Search on |
| 282 |
if( nextIndex == totalItems ) { |
| 283 |
if( item.getParentItem() != null ) { |
| 284 |
rv = findNextItem(item.getParentItem()); |
| 285 |
} |
| 286 |
} else { |
| 287 |
if( parentItem == null ) { |
| 288 |
rv = tree.getItem(nextIndex); |
| 289 |
} else { |
| 290 |
rv = parentItem.getItem(nextIndex); |
| 291 |
} |
| 292 |
} |
| 293 |
|
| 294 |
return rv; |
| 295 |
} |
| 296 |
|
| 297 |
|
| 147 |
} |
298 |
} |