Mercurial > projects > dwt-addons
annotate dwtx/jface/viewers/AbstractTreeViewer.d @ 71:4878bef4a38e
Some fixing
| author | Frank Benoit <benoit@tionex.de> |
|---|---|
| date | Thu, 22 May 2008 04:03:58 +0200 |
| parents | 46a6e0e6ccd4 |
| children | 5df4896124c7 |
| rev | line source |
|---|---|
| 10 | 1 /******************************************************************************* |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2 * Copyright (c) 2000, 2008 IBM Corporation and others. |
| 10 | 3 * All rights reserved. This program and the accompanying materials |
| 4 * are made available under the terms of the Eclipse Public License v1.0 | |
| 5 * which accompanies this distribution, and is available at | |
| 6 * http://www.eclipse.org/legal/epl-v10.html | |
| 7 * | |
| 8 * Contributors: | |
| 9 * IBM Corporation - initial API and implementation | |
| 10 * Tom Schindl <tom.schindl@bestsolution.at> - bug 153993, bug 167323, bug 175192 | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
11 * Lasse Knudsen, bug 205700 |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
12 * Micah Hainline, bug 210448 |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
13 * Michael Schneider, bug 210747 |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
14 * Bruce Sutton, bug 221768 |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
15 * Matthew Hall, bug 221988 |
| 10 | 16 * Port to the D programming language: |
| 17 * Frank Benoit <benoit@tionex.de> | |
| 18 *******************************************************************************/ | |
| 19 | |
| 20 module dwtx.jface.viewers.AbstractTreeViewer; | |
| 21 | |
| 22 import dwtx.jface.viewers.ColumnViewer; | |
| 23 import dwtx.jface.viewers.TreePath; | |
| 24 import dwtx.jface.viewers.ViewerComparator; | |
| 25 import dwtx.jface.viewers.ITreeViewerListener; | |
| 26 import dwtx.jface.viewers.TreeExpansionEvent; | |
| 27 import dwtx.jface.viewers.CustomHashtable; | |
| 28 import dwtx.jface.viewers.IContentProvider; | |
| 29 import dwtx.jface.viewers.ISelection; | |
| 30 import dwtx.jface.viewers.ColumnViewerEditor; | |
| 31 import dwtx.jface.viewers.ViewerLabel; | |
| 32 import dwtx.jface.viewers.ViewerRow; | |
| 33 import dwtx.jface.viewers.TreePathViewerSorter; | |
| 34 import dwtx.jface.viewers.ViewerFilter; | |
| 35 import dwtx.jface.viewers.ViewerColumn; | |
| 36 import dwtx.jface.viewers.ViewerCell; | |
| 37 import dwtx.jface.viewers.ITreePathContentProvider; | |
| 38 import dwtx.jface.viewers.ITreeContentProvider; | |
| 39 import dwtx.jface.viewers.TreeSelection; | |
| 40 import dwtx.jface.viewers.DoubleClickEvent; | |
| 41 import dwtx.jface.viewers.IElementComparer; | |
| 42 import dwtx.jface.viewers.ITreeSelection; | |
| 43 import dwtx.jface.viewers.IBaseLabelProvider; | |
| 44 import dwtx.jface.viewers.ITreePathLabelProvider; | |
| 45 | |
| 46 import tango.util.collection.LinkSeq; | |
| 47 import tango.util.collection.ArraySeq; | |
| 48 import tango.util.collection.model.Seq; | |
| 49 import tango.util.collection.model.SeqView; | |
| 50 | |
| 51 | |
| 52 import dwt.DWT; | |
| 53 import dwt.custom.BusyIndicator; | |
| 54 import dwt.events.SelectionEvent; | |
| 55 import dwt.events.SelectionListener; | |
| 56 import dwt.events.TreeEvent; | |
| 57 import dwt.events.TreeListener; | |
| 58 import dwt.graphics.Point; | |
| 59 import dwt.widgets.Control; | |
| 60 import dwt.widgets.Item; | |
| 61 import dwt.widgets.Widget; | |
| 62 import dwtx.core.runtime.Assert; | |
| 63 import dwtx.core.runtime.ListenerList; | |
| 64 import dwtx.jface.util.SafeRunnable; | |
| 65 | |
| 66 import dwt.dwthelper.utils; | |
| 67 import dwt.dwthelper.Runnable; | |
| 68 | |
| 69 /** | |
| 70 * Abstract base implementation for tree-structure-oriented viewers (trees and | |
| 71 * table trees). | |
| 72 * <p> | |
| 73 * Nodes in the tree can be in either an expanded or a collapsed state, | |
| 74 * depending on whether the children on a node are visible. This class | |
| 75 * introduces public methods for controlling the expanding and collapsing of | |
| 76 * nodes. | |
| 77 * </p> | |
| 78 * <p> | |
| 79 * As of 3.2, AbstractTreeViewer supports multiple equal elements (each with a | |
| 80 * different parent chain) in the tree. This support requires that clients | |
| 81 * enable the element map by calling <code>setUseHashLookup(true)</code>. | |
| 82 * </p> | |
| 83 * <p> | |
| 84 * Content providers for abstract tree viewers must implement one of the | |
| 85 * interfaces <code>ITreeContentProvider</code> or (as of 3.2, to support | |
| 86 * multiple equal elements) <code>ITreePathContentProvider</code>. | |
| 87 * </p> | |
| 88 * | |
| 89 * @see TreeViewer | |
| 90 */ | |
| 91 public abstract class AbstractTreeViewer : ColumnViewer { | |
| 92 alias ColumnViewer.buildLabel buildLabel; | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
93 alias ColumnViewer.filter filter; |
| 10 | 94 alias ColumnViewer.setSelection setSelection; |
| 95 | |
| 96 /** | |
| 97 * Constant indicating that all levels of the tree should be expanded or | |
| 98 * collapsed. | |
| 99 * | |
| 100 * @see #expandToLevel(int) | |
| 101 * @see #collapseToLevel(Object, int) | |
| 102 */ | |
| 103 public static const int ALL_LEVELS = -1; | |
| 104 | |
| 105 /** | |
| 106 * List of registered tree listeners (element type: | |
| 107 * <code>TreeListener</code>). | |
| 108 */ | |
| 109 private ListenerList treeListeners; | |
| 110 | |
| 111 /** | |
| 112 * The level to which the tree is automatically expanded each time the | |
| 113 * viewer's input is changed (that is, by <code>setInput</code>). A value | |
| 114 * of 0 means that auto-expand is off. | |
| 115 * | |
| 116 * @see #setAutoExpandLevel | |
| 117 */ | |
| 118 private int expandToLevel_ = 0; | |
| 119 | |
| 120 /** | |
| 121 * Safe runnable used to update an item. | |
| 122 */ | |
| 123 class UpdateItemSafeRunnable : SafeRunnable { | |
| 124 private Object element; | |
| 125 | |
| 126 private Item item; | |
| 127 | |
| 128 this(Item item, Object element) { | |
| 129 this.item = item; | |
| 130 this.element = element; | |
| 131 } | |
| 132 | |
| 133 public void run() { | |
| 134 doUpdateItem(item, element); | |
| 135 } | |
| 136 | |
| 137 } | |
| 138 | |
| 139 /** | |
| 140 * Creates an abstract tree viewer. The viewer has no input, no content | |
| 141 * provider, a default label provider, no sorter, no filters, and has | |
| 142 * auto-expand turned off. | |
| 143 */ | |
| 144 protected this() { | |
| 145 treeListeners = new ListenerList(); | |
| 146 // do nothing | |
| 147 } | |
| 148 | |
| 149 /** | |
| 150 * Adds the given child elements to this viewer as children of the given | |
| 151 * parent element. If this viewer does not have a sorter, the elements are | |
| 152 * added at the end of the parent's list of children in the order given; | |
| 153 * otherwise, the elements are inserted at the appropriate positions. | |
| 154 * <p> | |
| 155 * This method should be called (by the content provider) when elements have | |
| 156 * been added to the model, in order to cause the viewer to accurately | |
| 157 * reflect the model. This method only affects the viewer, not the model. | |
| 158 * </p> | |
| 159 * | |
| 160 * @param parentElementOrTreePath | |
| 161 * the parent element | |
| 162 * @param childElements | |
| 163 * the child elements to add | |
| 164 */ | |
| 165 public void add(Object parentElementOrTreePath, Object[] childElements) { | |
| 166 Assert.isNotNull(parentElementOrTreePath); | |
| 167 assertElementsNotNull(childElements); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
168 if (checkBusy()) |
| 10 | 169 return; |
| 170 Widget[] widgets = internalFindItems(parentElementOrTreePath); | |
| 171 // If parent hasn't been realized yet, just ignore the add. | |
| 172 if (widgets.length is 0) { | |
| 173 return; | |
| 174 } | |
| 175 | |
| 176 for (int i = 0; i < widgets.length; i++) { | |
| 177 internalAdd(widgets[i], parentElementOrTreePath, childElements); | |
| 178 } | |
| 179 } | |
| 180 | |
| 181 /** | |
| 182 * Find the items for the given element of tree path | |
| 183 * | |
| 184 * @param parentElementOrTreePath | |
| 185 * the element or tree path | |
| 186 * @return the items for that element | |
| 187 * | |
| 188 * @since 3.3 | |
| 189 */ | |
| 190 final protected Widget[] internalFindItems(Object parentElementOrTreePath) { | |
| 191 Widget[] widgets; | |
| 192 if ( auto path = cast(TreePath) parentElementOrTreePath ) { | |
| 193 Widget w = internalFindItem(path); | |
| 194 if (w is null) { | |
| 195 widgets = null; | |
| 196 } else { | |
| 197 widgets = [ w ]; | |
| 198 } | |
| 199 } else { | |
| 200 widgets = findItems(parentElementOrTreePath); | |
| 201 } | |
| 202 return widgets; | |
| 203 } | |
| 204 | |
| 205 /** | |
| 206 * Return the item at the given path or <code>null</code> | |
| 207 * | |
| 208 * @param path | |
| 209 * the path | |
| 210 * @return {@link Widget} the item at that path | |
| 211 */ | |
| 212 private Widget internalFindItem(TreePath path) { | |
| 213 Widget[] widgets = findItems(path.getLastSegment()); | |
| 214 for (int i = 0; i < widgets.length; i++) { | |
| 215 Widget widget = widgets[i]; | |
| 216 if ( auto item = cast(Item)widget ) { | |
| 217 TreePath p = getTreePathFromItem(item); | |
| 218 if (p.opEquals(path)) { | |
| 219 return widget; | |
| 220 } | |
| 221 } | |
| 222 } | |
| 223 return null; | |
| 224 } | |
| 225 | |
| 226 /** | |
| 227 * Adds the given child elements to this viewer as children of the given | |
| 228 * parent element. | |
| 229 * <p> | |
| 230 * EXPERIMENTAL. Not to be used except by JDT. This method was added to | |
| 231 * support JDT's explorations into grouping by working sets, which requires | |
| 232 * viewers to support multiple equal elements. See bug 76482 for more | |
| 233 * details. This support will likely be removed in Eclipse 3.2 in favor of | |
| 234 * proper support for multiple equal elements. | |
| 235 * </p> | |
| 236 * | |
| 237 * @param widget | |
| 238 * the widget for the parent element | |
| 239 * @param parentElementOrTreePath | |
| 240 * the parent element | |
| 241 * @param childElements | |
| 242 * the child elements to add | |
| 243 * @since 3.1 | |
| 244 */ | |
| 245 protected void internalAdd(Widget widget, Object parentElementOrTreePath, | |
| 246 Object[] childElements) { | |
| 247 Object parent; | |
| 248 TreePath path; | |
| 249 if ( auto path = cast(TreePath) parentElementOrTreePath ) { | |
| 250 parent = path.getLastSegment(); | |
| 251 } else { | |
| 252 parent = parentElementOrTreePath; | |
| 253 path = null; | |
| 254 } | |
| 255 | |
| 256 // optimization! | |
| 257 // if the widget is not expanded we just invalidate the subtree | |
| 258 if ( auto ti = cast(Item)widget ) { | |
| 259 if (!getExpanded(ti)) { | |
| 260 bool needDummy = isExpandable(ti, path, parent); | |
| 261 bool haveDummy = false; | |
| 262 // remove all children | |
| 263 Item[] items = getItems(ti); | |
| 264 for (int i = 0; i < items.length; i++) { | |
| 265 if (items[i].getData() !is null) { | |
| 266 disassociate(items[i]); | |
| 267 items[i].dispose(); | |
| 268 } else { | |
| 269 if (needDummy && !haveDummy) { | |
| 270 haveDummy = true; | |
| 271 } else { | |
| 272 items[i].dispose(); | |
| 273 } | |
| 274 } | |
| 275 } | |
| 276 // append a dummy if necessary | |
| 277 if (needDummy && !haveDummy) { | |
| 278 newItem(ti, DWT.NULL, -1); | |
| 279 } | |
| 280 return; | |
| 281 } | |
| 282 } | |
| 283 | |
| 284 if (childElements.length > 0) { | |
| 285 // TODO: Add filtering back? | |
| 286 Object[] filtered = filter(parentElementOrTreePath, childElements); | |
| 287 ViewerComparator comparator = getComparator(); | |
| 288 if (comparator !is null) { | |
| 289 if ( auto tpvs = cast(TreePathViewerSorter) comparator ) { | |
| 290 if (path is null) { | |
| 291 path = internalGetSorterParentPath(widget, comparator); | |
| 292 } | |
| 293 tpvs.sort(this, path, filtered); | |
| 294 } else { | |
| 295 comparator.sort(this, filtered); | |
| 296 } | |
| 297 } | |
| 298 createAddedElements(widget, filtered); | |
| 299 } | |
| 300 } | |
| 301 | |
| 302 /** | |
| 303 * Filter the children elements. | |
| 304 * | |
| 305 * @param parentElementOrTreePath | |
| 306 * the parent element or path | |
| 307 * @param elements | |
| 308 * the child elements | |
| 309 * @return the filter list of children | |
| 310 */ | |
| 311 private Object[] filter(Object parentElementOrTreePath, Object[] elements) { | |
| 312 ViewerFilter[] filters = getFilters(); | |
| 313 if (filters !is null) { | |
| 314 auto filtered = new ArraySeq!(Object); | |
| 315 filtered.capacity(elements.length); | |
| 316 for (int i = 0; i < elements.length; i++) { | |
| 317 bool add = true; | |
| 318 for (int j = 0; j < filters.length; j++) { | |
| 319 add = filters[j].select(this, parentElementOrTreePath, | |
| 320 elements[i]); | |
| 321 if (!add) { | |
| 322 break; | |
| 323 } | |
| 324 } | |
| 325 if (add) { | |
| 326 filtered.append(elements[i]); | |
| 327 } | |
| 328 } | |
| 329 return filtered.toArray(); | |
| 330 } | |
| 331 return elements; | |
| 332 } | |
| 333 | |
| 334 /** | |
| 335 * Create the new elements in the parent widget. If the child already exists | |
| 336 * do nothing. | |
| 337 * | |
| 338 * @param widget | |
| 339 * @param elements | |
| 340 * Sorted list of elements to add. | |
| 341 */ | |
| 342 private void createAddedElements(Widget widget, Object[] elements) { | |
| 343 | |
| 344 if (elements.length is 1) { | |
| 345 if (opEquals(elements[0], widget.getData())) { | |
| 346 return; | |
| 347 } | |
| 348 } | |
| 349 | |
| 350 ViewerComparator comparator = getComparator(); | |
| 351 TreePath parentPath = internalGetSorterParentPath(widget, comparator); | |
| 352 Item[] items = getChildren(widget); | |
| 353 | |
| 354 // Optimize for the empty case | |
| 355 if (items.length is 0) { | |
| 356 for (int i = 0; i < elements.length; i++) { | |
| 357 createTreeItem(widget, elements[i], -1); | |
| 358 } | |
| 359 return; | |
| 360 } | |
| 361 | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
362 // Optimize for no comparator |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
363 if (comparator is null) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
364 for (int i = 0; i < elements.length; i++) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
365 Object element = elements[i]; |
| 10 | 366 if (itemExists(items, element)) { |
| 367 internalRefresh(element); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
368 } else { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
369 createTreeItem(widget, element, -1); |
| 10 | 370 } |
| 371 } | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
372 return; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
373 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
374 // As the items are sorted already we optimize for a |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
375 // start position. This is the insertion position relative to the |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
376 // original item array. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
377 int indexInItems = 0; |
| 71 | 378 |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
379 // Count of elements we have added. See bug 205700 for why this is needed. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
380 int newItems = 0; |
| 71 | 381 |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
382 elementloop: for (int i = 0; i < elements.length; i++) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
383 Object element = elements[i]; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
384 // update the index relative to the original item array |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
385 indexInItems = insertionPosition(items, comparator, |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
386 indexInItems, element, parentPath); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
387 if (indexInItems is items.length) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
388 createTreeItem(widget, element, -1); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
389 newItems++; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
390 } else { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
391 // Search for an item for the element. The comparator might |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
392 // regard elements as equal when they are not. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
393 |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
394 // Use a separate index variable to search within the existing |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
395 // elements that compare equally, see |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
396 // TreeViewerTestBug205700.testAddEquallySortedElements. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
397 int insertionIndexInItems = indexInItems; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
398 while( insertionIndexInItems < items.length |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
399 && internalCompare(comparator, parentPath, element, |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
400 items[insertionIndexInItems].getData()) is 0) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
401 // As we cannot assume the sorter is consistent with |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
402 // equals() - therefore we can |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
403 // just check against the item prior to this index (if |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
404 // any) |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
405 if (items[insertionIndexInItems].getData().opEquals(element)) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
406 // Found the item for the element. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
407 // Refresh the element in case it has new children. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
408 internalRefresh(element); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
409 // Do not create a new item - continue with the next element. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
410 continue elementloop; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
411 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
412 insertionIndexInItems++; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
413 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
414 // Did we get to the end? |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
415 if (insertionIndexInItems is items.length) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
416 createTreeItem(widget, element, -1); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
417 newItems++; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
418 } else { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
419 // InsertionIndexInItems is the index in the original array. We |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
420 // need to correct by the number of new items we have |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
421 // created. See bug 205700. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
422 createTreeItem(widget, element, insertionIndexInItems + newItems); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
423 newItems++; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
424 } |
| 10 | 425 } |
| 426 } | |
| 427 } | |
| 428 | |
| 429 /** | |
| 430 * See if element is the data of one of the elements in items. | |
| 431 * | |
| 432 * @param items | |
| 433 * @param element | |
| 434 * @return <code>true</code> if the element matches. | |
| 435 */ | |
| 436 private bool itemExists(Item[] items, Object element) { | |
| 437 if (usingElementMap()) { | |
| 438 Widget[] existingItems = findItems(element); | |
| 439 // optimization for two common cases | |
| 440 if (existingItems.length is 0) { | |
| 441 return false; | |
| 442 } else if (existingItems.length is 1) { | |
| 443 if (items.length > 0 && null !is cast(Item)existingItems[0] ) { | |
| 444 Item existingItem = cast(Item) existingItems[0]; | |
| 445 return getParentItem(existingItem) is getParentItem(items[0]); | |
| 446 } | |
| 447 } | |
| 448 } | |
| 449 for (int i = 0; i < items.length; i++) { | |
| 450 if (items[i].getData().opEquals(element)) { | |
| 451 return true; | |
| 452 } | |
| 453 } | |
| 454 return false; | |
| 455 } | |
| 456 | |
| 457 /** | |
| 458 * Returns the index where the item should be inserted. It uses sorter to | |
| 459 * determine the correct position, if sorter is not assigned, returns the | |
| 460 * index of the element after the last. | |
| 461 * | |
| 462 * @param items | |
| 463 * the items to search | |
| 464 * @param comparator | |
| 465 * The comparator to use. | |
| 466 * @param lastInsertion | |
| 467 * the start index to start search for position from this allows | |
| 468 * optimizing search for multiple elements that are sorted | |
| 469 * themselves. | |
| 470 * @param element | |
| 471 * element to find position for. | |
| 472 * @param parentPath | |
| 473 * the tree path for the element's parent or <code>null</code> | |
| 474 * if the element is a root element or the sorter is not a | |
| 475 * {@link TreePathViewerSorter} | |
| 476 * @return the index to use when inserting the element. | |
| 477 * | |
| 478 */ | |
| 479 | |
| 480 private int insertionPosition(Item[] items, ViewerComparator comparator, | |
| 481 int lastInsertion, Object element, TreePath parentPath) { | |
| 482 | |
| 483 int size = items.length; | |
| 484 if (comparator is null) { | |
| 485 return size; | |
| 486 } | |
| 487 int min = lastInsertion, max = size - 1; | |
| 488 | |
| 489 while (min <= max) { | |
| 490 int mid = (min + max) / 2; | |
| 491 Object data = items[mid].getData(); | |
| 492 int compare = internalCompare(comparator, parentPath, data, element); | |
| 493 if (compare is 0) { | |
| 494 return mid;// Return if we already match | |
| 495 } | |
| 496 if (compare < 0) { | |
| 497 min = mid + 1; | |
| 498 } else { | |
| 499 max = mid - 1; | |
| 500 } | |
| 501 } | |
| 502 return min; | |
| 503 | |
| 504 } | |
| 505 | |
| 506 /** | |
| 507 * Returns the index where the item should be inserted. It uses sorter to | |
| 508 * determine the correct position, if sorter is not assigned, returns the | |
| 509 * index of the element after the last. | |
| 510 * | |
| 511 * @param parent | |
| 512 * The parent widget | |
| 513 * @param sorter | |
| 514 * The sorter to use. | |
| 515 * @param startIndex | |
| 516 * the start index to start search for position from this allows | |
| 517 * optimizing search for multiple elements that are sorted | |
| 518 * themselves. | |
| 519 * @param element | |
| 520 * element to find position for. | |
| 521 * @param currentSize | |
| 522 * the current size of the collection | |
| 523 * @return the index to use when inserting the element. | |
| 524 * | |
| 525 */ | |
| 526 | |
| 527 /** | |
| 528 * Returns the index where the item should be inserted. | |
| 529 * | |
| 530 * @param parent | |
| 531 * The parent widget the element will be inserted into. | |
| 532 * @param element | |
| 533 * The element to insert. | |
| 534 * @return the index of the element | |
| 535 */ | |
| 536 protected int indexForElement(Widget parent, Object element) { | |
| 537 ViewerComparator comparator = getComparator(); | |
| 538 TreePath parentPath = internalGetSorterParentPath(parent, comparator); | |
| 539 | |
| 540 Item[] items = getChildren(parent); | |
| 541 int count = items.length; | |
| 542 | |
| 543 if (comparator is null) { | |
| 544 return count; | |
| 545 } | |
| 546 int min = 0, max = count - 1; | |
| 547 | |
| 548 while (min <= max) { | |
| 549 int mid = (min + max) / 2; | |
| 550 Object data = items[mid].getData(); | |
| 551 int compare = internalCompare(comparator, parentPath, data, element); | |
| 552 if (compare is 0) { | |
| 553 // find first item > element | |
| 554 while (compare is 0) { | |
| 555 ++mid; | |
| 556 if (mid >= count) { | |
| 557 break; | |
| 558 } | |
| 559 data = items[mid].getData(); | |
| 560 compare = internalCompare(comparator, parentPath, data, | |
| 561 element); | |
| 562 } | |
| 563 return mid; | |
| 564 } | |
| 565 if (compare < 0) { | |
| 566 min = mid + 1; | |
| 567 } else { | |
| 568 max = mid - 1; | |
| 569 } | |
| 570 } | |
| 571 return min; | |
| 572 } | |
| 573 | |
| 574 /** | |
| 575 * Return the tree path that should be used as the parent path for the given | |
| 576 * widget and sorter. A <code>null</code> is returned if either the sorter | |
| 577 * is not a {@link TreePathViewerSorter} or if the parent widget is not an | |
| 578 * {@link Item} (i.e. is the root of the tree). | |
| 579 * | |
| 580 * @param parent | |
| 581 * the parent widget | |
| 582 * @param comparator | |
| 583 * the sorter | |
| 584 * @return the tree path that should be used as the parent path for the | |
| 585 * given widget and sorter | |
| 586 */ | |
| 587 private TreePath internalGetSorterParentPath(Widget parent, | |
| 588 ViewerComparator comparator) { | |
| 589 TreePath path; | |
| 590 if ( null !is cast(TreePathViewerSorter)comparator | |
| 591 && null !is cast(Item)parent ) { | |
| 592 Item item = cast(Item) parent; | |
| 593 path = getTreePathFromItem(item); | |
| 594 } else { | |
| 595 path = null; | |
| 596 } | |
| 597 return path; | |
| 598 } | |
| 599 | |
| 600 /** | |
| 601 * Compare the two elements using the given sorter. If the sorter is a | |
| 602 * {@link TreePathViewerSorter}, the provided tree path will be used. If | |
| 603 * the tree path is null and the sorter is a tree path sorter, then the | |
| 604 * elements are root elements | |
| 605 * | |
| 606 * @param comparator | |
| 607 * the sorter | |
| 608 * @param parentPath | |
| 609 * the path of the elements' parent | |
| 610 * @param e1 | |
| 611 * the first element | |
| 612 * @param e2 | |
| 613 * the second element | |
| 614 * @return the result of comparing the two elements | |
| 615 */ | |
| 616 private int internalCompare(ViewerComparator comparator, | |
| 617 TreePath parentPath, Object e1, Object e2) { | |
| 618 if ( auto tpvs = cast(TreePathViewerSorter) comparator ) { | |
| 619 return tpvs.compare(this, parentPath, e1, e2); | |
| 620 } | |
| 621 return comparator.compare(this, e1, e2); | |
| 622 } | |
| 623 | |
| 624 /* | |
| 625 * (non-Javadoc) | |
| 626 * | |
| 627 * @see dwtx.jface.viewers.StructuredViewer#getSortedChildren(java.lang.Object) | |
| 628 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
629 protected override Object[] getSortedChildren(Object parentElementOrTreePath) { |
| 10 | 630 Object[] result = getFilteredChildren(parentElementOrTreePath); |
| 631 ViewerComparator comparator = getComparator(); | |
| 632 if (parentElementOrTreePath !is null | |
| 633 && null !is cast(TreePathViewerSorter) comparator ) { | |
| 634 TreePathViewerSorter tpvs = cast(TreePathViewerSorter) comparator; | |
| 635 | |
| 636 // be sure we're not modifying the original array from the model | |
| 637 result = result.dup; | |
| 638 | |
| 639 TreePath path = null; | |
| 640 if ( auto p = cast(TreePath) parentElementOrTreePath ) { | |
| 641 path = p; | |
| 642 } else { | |
| 643 Object parent = parentElementOrTreePath; | |
| 644 Widget w = internalGetWidgetToSelect(parent); | |
| 645 if (w !is null) { | |
| 646 path = internalGetSorterParentPath(w, comparator); | |
| 647 } | |
| 648 } | |
| 649 tpvs.sort(this, path, result); | |
| 650 } else if (comparator !is null) { | |
| 651 // be sure we're not modifying the original array from the model | |
| 652 result = result.dup; | |
| 653 comparator.sort(this, result); | |
| 654 } | |
| 655 return result; | |
| 656 } | |
| 657 | |
| 658 /* | |
| 659 * (non-Javadoc) | |
| 660 * | |
| 661 * @see dwtx.jface.viewers.StructuredViewer#getFilteredChildren(java.lang.Object) | |
| 662 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
663 protected override Object[] getFilteredChildren(Object parentElementOrTreePath) { |
| 10 | 664 Object[] result = getRawChildren(parentElementOrTreePath); |
| 665 ViewerFilter[] filters = getFilters(); | |
| 666 for (int i = 0; i < filters.length; i++) { | |
| 667 ViewerFilter filter = filters[i]; | |
| 668 result = filter.filter(this, parentElementOrTreePath, result); | |
| 669 } | |
| 670 return result; | |
| 671 } | |
| 672 | |
| 673 /** | |
| 674 * Adds the given child element to this viewer as a child of the given | |
| 675 * parent element. If this viewer does not have a sorter, the element is | |
| 676 * added at the end of the parent's list of children; otherwise, the element | |
| 677 * is inserted at the appropriate position. | |
| 678 * <p> | |
| 679 * This method should be called (by the content provider) when a single | |
| 680 * element has been added to the model, in order to cause the viewer to | |
| 681 * accurately reflect the model. This method only affects the viewer, not | |
| 682 * the model. Note that there is another method for efficiently processing | |
| 683 * the simultaneous addition of multiple elements. | |
| 684 * </p> | |
| 685 * | |
| 686 * @param parentElementOrTreePath | |
| 687 * the parent element or path | |
| 688 * @param childElement | |
| 689 * the child element | |
| 690 */ | |
| 691 public void add(Object parentElementOrTreePath, Object childElement) { | |
| 692 add(parentElementOrTreePath, [ childElement ]); | |
| 693 } | |
| 694 | |
| 695 /** | |
| 696 * Adds the given DWT selection listener to the given DWT control. | |
| 697 * | |
| 698 * @param control | |
| 699 * the DWT control | |
| 700 * @param listener | |
| 701 * the DWT selection listener | |
| 702 * @deprecated | |
| 703 */ | |
| 704 protected void addSelectionListener(Control control, | |
| 705 SelectionListener listener) { | |
| 706 // do nothing | |
| 707 } | |
| 708 | |
| 709 /** | |
| 710 * Adds a listener for expand and collapse events in this viewer. Has no | |
| 711 * effect if an identical listener is already registered. | |
| 712 * | |
| 713 * @param listener | |
| 714 * a tree viewer listener | |
| 715 */ | |
| 716 public void addTreeListener(ITreeViewerListener listener) { | |
| 717 treeListeners.add(cast(Object)listener); | |
| 718 } | |
| 719 | |
| 720 /** | |
| 721 * Adds the given DWT tree listener to the given DWT control. | |
| 722 * | |
| 723 * @param control | |
| 724 * the DWT control | |
| 725 * @param listener | |
| 726 * the DWT tree listener | |
| 727 */ | |
| 728 protected abstract void addTreeListener(Control control, | |
| 729 TreeListener listener); | |
| 730 | |
| 731 /* | |
| 732 * (non-Javadoc) | |
| 733 * | |
| 734 * @see StructuredViewer#associate(Object, Item) | |
| 735 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
736 protected override void associate(Object element, Item item) { |
| 10 | 737 Object data = item.getData(); |
| 738 if (data !is null && data !is element && opEquals(data, element)) { | |
| 739 // workaround for PR 1FV62BT | |
| 740 // assumption: elements are equal but not identical | |
| 741 // -> remove from map but don't touch children | |
| 742 unmapElement(data, item); | |
| 743 item.setData(element); | |
| 744 mapElement(element, item); | |
| 745 } else { | |
| 746 // recursively disassociate all | |
| 747 super.associate(element, item); | |
| 748 } | |
| 749 } | |
| 750 | |
| 751 /** | |
| 752 * Collapses all nodes of the viewer's tree, starting with the root. This | |
| 753 * method is equivalent to <code>collapseToLevel(ALL_LEVELS)</code>. | |
| 754 */ | |
| 755 public void collapseAll() { | |
| 756 Object root = getRoot(); | |
| 757 if (root !is null) { | |
| 758 collapseToLevel(root, ALL_LEVELS); | |
| 759 } | |
| 760 } | |
| 761 | |
| 762 /** | |
| 763 * Collapses the subtree rooted at the given element or tree path to the | |
| 764 * given level. | |
| 765 * | |
| 766 * @param elementOrTreePath | |
| 767 * the element or tree path | |
| 768 * @param level | |
| 769 * non-negative level, or <code>ALL_LEVELS</code> to collapse | |
| 770 * all levels of the tree | |
| 771 */ | |
| 772 public void collapseToLevel(Object elementOrTreePath, int level) { | |
| 773 Assert.isNotNull(elementOrTreePath); | |
| 774 Widget w = internalGetWidgetToSelect(elementOrTreePath); | |
| 775 if (w !is null) { | |
| 776 internalCollapseToLevel(w, level); | |
| 777 } | |
| 778 } | |
| 779 | |
| 780 /** | |
| 781 * Creates all children for the given widget. | |
| 782 * <p> | |
| 783 * The default implementation of this framework method assumes that | |
| 784 * <code>widget.getData()</code> returns the element corresponding to the | |
| 785 * node. Note: the node is not visually expanded! You may have to call | |
| 786 * <code>parent.setExpanded(true)</code>. | |
| 787 * </p> | |
| 788 * | |
| 789 * @param widget | |
| 790 * the widget | |
| 791 */ | |
| 792 protected void createChildren(Widget widget) { | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
793 bool oldBusy = isBusy(); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
794 setBusy(true); |
| 10 | 795 try { |
|
54
a6683645b0d7
Fix ignored labelprovider for TreeViewer (See WrapperViewerLabelProvider.d), removed the debugging prints
Frank Benoit <benoit@tionex.de>
parents:
53
diff
changeset
|
796 Item[] tis = getChildren(widget); |
| 10 | 797 if (tis !is null && tis.length > 0) { |
| 798 Object data = tis[0].getData(); | |
| 799 if (data !is null) { | |
| 800 return; // children already there! | |
| 801 } | |
| 802 } | |
| 803 | |
| 39 | 804 BusyIndicator.showWhile(widget.getDisplay(), new class(widget,tis) Runnable { |
| 10 | 805 Widget widget_; |
| 806 Item[] tis_; | |
| 39 | 807 this( Widget a, Item[] b){ |
| 808 widget_ = a; | |
| 809 tis_=b; | |
| 10 | 810 } |
| 811 public void run() { | |
| 812 // fix for PR 1FW89L7: | |
| 813 // don't complain and remove all "dummies" ... | |
| 814 if (tis_ !is null) { | |
| 815 for (int i = 0; i < tis_.length; i++) { | |
| 816 if (tis_[i].getData() !is null) { | |
| 817 disassociate(tis_[i]); | |
| 818 Assert.isTrue(tis_[i].getData() is null, | |
| 819 "Second or later child is non -null");//$NON-NLS-1$ | |
| 820 | |
| 821 } | |
| 822 tis_[i].dispose(); | |
| 823 } | |
| 824 } | |
| 825 Object d = widget_.getData(); | |
| 826 if (d !is null) { | |
| 827 Object parentElement = d; | |
| 828 Object[] children; | |
| 39 | 829 if (isTreePathContentProvider() && (null !is cast(Item)widget_) ) { |
| 10 | 830 TreePath path = getTreePathFromItem(cast(Item) widget_); |
| 831 children = getSortedChildren(path); | |
| 832 } else { | |
| 833 children = getSortedChildren(parentElement); | |
| 834 } | |
| 835 for (int i = 0; i < children.length; i++) { | |
| 836 createTreeItem(widget_, children[i], -1); | |
| 837 } | |
| 838 } | |
| 839 } | |
| 840 | |
| 841 }); | |
| 842 } finally { | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
843 setBusy(oldBusy); |
| 10 | 844 } |
| 845 } | |
| 846 | |
| 847 /** | |
| 848 * Creates a single item for the given parent and synchronizes it with the | |
| 849 * given element. | |
| 850 * | |
| 851 * @param parent | |
| 852 * the parent widget | |
| 853 * @param element | |
| 854 * the element | |
| 855 * @param index | |
| 856 * if non-negative, indicates the position to insert the item | |
| 857 * into its parent | |
| 858 */ | |
| 859 protected void createTreeItem(Widget parent, Object element, int index) { | |
| 860 Item item = newItem(parent, DWT.NULL, index); | |
| 861 updateItem(item, element); | |
| 862 updatePlus(item, element); | |
| 863 } | |
| 864 | |
| 865 /** | |
| 866 * The <code>AbstractTreeViewer</code> implementation of this method also | |
| 867 * recurses over children of the corresponding element. | |
| 868 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
869 protected override void disassociate(Item item) { |
| 10 | 870 super.disassociate(item); |
| 871 // recursively unmapping the items is only required when | |
| 872 // the hash map is used. In the other case disposing | |
| 873 // an item will recursively dispose its children. | |
| 874 if (usingElementMap()) { | |
| 875 disassociateChildren(item); | |
| 876 } | |
| 877 } | |
| 878 | |
| 879 /** | |
| 880 * Disassociates the children of the given DWT item from their corresponding | |
| 881 * elements. | |
| 882 * | |
| 883 * @param item | |
| 884 * the widget | |
| 885 */ | |
| 886 private void disassociateChildren(Item item) { | |
| 887 Item[] items = getChildren(item); | |
| 888 for (int i = 0; i < items.length; i++) { | |
| 889 if (items[i].getData() !is null) { | |
| 890 disassociate(items[i]); | |
| 891 } | |
| 892 } | |
| 893 } | |
| 894 | |
| 895 /* (non-Javadoc) Method declared on StructuredViewer. */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
896 protected override Widget doFindInputItem(Object element) { |
| 10 | 897 // compare with root |
| 898 Object root = getRoot(); | |
| 899 if (root is null) { | |
| 900 return null; | |
| 901 } | |
| 902 | |
| 903 if (opEquals(root, element)) { | |
| 904 return getControl(); | |
| 905 } | |
| 906 return null; | |
| 907 } | |
| 908 | |
| 909 /* (non-Javadoc) Method declared on StructuredViewer. */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
910 protected override Widget doFindItem(Object element) { |
| 10 | 911 // compare with root |
| 912 Object root = getRoot(); | |
| 913 if (root is null) { | |
| 914 return null; | |
| 915 } | |
| 916 | |
| 917 Item[] items = getChildren(getControl()); | |
| 918 if (items !is null) { | |
| 919 for (int i = 0; i < items.length; i++) { | |
| 920 Widget o = internalFindItem(items[i], element); | |
| 921 if (o !is null) { | |
| 922 return o; | |
| 923 } | |
| 924 } | |
| 925 } | |
| 926 return null; | |
| 927 } | |
| 928 | |
| 929 /** | |
| 930 * Copies the attributes of the given element into the given DWT item. | |
| 931 * | |
| 932 * @param item | |
| 933 * the DWT item | |
| 934 * @param element | |
| 935 * the element | |
| 936 */ | |
| 937 protected void doUpdateItem(Item item, Object element) { | |
| 938 if (item.isDisposed()) { | |
| 939 unmapElement(element, item); | |
| 940 return; | |
| 941 } | |
| 942 | |
| 943 int columnCount = doGetColumnCount(); | |
| 944 if (columnCount is 0)// If no columns are created then fake one | |
| 945 columnCount = 1; | |
| 946 | |
| 947 ViewerRow viewerRowFromItem = getViewerRowFromItem(item); | |
| 948 | |
| 949 bool isVirtual = (getControl().getStyle() & DWT.VIRTUAL) !is 0; | |
| 950 | |
| 951 // If the control is virtual, we cannot use the cached viewer row object. See bug 188663. | |
| 952 if (isVirtual) { | |
| 953 viewerRowFromItem = cast(ViewerRow) viewerRowFromItem.clone(); | |
| 954 } | |
| 955 | |
| 956 for (int column = 0; column < columnCount; column++) { | |
| 957 ViewerColumn columnViewer = getViewerColumn(column); | |
| 958 ViewerCell cellToUpdate = updateCell(viewerRowFromItem, column, | |
| 959 element); | |
| 960 | |
| 961 // If the control is virtual, we cannot use the cached cell object. See bug 188663. | |
| 962 if (isVirtual) { | |
| 963 cellToUpdate = new ViewerCell(cellToUpdate.getViewerRow(), cellToUpdate.getColumnIndex(), element); | |
| 964 } | |
| 965 | |
| 966 columnViewer.refresh(cellToUpdate); | |
| 967 | |
| 968 // clear cell (see bug 201280) | |
| 969 updateCell(null, 0, null); | |
| 970 | |
| 971 // As it is possible for user code to run the event | |
| 972 // loop check here. | |
| 973 if (item.isDisposed()) { | |
| 974 unmapElement(element, item); | |
| 975 return; | |
| 976 } | |
| 977 | |
| 978 } | |
| 979 } | |
| 980 | |
| 981 /** | |
| 982 * Returns <code>true</code> if the given list and array of items refer to | |
| 983 * the same model elements. Order is unimportant. | |
| 984 * <p> | |
| 985 * This method is not intended to be overridden by subclasses. | |
| 986 * </p> | |
| 987 * | |
| 988 * @param items | |
| 989 * the list of items | |
| 990 * @param current | |
| 991 * the array of items | |
| 992 * @return <code>true</code> if the refer to the same elements, | |
| 993 * <code>false</code> otherwise | |
| 994 * | |
| 995 * @since 3.1 in TreeViewer, moved to AbstractTreeViewer in 3.3 | |
| 996 */ | |
| 997 protected bool isSameSelection(SeqView!(Item) items, Item[] current) { | |
| 998 // If they are not the same size then they are not equivalent | |
| 999 int n = items.size(); | |
| 1000 if (n !is current.length) { | |
| 1001 return false; | |
| 1002 } | |
| 1003 | |
| 1004 CustomHashtable itemSet = newHashtable(n * 2 + 1); | |
| 1005 foreach( item; items ){ | |
| 1006 Object element = item.getData(); | |
| 1007 itemSet.put(element, element); | |
| 1008 } | |
| 1009 | |
| 1010 // Go through the items of the current collection | |
| 1011 // If there is a mismatch return false | |
| 1012 for (int i = 0; i < current.length; i++) { | |
| 1013 if (current[i].getData() is null | |
| 1014 || !itemSet.containsKey(current[i].getData())) { | |
| 1015 return false; | |
| 1016 } | |
| 1017 } | |
| 1018 | |
| 1019 return true; | |
| 1020 } | |
| 1021 | |
| 1022 | |
| 1023 | |
| 1024 /* (non-Javadoc) Method declared on StructuredViewer. */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
1025 protected override void doUpdateItem(Widget widget, Object element, bool fullMap) { |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1026 bool oldBusy = isBusy(); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1027 setBusy(true); |
| 10 | 1028 try { |
| 1029 if ( auto item = cast(Item)widget ) { | |
| 1030 | |
| 1031 // ensure that back pointer is correct | |
| 1032 if (fullMap) { | |
| 1033 associate(element, item); | |
| 1034 } else { | |
| 1035 Object data = item.getData(); | |
| 1036 if (data !is null) { | |
| 1037 unmapElement(data, item); | |
| 1038 } | |
| 1039 item.setData(element); | |
| 1040 mapElement(element, item); | |
| 1041 } | |
| 1042 | |
| 1043 // update icon and label | |
| 1044 SafeRunnable.run(new UpdateItemSafeRunnable(item, element)); | |
| 1045 } | |
| 1046 } finally { | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1047 setBusy(oldBusy); |
| 10 | 1048 } |
| 1049 } | |
| 1050 | |
| 1051 /** | |
| 1052 * Expands all nodes of the viewer's tree, starting with the root. This | |
| 1053 * method is equivalent to <code>expandToLevel(ALL_LEVELS)</code>. | |
| 1054 */ | |
| 1055 public void expandAll() { | |
| 1056 expandToLevel(ALL_LEVELS); | |
| 1057 } | |
| 1058 | |
| 1059 /** | |
| 1060 * Expands the root of the viewer's tree to the given level. | |
| 1061 * | |
| 1062 * @param level | |
| 1063 * non-negative level, or <code>ALL_LEVELS</code> to expand all | |
| 1064 * levels of the tree | |
| 1065 */ | |
| 1066 public void expandToLevel(int level) { | |
| 1067 expandToLevel(getRoot(), level); | |
| 1068 } | |
| 1069 | |
| 1070 /** | |
| 1071 * Expands all ancestors of the given element or tree path so that the given | |
| 1072 * element becomes visible in this viewer's tree control, and then expands | |
| 1073 * the subtree rooted at the given element to the given level. | |
| 1074 * | |
| 1075 * @param elementOrTreePath | |
| 1076 * the element | |
| 1077 * @param level | |
| 1078 * non-negative level, or <code>ALL_LEVELS</code> to expand all | |
| 1079 * levels of the tree | |
| 1080 */ | |
| 1081 public void expandToLevel(Object elementOrTreePath, int level) { | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1082 if (checkBusy()) |
| 10 | 1083 return; |
| 1084 Widget w = internalExpand(elementOrTreePath, true); | |
| 1085 if (w !is null) { | |
| 1086 internalExpandToLevel(w, level); | |
| 1087 } | |
| 1088 } | |
| 1089 | |
| 1090 /** | |
| 1091 * Fires a tree collapsed event. Only listeners registered at the time this | |
| 1092 * method is called are notified. | |
| 1093 * | |
| 1094 * @param event | |
| 1095 * the tree expansion event | |
| 1096 * @see ITreeViewerListener#treeCollapsed | |
| 1097 */ | |
| 1098 protected void fireTreeCollapsed(TreeExpansionEvent event) { | |
| 1099 Object[] listeners = treeListeners.getListeners(); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1100 bool oldBusy = isBusy(); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1101 setBusy(true); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1102 try { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1103 for (int i = 0; i < listeners.length; ++i) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1104 SafeRunnable.run(new class(event,cast(ITreeViewerListener) listeners[i]) SafeRunnable { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1105 TreeExpansionEvent event_; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1106 ITreeViewerListener l; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1107 this(TreeExpansionEvent a,ITreeViewerListener b){ |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1108 event_=a; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1109 l = b; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1110 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1111 public void run() { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1112 l.treeCollapsed(event_); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1113 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1114 }); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1115 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1116 } finally { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1117 setBusy(oldBusy); |
| 10 | 1118 } |
| 1119 } | |
| 1120 | |
| 1121 /** | |
| 1122 * Fires a tree expanded event. Only listeners registered at the time this | |
| 1123 * method is called are notified. | |
| 1124 * | |
| 1125 * @param event | |
| 1126 * the tree expansion event | |
| 1127 * @see ITreeViewerListener#treeExpanded | |
| 1128 */ | |
| 1129 protected void fireTreeExpanded(TreeExpansionEvent event) { | |
| 1130 Object[] listeners = treeListeners.getListeners(); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1131 bool oldBusy = isBusy(); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1132 setBusy(true); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1133 try { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1134 for (int i = 0; i < listeners.length; ++i) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1135 SafeRunnable.run(new class( event, cast(ITreeViewerListener) listeners[i]) SafeRunnable { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1136 TreeExpansionEvent event_; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1137 ITreeViewerListener l; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1138 this(TreeExpansionEvent a,ITreeViewerListener b){ |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1139 event_=a; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1140 l = b; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1141 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1142 public void run() { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1143 l.treeExpanded(event_); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1144 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1145 }); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1146 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1147 } finally { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1148 setBusy(oldBusy); |
| 10 | 1149 } |
| 1150 } | |
| 1151 | |
| 1152 /** | |
| 1153 * Returns the auto-expand level. | |
| 1154 * | |
| 1155 * @return non-negative level, or <code>ALL_LEVELS</code> if all levels of | |
| 1156 * the tree are expanded automatically | |
| 1157 * @see #setAutoExpandLevel | |
| 1158 */ | |
| 1159 public int getAutoExpandLevel() { | |
| 1160 return expandToLevel_; | |
| 1161 } | |
| 1162 | |
| 1163 /** | |
| 1164 * Returns the DWT child items for the given DWT widget. | |
| 1165 * | |
| 1166 * @param widget | |
| 1167 * the widget | |
| 1168 * @return the child items | |
| 1169 */ | |
| 1170 protected abstract Item[] getChildren(Widget widget); | |
| 1171 | |
| 1172 /** | |
| 1173 * Get the child for the widget at index. Note that the default | |
| 1174 * implementation is not very efficient and should be overridden if this | |
| 1175 * class is implemented. | |
| 1176 * | |
| 1177 * @param widget | |
| 1178 * the widget to check | |
| 1179 * @param index | |
| 1180 * the index of the widget | |
| 1181 * @return Item or <code>null</code> if widget is not a type that can | |
| 1182 * contain items. | |
| 1183 * | |
| 1184 * @throws ArrayIndexOutOfBoundsException | |
| 1185 * if the index is not valid. | |
| 1186 * @since 3.1 | |
| 1187 */ | |
| 1188 protected Item getChild(Widget widget, int index) { | |
| 1189 return getChildren(widget)[index]; | |
| 1190 } | |
| 1191 | |
| 1192 /** | |
| 1193 * Returns whether the given DWT item is expanded or collapsed. | |
| 1194 * | |
| 1195 * @param item | |
| 1196 * the item | |
| 1197 * @return <code>true</code> if the item is considered expanded and | |
| 1198 * <code>false</code> if collapsed | |
| 1199 */ | |
| 1200 protected abstract bool getExpanded(Item item); | |
| 1201 | |
| 1202 /** | |
| 1203 * Returns a list of elements corresponding to expanded nodes in this | |
| 1204 * viewer's tree, including currently hidden ones that are marked as | |
| 1205 * expanded but are under a collapsed ancestor. | |
| 1206 * <p> | |
| 1207 * This method is typically used when preserving the interesting state of a | |
| 1208 * viewer; <code>setExpandedElements</code> is used during the restore. | |
| 1209 * </p> | |
| 1210 * | |
| 1211 * @return the array of expanded elements | |
| 1212 * @see #setExpandedElements | |
| 1213 */ | |
| 1214 public Object[] getExpandedElements() { | |
| 1215 auto items = new ArraySeq!(Item); | |
| 1216 internalCollectExpandedItems(items, getControl()); | |
| 1217 auto result = new ArraySeq!(Object); | |
| 1218 result.capacity(items.size()); | |
| 1219 foreach ( item; items ) { | |
| 1220 Object data = item.getData(); | |
| 1221 if (data !is null) { | |
| 1222 result.append(data); | |
| 1223 } | |
| 1224 } | |
| 1225 return result.toArray(); | |
| 1226 } | |
| 1227 | |
| 1228 /** | |
| 1229 * Returns whether the node corresponding to the given element or tree path | |
| 1230 * is expanded or collapsed. | |
| 1231 * | |
| 1232 * @param elementOrTreePath | |
| 1233 * the element | |
| 1234 * @return <code>true</code> if the node is expanded, and | |
| 1235 * <code>false</code> if collapsed | |
| 1236 */ | |
| 1237 public bool getExpandedState(Object elementOrTreePath) { | |
| 1238 Assert.isNotNull(elementOrTreePath); | |
| 1239 Widget item = internalGetWidgetToSelect(elementOrTreePath); | |
| 1240 if ( auto i = cast(Item)item ) { | |
| 1241 return getExpanded(i); | |
| 1242 } | |
| 1243 return false; | |
| 1244 } | |
| 1245 | |
| 1246 /** | |
| 1247 * Returns the number of child items of the given DWT control. | |
| 1248 * | |
| 1249 * @param control | |
| 1250 * the control | |
| 1251 * @return the number of children | |
| 1252 */ | |
| 1253 protected abstract int getItemCount(Control control); | |
| 1254 | |
| 1255 /** | |
| 1256 * Returns the number of child items of the given DWT item. | |
| 1257 * | |
| 1258 * @param item | |
| 1259 * the item | |
| 1260 * @return the number of children | |
| 1261 */ | |
| 1262 protected abstract int getItemCount(Item item); | |
| 1263 | |
| 1264 /** | |
| 1265 * Returns the child items of the given DWT item. | |
| 1266 * | |
| 1267 * @param item | |
| 1268 * the item | |
| 1269 * @return the child items | |
| 1270 */ | |
| 1271 protected abstract Item[] getItems(Item item); | |
| 1272 | |
| 1273 /** | |
| 1274 * Returns the item after the given item in the tree, or <code>null</code> | |
| 1275 * if there is no next item. | |
| 1276 * | |
| 1277 * @param item | |
| 1278 * the item | |
| 1279 * @param includeChildren | |
| 1280 * <code>true</code> if the children are considered in | |
| 1281 * determining which item is next, and <code>false</code> if | |
| 1282 * subtrees are ignored | |
| 1283 * @return the next item, or <code>null</code> if none | |
| 1284 */ | |
| 1285 protected Item getNextItem(Item item, bool includeChildren) { | |
| 1286 if (item is null) { | |
| 1287 return null; | |
| 1288 } | |
| 1289 if (includeChildren && getExpanded(item)) { | |
| 1290 Item[] children = getItems(item); | |
| 1291 if (children !is null && children.length > 0) { | |
| 1292 return children[0]; | |
| 1293 } | |
| 1294 } | |
| 1295 | |
| 1296 // next item is either next sibling or next sibling of first | |
| 1297 // parent that has a next sibling. | |
| 1298 Item parent = getParentItem(item); | |
| 1299 if (parent is null) { | |
| 1300 return null; | |
| 1301 } | |
| 1302 Item[] siblings = getItems(parent); | |
| 1303 if (siblings !is null) { | |
| 1304 if (siblings.length <= 1) { | |
| 1305 return getNextItem(parent, false); | |
| 1306 } | |
| 1307 | |
| 1308 for (int i = 0; i < siblings.length; i++) { | |
| 1309 if (siblings[i] is item && i < (siblings.length - 1)) { | |
| 1310 return siblings[i + 1]; | |
| 1311 } | |
| 1312 } | |
| 1313 } | |
| 1314 return getNextItem(parent, false); | |
| 1315 } | |
| 1316 | |
| 1317 /** | |
| 1318 * Returns the parent item of the given item in the tree, or | |
| 1319 * <code>null</code> if there is no parent item. | |
| 1320 * | |
| 1321 * @param item | |
| 1322 * the item | |
| 1323 * @return the parent item, or <code>null</code> if none | |
| 1324 */ | |
| 1325 protected abstract Item getParentItem(Item item); | |
| 1326 | |
| 1327 /** | |
| 1328 * Returns the item before the given item in the tree, or <code>null</code> | |
| 1329 * if there is no previous item. | |
| 1330 * | |
| 1331 * @param item | |
| 1332 * the item | |
| 1333 * @return the previous item, or <code>null</code> if none | |
| 1334 */ | |
| 1335 protected Item getPreviousItem(Item item) { | |
| 1336 // previous item is either right-most visible descendent of previous | |
| 1337 // sibling or parent | |
| 1338 Item parent = getParentItem(item); | |
| 1339 if (parent is null) { | |
| 1340 return null; | |
| 1341 } | |
| 1342 Item[] siblings = getItems(parent); | |
| 1343 if (siblings.length is 0 || siblings[0] is item) { | |
| 1344 return parent; | |
| 1345 } | |
| 1346 Item previous = siblings[0]; | |
| 1347 for (int i = 1; i < siblings.length; i++) { | |
| 1348 if (siblings[i] is item) { | |
| 1349 return rightMostVisibleDescendent(previous); | |
| 1350 } | |
| 1351 previous = siblings[i]; | |
| 1352 } | |
| 1353 return null; | |
| 1354 } | |
| 1355 | |
| 1356 /* (non-Javadoc) Method declared on StructuredViewer. */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
1357 protected override Object[] getRawChildren(Object parentElementOrTreePath) { |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1358 bool oldBusy = isBusy(); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1359 setBusy(true); |
| 10 | 1360 try { |
| 1361 Object parent; | |
| 1362 TreePath path; | |
| 1363 if ( auto p = cast(TreePath)parentElementOrTreePath ) { | |
| 1364 path = p; | |
| 1365 parent = path.getLastSegment(); | |
| 1366 } else { | |
| 1367 parent = parentElementOrTreePath; | |
| 1368 path = null; | |
| 1369 } | |
| 1370 if (parent !is null) { | |
| 1371 if (opEquals(parent, getRoot())) { | |
| 1372 return super.getRawChildren(parent); | |
| 1373 } | |
| 1374 IContentProvider cp = getContentProvider(); | |
| 1375 if ( auto tpcp = cast(ITreePathContentProvider)cp ) { | |
| 1376 if (path is null) { | |
| 1377 // A path was not provided so try and find one | |
| 1378 Widget w = findItem(parent); | |
| 1379 if ( auto item = cast(Item)w ) { | |
| 1380 path = getTreePathFromItem(item); | |
| 1381 } | |
| 1382 if (path is null) { | |
| 1383 path = new TreePath([parent ]); | |
| 1384 } | |
| 1385 } | |
| 1386 Object[] result = tpcp.getChildren(path); | |
| 1387 if (result !is null) { | |
| 1388 return result; | |
| 1389 } | |
| 1390 } else if ( auto tcp = cast(ITreeContentProvider)cp ) { | |
| 1391 Object[] result = tcp.getChildren(parent); | |
| 1392 if (result !is null) { | |
| 1393 return result; | |
| 1394 } | |
| 1395 } | |
| 1396 } | |
| 1397 return null; | |
| 1398 } finally { | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1399 setBusy(oldBusy); |
| 10 | 1400 } |
| 1401 } | |
| 1402 | |
| 1403 /** | |
| 1404 * Returns all selected items for the given DWT control. | |
| 1405 * | |
| 1406 * @param control | |
| 1407 * the control | |
| 1408 * @return the list of selected items | |
| 1409 */ | |
| 1410 protected abstract Item[] getSelection(Control control); | |
| 1411 | |
| 1412 /* | |
| 1413 * (non-Javadoc) | |
| 1414 * | |
| 1415 * @see dwtx.jface.viewers.StructuredViewer#getSelectionFromWidget() | |
| 1416 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
1417 protected override SeqView!(Object) getSelectionFromWidget() { |
| 10 | 1418 Widget[] items = getSelection(getControl()); |
| 1419 ArraySeq!(Object) list = new ArraySeq!(Object); | |
| 1420 list.capacity(items.length); | |
| 1421 for (int i = 0; i < items.length; i++) { | |
| 1422 Widget item = items[i]; | |
| 1423 Object e = item.getData(); | |
| 1424 if (e !is null) { | |
| 1425 list.append(e); | |
| 1426 } | |
| 1427 } | |
| 1428 return list; | |
| 1429 } | |
| 1430 | |
| 1431 /* | |
| 1432 * Overridden in AbstractTreeViewer to fix bug 108102 (code copied from | |
| 1433 * StructuredViewer to avoid introducing new API) (non-Javadoc) | |
| 1434 * | |
| 1435 * @see dwtx.jface.viewers.StructuredViewer#handleDoubleSelect(dwt.events.SelectionEvent) | |
| 1436 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
1437 protected override void handleDoubleSelect(SelectionEvent event) { |
| 10 | 1438 // handle case where an earlier selection listener disposed the control. |
| 1439 Control control = getControl(); | |
| 1440 if (control !is null && !control.isDisposed()) { | |
| 1441 // If the double-clicked element can be obtained from the event, use | |
| 1442 // it | |
| 1443 // otherwise get it from the control. Some controls like List do | |
| 1444 // not have the notion of item. | |
| 1445 // For details, see bug 90161 [Navigator] DefaultSelecting folders | |
| 1446 // shouldn't always expand first one | |
| 1447 ISelection selection; | |
| 1448 if (event.item !is null && event.item.getData() !is null) { | |
| 1449 | |
| 1450 // changes to fix bug 108102 follow | |
| 1451 TreePath treePath = getTreePathFromItem(cast(Item) event.item); | |
| 1452 selection = new TreeSelection(treePath); | |
| 1453 // end of changes | |
| 1454 | |
| 1455 } else { | |
| 1456 selection = getSelection(); | |
| 1457 updateSelection(selection); | |
| 1458 } | |
| 1459 fireDoubleClick(new DoubleClickEvent(this, selection)); | |
| 1460 } | |
| 1461 } | |
| 1462 | |
| 1463 /** | |
| 1464 * Handles a tree collapse event from the DWT widget. | |
| 1465 * | |
| 1466 * @param event | |
| 1467 * the DWT tree event | |
| 1468 */ | |
| 1469 protected void handleTreeCollapse(TreeEvent event) { | |
| 1470 if (event.item.getData() !is null) { | |
| 1471 fireTreeCollapsed(new TreeExpansionEvent(this, event.item.getData())); | |
| 1472 } | |
| 1473 } | |
| 1474 | |
| 1475 /** | |
| 1476 * Handles a tree expand event from the DWT widget. | |
| 1477 * | |
| 1478 * @param event | |
| 1479 * the DWT tree event | |
| 1480 */ | |
| 1481 protected void handleTreeExpand(TreeEvent event) { | |
| 1482 createChildren(event.item); | |
| 1483 if (event.item.getData() !is null) { | |
| 1484 fireTreeExpanded(new TreeExpansionEvent(this, event.item.getData())); | |
| 1485 } | |
| 1486 } | |
| 1487 | |
| 1488 /* (non-Javadoc) Method declared on Viewer. */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
1489 protected override void hookControl(Control control) { |
| 10 | 1490 super.hookControl(control); |
| 1491 addTreeListener(control, new class TreeListener { | |
| 1492 public void treeExpanded(TreeEvent event) { | |
| 1493 handleTreeExpand(event); | |
| 1494 } | |
| 1495 | |
| 1496 public void treeCollapsed(TreeEvent event) { | |
| 1497 handleTreeCollapse(event); | |
| 1498 } | |
| 1499 }); | |
| 1500 } | |
| 1501 | |
| 1502 /* | |
| 1503 * (non-Javadoc) Method declared on StructuredViewer. Builds the initial | |
| 1504 * tree and handles the automatic expand feature. | |
| 1505 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
1506 protected override void inputChanged(Object input, Object oldInput) { |
| 10 | 1507 preservingSelection(new class Runnable { |
| 1508 public void run() { | |
| 1509 Control tree = getControl(); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1510 tree.setRedraw(false); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1511 try { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1512 removeAll(tree); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1513 tree.setData(getRoot()); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1514 internalInitializeTree(tree); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1515 } finally { |
| 10 | 1516 tree.setRedraw(true); |
| 1517 } | |
| 1518 } | |
| 1519 }); | |
| 1520 } | |
| 1521 | |
| 1522 /** | |
| 1523 * Initializes the tree with root items, expanding to the appropriate | |
| 1524 * level if necessary. | |
| 1525 * | |
| 1526 * @param tree the tree control | |
| 1527 * @since 3.3 | |
| 1528 */ | |
| 1529 protected void internalInitializeTree(Control tree) { | |
| 1530 createChildren(tree); | |
| 1531 internalExpandToLevel(tree, expandToLevel_); | |
| 1532 } | |
| 1533 | |
| 1534 /** | |
| 1535 * Recursively collapses the subtree rooted at the given widget to the given | |
| 1536 * level. | |
| 1537 * <p> | |
| 1538 * </p> | |
| 1539 * Note that the default implementation of this method does not call | |
| 1540 * <code>setRedraw</code>. | |
| 1541 * | |
| 1542 * @param widget | |
| 1543 * the widget | |
| 1544 * @param level | |
| 1545 * non-negative level, or <code>ALL_LEVELS</code> to collapse | |
| 1546 * all levels of the tree | |
| 1547 */ | |
| 1548 protected void internalCollapseToLevel(Widget widget, int level) { | |
| 1549 if (level is ALL_LEVELS || level > 0) { | |
| 1550 | |
| 1551 if ( auto i = cast(Item)widget ) { | |
| 1552 setExpanded(i, false); | |
| 1553 } | |
| 1554 | |
| 1555 if (level is ALL_LEVELS || level > 1) { | |
| 1556 Item[] children = getChildren(widget); | |
| 1557 if (children !is null) { | |
| 1558 int nextLevel = (level is ALL_LEVELS ? ALL_LEVELS | |
| 1559 : level - 1); | |
| 1560 for (int i = 0; i < children.length; i++) { | |
| 1561 internalCollapseToLevel(children[i], nextLevel); | |
| 1562 } | |
| 1563 } | |
| 1564 } | |
| 1565 } | |
| 1566 } | |
| 1567 | |
| 1568 /** | |
| 1569 * Recursively collects all expanded items from the given widget. | |
| 1570 * | |
| 1571 * @param result | |
| 1572 * a list (element type: <code>Item</code>) into which to | |
| 1573 * collect the elements | |
| 1574 * @param widget | |
| 1575 * the widget | |
| 1576 */ | |
| 1577 private void internalCollectExpandedItems(Seq!(Item) result, Widget widget) { | |
| 1578 Item[] items = getChildren(widget); | |
| 1579 for (int i = 0; i < items.length; i++) { | |
| 1580 Item item = items[i]; | |
| 1581 if (getExpanded(item)) { | |
| 1582 result.append(item); | |
| 1583 } | |
| 1584 internalCollectExpandedItems(result, item); | |
| 1585 } | |
| 1586 } | |
| 1587 | |
| 1588 /** | |
| 1589 * Tries to create a path of tree items for the given element or tree path. | |
| 1590 * This method recursively walks up towards the root of the tree and in the | |
| 1591 * case of an element (rather than a tree path) assumes that | |
| 1592 * <code>getParent</code> returns the correct parent of an element. | |
| 1593 * | |
| 1594 * @param elementOrPath | |
| 1595 * the element | |
| 1596 * @param expand | |
| 1597 * <code>true</code> if all nodes on the path should be | |
| 1598 * expanded, and <code>false</code> otherwise | |
| 1599 * @return Widget | |
| 1600 */ | |
| 1601 protected Widget internalExpand(Object elementOrPath, bool expand) { | |
| 1602 | |
| 1603 if (elementOrPath is null) { | |
| 1604 return null; | |
| 1605 } | |
| 1606 | |
| 1607 Widget w = internalGetWidgetToSelect(elementOrPath); | |
| 1608 if (w is null) { | |
| 1609 if (opEquals(elementOrPath, getRoot())) { // stop at root | |
| 1610 return null; | |
| 1611 } | |
| 1612 // my parent has to create me | |
| 1613 Object parent = getParentElement(elementOrPath); | |
| 1614 if (parent !is null) { | |
| 1615 Widget pw = internalExpand(parent, false); | |
| 1616 if (pw !is null) { | |
| 1617 // let my parent create me | |
| 1618 createChildren(pw); | |
| 1619 Object element = internalToElement(elementOrPath); | |
| 1620 w = internalFindChild(pw, element); | |
| 1621 if (expand && null !is cast(Item)pw ) { | |
| 1622 // expand parent items top-down | |
| 1623 Item item = cast(Item) pw; | |
| 1624 auto toExpandList = new LinkSeq!(Item); | |
| 1625 while (item !is null && !getExpanded(item)) { | |
| 1626 toExpandList.prepend(item); | |
| 1627 item = getParentItem(item); | |
| 1628 } | |
| 1629 foreach( toExpand; toExpandList ){ | |
| 1630 setExpanded(toExpand, true); | |
| 1631 } | |
| 1632 } | |
| 1633 } | |
| 1634 } | |
| 1635 } | |
| 1636 return w; | |
| 1637 } | |
| 1638 | |
| 1639 /** | |
| 1640 * If the argument is a tree path, returns its last segment, otherwise | |
| 1641 * return the argument | |
| 1642 * | |
| 1643 * @param elementOrPath | |
| 1644 * an element or a tree path | |
| 1645 * @return the element, or the last segment of the tree path | |
| 1646 */ | |
| 1647 private Object internalToElement(Object elementOrPath) { | |
| 1648 if (auto tp = cast(TreePath)elementOrPath ) { | |
| 1649 return tp.getLastSegment(); | |
| 1650 } | |
| 1651 return elementOrPath; | |
| 1652 } | |
| 1653 | |
| 1654 /** | |
| 1655 * This method takes a tree path or an element. If the argument is not a | |
| 1656 * tree path, returns the parent of the given element or <code>null</code> | |
| 1657 * if the parent is not known. If the argument is a tree path with more than | |
| 1658 * one segment, returns its parent tree path, otherwise returns | |
| 1659 * <code>null</code>. | |
| 1660 * | |
| 1661 * @param elementOrTreePath | |
| 1662 * @return the parent element, or parent path, or <code>null</code> | |
| 1663 * | |
| 1664 * @since 3.2 | |
| 1665 */ | |
| 1666 protected Object getParentElement(Object elementOrTreePath) { | |
| 1667 if (auto tp = cast(TreePath)elementOrTreePath) { | |
| 1668 return tp.getParentPath(); | |
| 1669 } | |
| 1670 IContentProvider cp = getContentProvider(); | |
| 1671 if ( auto tpcp = cast(ITreePathContentProvider)cp ) { | |
| 1672 TreePath[] paths = tpcp.getParents(elementOrTreePath); | |
| 1673 if (paths.length > 0) { | |
| 1674 if (paths[0].getSegmentCount() is 0) { | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1675 return getRoot(); |
| 10 | 1676 } |
| 1677 return paths[0].getLastSegment(); | |
| 1678 } | |
| 1679 } | |
| 1680 if ( auto tcp = cast(ITreeContentProvider) cp ) { | |
| 1681 return tcp.getParent(elementOrTreePath); | |
| 1682 } | |
| 1683 return null; | |
| 1684 } | |
| 1685 | |
| 1686 /** | |
| 1687 * Returns the widget to be selected for the given element or tree path. | |
| 1688 * | |
| 1689 * @param elementOrTreePath | |
| 1690 * the element or tree path to select | |
| 1691 * @return the widget to be selected, or <code>null</code> if not found | |
| 1692 * | |
| 1693 * @since 3.1 | |
| 1694 */ | |
| 1695 protected Widget internalGetWidgetToSelect(Object elementOrTreePath) { | |
| 1696 if ( auto treePath = cast(TreePath) elementOrTreePath ) { | |
| 1697 if (treePath.getSegmentCount() is 0) { | |
| 1698 return getControl(); | |
| 1699 } | |
| 1700 Widget[] candidates = findItems(treePath.getLastSegment()); | |
| 1701 for (int i = 0; i < candidates.length; i++) { | |
| 1702 Widget candidate = candidates[i]; | |
| 1703 if (!(cast(Item)candidate )) { | |
| 1704 continue; | |
| 1705 } | |
| 1706 if (treePath.opEquals(getTreePathFromItem(cast(Item) candidate), | |
| 1707 getComparer())) { | |
| 1708 return candidate; | |
| 1709 } | |
| 1710 } | |
| 1711 return null; | |
| 1712 } | |
| 1713 return findItem(elementOrTreePath); | |
| 1714 } | |
| 1715 | |
| 1716 /** | |
| 1717 * Recursively expands the subtree rooted at the given widget to the given | |
| 1718 * level. | |
| 1719 * <p> | |
| 1720 * </p> | |
| 1721 * Note that the default implementation of this method does not call | |
| 1722 * <code>setRedraw</code>. | |
| 1723 * | |
| 1724 * @param widget | |
| 1725 * the widget | |
| 1726 * @param level | |
| 1727 * non-negative level, or <code>ALL_LEVELS</code> to collapse | |
| 1728 * all levels of the tree | |
| 1729 */ | |
| 1730 protected void internalExpandToLevel(Widget widget, int level) { | |
| 1731 if (level is ALL_LEVELS || level > 0) { | |
| 1732 if ( cast(Item)widget && widget.getData() !is null | |
| 1733 && !isExpandable(cast(Item) widget, null, widget.getData())) { | |
| 1734 return; | |
| 1735 } | |
| 1736 createChildren(widget); | |
| 1737 if ( auto i = cast(Item)widget ) { | |
| 1738 setExpanded(i, true); | |
| 1739 } | |
| 1740 if (level is ALL_LEVELS || level > 1) { | |
| 1741 Item[] children = getChildren(widget); | |
| 1742 if (children !is null) { | |
| 1743 int newLevel = (level is ALL_LEVELS ? ALL_LEVELS | |
| 1744 : level - 1); | |
| 1745 for (int i = 0; i < children.length; i++) { | |
| 1746 internalExpandToLevel(children[i], newLevel); | |
| 1747 } | |
| 1748 } | |
| 1749 } | |
| 1750 } | |
| 1751 } | |
| 1752 | |
| 1753 /** | |
| 1754 * Non-recursively tries to find the given element as a child of the given | |
| 1755 * parent (item or tree). | |
| 1756 * | |
| 1757 * @param parent | |
| 1758 * the parent item | |
| 1759 * @param element | |
| 1760 * the element | |
| 1761 * @return Widget | |
| 1762 */ | |
| 1763 private Widget internalFindChild(Widget parent, Object element) { | |
| 1764 Item[] items = getChildren(parent); | |
| 1765 for (int i = 0; i < items.length; i++) { | |
| 1766 Item item = items[i]; | |
| 1767 Object data = item.getData(); | |
| 1768 if (data !is null && opEquals(data, element)) { | |
| 1769 return item; | |
| 1770 } | |
| 1771 } | |
| 1772 return null; | |
| 1773 } | |
| 1774 | |
| 1775 /** | |
| 1776 * Recursively tries to find the given element. | |
| 1777 * | |
| 1778 * @param parent | |
| 1779 * the parent item | |
| 1780 * @param element | |
| 1781 * the element | |
| 1782 * @return Widget | |
| 1783 */ | |
| 1784 private Widget internalFindItem(Item parent, Object element) { | |
| 1785 | |
| 1786 // compare with node | |
| 1787 Object data = parent.getData(); | |
| 1788 if (data !is null) { | |
| 1789 if (opEquals(data, element)) { | |
| 1790 return parent; | |
| 1791 } | |
| 1792 } | |
| 1793 // recurse over children | |
| 1794 Item[] items = getChildren(parent); | |
| 1795 for (int i = 0; i < items.length; i++) { | |
| 1796 Item item = items[i]; | |
| 1797 Widget o = internalFindItem(item, element); | |
| 1798 if (o !is null) { | |
| 1799 return o; | |
| 1800 } | |
| 1801 } | |
| 1802 return null; | |
| 1803 } | |
| 1804 | |
| 1805 /* (non-Javadoc) Method declared on StructuredViewer. */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
1806 protected override void internalRefresh(Object element) { |
| 10 | 1807 internalRefresh(element, true); |
| 1808 } | |
| 1809 | |
| 1810 /* (non-Javadoc) Method declared on StructuredViewer. */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
1811 protected override void internalRefresh(Object element, bool updateLabels) { |
| 10 | 1812 // If element is null, do a full refresh. |
| 1813 if (element is null) { | |
| 1814 internalRefresh(getControl(), getRoot(), true, updateLabels); | |
| 1815 return; | |
| 1816 } | |
| 1817 Widget[] items = findItems(element); | |
| 1818 if (items.length !is 0) { | |
| 1819 for (int i = 0; i < items.length; i++) { | |
| 1820 // pick up structure changes too | |
| 1821 internalRefresh(items[i], element, true, updateLabels); | |
| 1822 } | |
| 1823 } | |
| 1824 } | |
| 1825 | |
| 1826 /** | |
| 1827 * Refreshes the tree starting at the given widget. | |
| 1828 * <p> | |
| 1829 * EXPERIMENTAL. Not to be used except by JDT. This method was added to | |
| 1830 * support JDT's explorations into grouping by working sets, which requires | |
| 1831 * viewers to support multiple equal elements. See bug 76482 for more | |
| 1832 * details. This support will likely be removed in Eclipse 3.2 in favor of | |
| 1833 * proper support for multiple equal elements. | |
| 1834 * </p> | |
| 1835 * | |
| 1836 * @param widget | |
| 1837 * the widget | |
| 1838 * @param element | |
| 1839 * the element | |
| 1840 * @param doStruct | |
| 1841 * <code>true</code> if structural changes are to be picked up, | |
| 1842 * and <code>false</code> if only label provider changes are of | |
| 1843 * interest | |
| 1844 * @param updateLabels | |
| 1845 * <code>true</code> to update labels for existing elements, | |
| 1846 * <code>false</code> to only update labels as needed, assuming | |
| 1847 * that labels for existing elements are unchanged. | |
| 1848 * @since 3.1 | |
| 1849 */ | |
| 1850 protected void internalRefresh(Widget widget, Object element, | |
| 1851 bool doStruct, bool updateLabels) { | |
| 1852 | |
| 1853 if ( auto i = cast(Item)widget ) { | |
| 1854 if (doStruct) { | |
| 1855 updatePlus(i, element); | |
| 1856 } | |
| 1857 if (updateLabels || !opEquals(element, widget.getData())) { | |
| 1858 doUpdateItem(widget, element, true); | |
| 1859 } else { | |
| 1860 associate(element, cast(Item) widget); | |
| 1861 } | |
| 1862 } | |
| 1863 | |
| 1864 if (doStruct) { | |
| 1865 internalRefreshStruct(widget, element, updateLabels); | |
| 1866 } else { | |
| 1867 Item[] children = getChildren(widget); | |
| 1868 if (children !is null) { | |
| 1869 for (int i = 0; i < children.length; i++) { | |
| 1870 Widget item = children[i]; | |
| 1871 Object data = item.getData(); | |
| 1872 if (data !is null) { | |
| 1873 internalRefresh(item, data, doStruct, updateLabels); | |
| 1874 } | |
| 1875 } | |
| 1876 } | |
| 1877 } | |
| 1878 } | |
| 1879 | |
| 1880 /** | |
| 1881 * Update the structure and recurse. Items are updated in updateChildren, as | |
| 1882 * needed. | |
| 1883 * | |
| 1884 * @param widget | |
| 1885 * @param element | |
| 1886 * @param updateLabels | |
| 1887 */ | |
| 1888 /* package */void internalRefreshStruct(Widget widget, Object element, | |
| 1889 bool updateLabels) { | |
| 1890 updateChildren(widget, element, null, updateLabels); | |
| 1891 Item[] children = getChildren(widget); | |
| 1892 if (children !is null) { | |
| 1893 for (int i = 0; i < children.length; i++) { | |
| 1894 Widget item = children[i]; | |
| 1895 Object data = item.getData(); | |
| 1896 if (data !is null) { | |
| 1897 internalRefreshStruct(item, data, updateLabels); | |
| 1898 } | |
| 1899 } | |
| 1900 } | |
| 1901 } | |
| 1902 | |
| 1903 /** | |
| 1904 * Removes the given elements from this viewer. | |
| 1905 * <p> | |
| 1906 * EXPERIMENTAL. Not to be used except by JDT. This method was added to | |
| 1907 * support JDT's explorations into grouping by working sets, which requires | |
| 1908 * viewers to support multiple equal elements. See bug 76482 for more | |
| 1909 * details. This support will likely be removed in Eclipse 3.2 in favor of | |
| 1910 * proper support for multiple equal elements. | |
| 1911 * </p> | |
| 1912 * | |
| 1913 * @param elementsOrPaths | |
| 1914 * the elements or element paths to remove | |
| 1915 * @since 3.1 | |
| 1916 */ | |
| 1917 protected void internalRemove(Object[] elementsOrPaths) { | |
| 1918 Object input = getInput(); | |
| 1919 for (int i = 0; i < elementsOrPaths.length; ++i) { | |
| 1920 Object element = elementsOrPaths[i]; | |
| 1921 if (opEquals(element, input)) { | |
| 1922 setInput(null); | |
| 1923 return; | |
| 1924 } | |
| 1925 Widget[] childItems = internalFindItems(element); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1926 if (childItems.length > 0) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1927 for (int j = 0; j < childItems.length; j++) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1928 Widget childItem = childItems[j]; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1929 if ( auto it = cast(Item)childItem ) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1930 disassociate(it); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1931 childItem.dispose(); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1932 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1933 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1934 } else { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1935 // see https://bugs.eclipse.org/bugs/show_bug.cgi?id=210747 |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1936 Object parent = getParentElement(element); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1937 if (parent !is null |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1938 && !equals(parent, getRoot()) |
| 71 | 1939 && !((null !is cast(TreePath)parent) && (cast(TreePath) parent) |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1940 .getSegmentCount() is 0)) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1941 Widget[] parentItems = internalFindItems(parent); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1942 for (int j = 0; j < parentItems.length; j++) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1943 Widget parentItem = parentItems[j]; |
| 71 | 1944 if (null !is cast(Item)parentItem ) { |
| 1945 updatePlus(cast(Item) parentItem, parent); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1946 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1947 } |
| 10 | 1948 } |
| 1949 } | |
| 1950 } | |
| 1951 } | |
| 1952 | |
| 1953 /** | |
| 1954 * Removes the given elements from this viewer, whenever those elements | |
| 1955 * appear as children of the given parent. | |
| 1956 * | |
| 1957 * @param parent the parent element | |
| 1958 * @param elements | |
| 1959 * the elements to remove | |
| 1960 * @since 3.1 | |
| 1961 */ | |
| 1962 protected void internalRemove(Object parent, Object[] elements) { | |
| 1963 | |
| 1964 CustomHashtable toRemove = new CustomHashtable(getComparer()); | |
| 1965 for (int i = 0; i < elements.length; i++) { | |
| 1966 toRemove.put(elements[i], elements[i]); | |
| 1967 } | |
| 1968 | |
| 1969 // Find each place the parent appears in the tree | |
| 1970 Widget[] parentItemArray = findItems(parent); | |
| 1971 for (int i = 0; i < parentItemArray.length; i++) { | |
| 1972 Widget parentItem = parentItemArray[i]; | |
| 1973 | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1974 // May happen if parent element is a descendent of of a previously |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1975 // removed element |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1976 if (parentItem.isDisposed()) |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1977 continue; |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1978 |
| 10 | 1979 // Iterate over the child items and remove each one |
| 1980 Item[] children = getChildren(parentItem); | |
| 1981 | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1982 if (children.length is 1 && children[0].getData() is null && |
| 71 | 1983 (null !is cast(Item)parentItem )) { // dummy node |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1984 // Remove plus if parent element has no children |
| 71 | 1985 updatePlus(cast(Item) parentItem, parent); |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1986 } else { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1987 for (int j = 0; j < children.length; j++) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1988 Item child = children[j]; |
| 10 | 1989 |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1990 Object data = child.getData(); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1991 if (data !is null && toRemove.containsKey(data)) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1992 disassociate(child); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1993 child.dispose(); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
1994 } |
| 10 | 1995 } |
| 1996 } | |
| 1997 } | |
| 1998 } | |
| 1999 | |
| 2000 /** | |
| 2001 * Sets the expanded state of all items to correspond to the given set of | |
| 2002 * expanded elements. | |
| 2003 * | |
| 2004 * @param expandedElements | |
| 2005 * the set (element type: <code>Object</code>) of elements | |
| 2006 * which are expanded | |
| 2007 * @param widget | |
| 2008 * the widget | |
| 2009 */ | |
| 2010 private void internalSetExpanded(CustomHashtable expandedElements, | |
| 2011 Widget widget) { | |
| 2012 Item[] items = getChildren(widget); | |
| 2013 for (int i = 0; i < items.length; i++) { | |
| 2014 Item item = items[i]; | |
| 2015 Object data = item.getData(); | |
| 2016 if (data !is null) { | |
| 2017 // remove the element to avoid an infinite loop | |
| 2018 // if the same element appears on a child item | |
| 2019 bool expanded = expandedElements.remove(data) !is null; | |
| 2020 if (expanded !is getExpanded(item)) { | |
| 2021 if (expanded) { | |
| 2022 createChildren(item); | |
| 2023 } | |
| 2024 setExpanded(item, expanded); | |
| 2025 } | |
| 2026 } | |
| 2027 if (expandedElements.size() > 0) { | |
| 2028 internalSetExpanded(expandedElements, item); | |
| 2029 } | |
| 2030 } | |
| 2031 } | |
| 2032 | |
| 2033 /** | |
| 2034 * Sets the expanded state of all items to correspond to the given set of | |
| 2035 * expanded tree paths. | |
| 2036 * | |
| 2037 * @param expandedTreePaths | |
| 2038 * the set (element type: <code>TreePath</code>) of elements | |
| 2039 * which are expanded | |
| 2040 * @param widget | |
| 2041 * the widget | |
| 2042 */ | |
| 2043 private void internalSetExpandedTreePaths( | |
| 2044 CustomHashtable expandedTreePaths, Widget widget, | |
| 2045 TreePath currentPath) { | |
| 2046 Item[] items = getChildren(widget); | |
| 2047 for (int i = 0; i < items.length; i++) { | |
| 2048 Item item = items[i]; | |
| 2049 Object data = item.getData(); | |
| 2050 TreePath childPath = data is null ? null : currentPath | |
| 2051 .createChildPath(data); | |
| 2052 if (data !is null && childPath !is null) { | |
| 2053 // remove the element to avoid an infinite loop | |
| 2054 // if the same element appears on a child item | |
| 2055 bool expanded = expandedTreePaths.remove(childPath) !is null; | |
| 2056 if (expanded !is getExpanded(item)) { | |
| 2057 if (expanded) { | |
| 2058 createChildren(item); | |
| 2059 } | |
| 2060 setExpanded(item, expanded); | |
| 2061 } | |
| 2062 } | |
| 2063 internalSetExpandedTreePaths(expandedTreePaths, item, childPath); | |
| 2064 } | |
| 2065 } | |
| 2066 | |
| 2067 /** | |
| 2068 * Return whether the tree node representing the given element or path can | |
| 2069 * be expanded. Clients should query expandability by path if the viewer's | |
| 2070 * content provider is an {@link ITreePathContentProvider}. | |
| 2071 * <p> | |
| 2072 * The default implementation of this framework method calls | |
| 2073 * <code>hasChildren</code> on this viewer's content provider. It may be | |
| 2074 * overridden if necessary. | |
| 2075 * </p> | |
| 2076 * | |
| 2077 * @param elementOrTreePath | |
| 2078 * the element or path | |
| 2079 * @return <code>true</code> if the tree node representing the given | |
| 2080 * element can be expanded, or <code>false</code> if not | |
| 2081 */ | |
| 2082 public bool isExpandable(Object elementOrTreePath) { | |
| 2083 Object element; | |
| 2084 TreePath path; | |
| 2085 if (auto p = cast(TreePath)elementOrTreePath) { | |
| 2086 path = p; | |
| 2087 element = path.getLastSegment(); | |
| 2088 } else { | |
| 2089 element = elementOrTreePath; | |
| 2090 path = null; | |
| 2091 } | |
| 2092 IContentProvider cp = getContentProvider(); | |
| 2093 if ( auto tpcp = cast(ITreePathContentProvider) cp ) { | |
| 2094 if (path is null) { | |
| 2095 // A path was not provided so try and find one | |
| 2096 Widget w = findItem(element); | |
| 2097 if ( auto item = cast(Item)w ) { | |
| 2098 path = getTreePathFromItem(item); | |
| 2099 } | |
| 2100 if (path is null) { | |
| 2101 path = new TreePath([ element ]); | |
| 2102 } | |
| 2103 } | |
| 2104 return tpcp.hasChildren(path); | |
| 2105 } | |
| 2106 if (auto tcp = cast(ITreeContentProvider)cp ) { | |
| 2107 return tcp.hasChildren(element); | |
| 2108 } | |
| 2109 return false; | |
| 2110 } | |
| 2111 | |
| 2112 /** | |
| 2113 * Return whether the given element is expandable. | |
| 2114 * | |
| 2115 * @param item | |
| 2116 * the tree item for the element | |
| 2117 * @param parentPath | |
| 2118 * the parent path if it is known or <code>null</code> if it | |
| 2119 * needs to be determines | |
| 2120 * @param element | |
| 2121 * the element | |
| 2122 * @return whether the given element is expandable | |
| 2123 */ | |
| 2124 private bool isExpandable(Item item, TreePath parentPath, Object element) { | |
| 2125 Object elementOrTreePath = element; | |
| 2126 if (isTreePathContentProvider()) { | |
| 2127 if (parentPath !is null) { | |
| 2128 elementOrTreePath = parentPath.createChildPath(element); | |
| 2129 } else { | |
| 2130 elementOrTreePath = getTreePathFromItem(item); | |
| 2131 } | |
| 2132 } | |
| 2133 return isExpandable(elementOrTreePath); | |
| 2134 } | |
| 2135 | |
| 2136 /* (non-Javadoc) Method declared on Viewer. */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
2137 protected override void labelProviderChanged() { |
| 10 | 2138 // we have to walk the (visible) tree and update every item |
| 2139 Control tree = getControl(); | |
| 2140 tree.setRedraw(false); | |
| 2141 // don't pick up structure changes, but do force label updates | |
| 2142 internalRefresh(tree, getRoot(), false, true); | |
| 2143 tree.setRedraw(true); | |
| 2144 } | |
| 2145 | |
| 2146 /** | |
| 2147 * Creates a new item. | |
| 2148 * | |
| 2149 * @param parent | |
| 2150 * the parent widget | |
| 2151 * @param style | |
| 2152 * DWT style bits | |
| 2153 * @param index | |
| 2154 * if non-negative, indicates the position to insert the item | |
| 2155 * into its parent | |
| 2156 * @return the newly-created item | |
| 2157 */ | |
| 2158 protected abstract Item newItem(Widget parent, int style, int index); | |
| 2159 | |
| 2160 /** | |
| 2161 * Removes the given elements from this viewer. The selection is updated if | |
| 2162 * required. | |
| 2163 * <p> | |
| 2164 * This method should be called (by the content provider) when elements have | |
| 2165 * been removed from the model, in order to cause the viewer to accurately | |
| 2166 * reflect the model. This method only affects the viewer, not the model. | |
| 2167 * </p> | |
| 2168 * | |
| 2169 * @param elementsOrTreePaths | |
| 2170 * the elements to remove | |
| 2171 */ | |
| 2172 public void remove(Object[] elementsOrTreePaths) { | |
| 2173 assertElementsNotNull(elementsOrTreePaths); | |
| 2174 if (elementsOrTreePaths.length is 0) { | |
| 2175 return; | |
| 2176 } | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2177 if (checkBusy()) |
| 10 | 2178 return; |
| 39 | 2179 preservingSelection(new class(elementsOrTreePaths) Runnable { |
| 10 | 2180 Object[] elementsOrTreePaths_; |
| 39 | 2181 this(Object[] a){ |
| 2182 elementsOrTreePaths_=a; | |
| 10 | 2183 } |
| 2184 public void run() { | |
| 2185 internalRemove(elementsOrTreePaths_); | |
| 2186 } | |
| 2187 }); | |
| 2188 } | |
| 2189 | |
| 2190 /** | |
| 2191 * Removes the given elements from this viewer whenever they appear as | |
| 2192 * children of the given parent element. If the given elements also appear | |
| 2193 * as children of some other parent, the other parent will remain unchanged. | |
| 2194 * The selection is updated if required. | |
| 2195 * <p> | |
| 2196 * This method should be called (by the content provider) when elements have | |
| 2197 * been removed from the model, in order to cause the viewer to accurately | |
| 2198 * reflect the model. This method only affects the viewer, not the model. | |
| 2199 * </p> | |
| 2200 * | |
| 2201 * @param parent | |
| 2202 * the parent of the elements to remove | |
| 2203 * @param elements | |
| 2204 * the elements to remove | |
| 2205 * | |
| 2206 * @since 3.2 | |
| 2207 */ | |
| 2208 public void remove(Object parent, Object[] elements) { | |
| 2209 assertElementsNotNull(elements); | |
| 2210 if (elements.length is 0) { | |
| 2211 return; | |
| 2212 } | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2213 if (checkBusy()) |
| 10 | 2214 return; |
| 39 | 2215 preservingSelection(new class(parent,elements) Runnable { |
| 10 | 2216 Object parent_; |
| 2217 Object[] elements_; | |
| 39 | 2218 this(Object a,Object[] b){ |
| 2219 parent_=a; | |
| 2220 elements_=b; | |
| 10 | 2221 } |
| 2222 public void run() { | |
| 2223 internalRemove(parent_, elements_); | |
| 2224 } | |
| 2225 }); | |
| 2226 } | |
| 2227 | |
| 2228 /** | |
| 2229 * Removes the given element from the viewer. The selection is updated if | |
| 2230 * necessary. | |
| 2231 * <p> | |
| 2232 * This method should be called (by the content provider) when a single | |
| 2233 * element has been removed from the model, in order to cause the viewer to | |
| 2234 * accurately reflect the model. This method only affects the viewer, not | |
| 2235 * the model. Note that there is another method for efficiently processing | |
| 2236 * the simultaneous removal of multiple elements. | |
| 2237 * </p> | |
| 2238 * | |
| 2239 * @param elementsOrTreePaths | |
| 2240 * the element | |
| 2241 */ | |
| 2242 public void remove(Object elementsOrTreePaths) { | |
| 2243 remove([ elementsOrTreePaths ]); | |
| 2244 } | |
| 2245 | |
| 2246 /** | |
| 2247 * Removes all items from the given control. | |
| 2248 * | |
| 2249 * @param control | |
| 2250 * the control | |
| 2251 */ | |
| 2252 protected abstract void removeAll(Control control); | |
| 2253 | |
| 2254 /** | |
| 2255 * Removes a listener for expand and collapse events in this viewer. Has no | |
| 2256 * affect if an identical listener is not registered. | |
| 2257 * | |
| 2258 * @param listener | |
| 2259 * a tree viewer listener | |
| 2260 */ | |
| 2261 public void removeTreeListener(ITreeViewerListener listener) { | |
| 2262 treeListeners.remove(cast(Object)listener); | |
| 2263 } | |
| 2264 | |
| 2265 /** | |
| 2266 * This implementation of reveal() reveals the given element or tree path. | |
| 2267 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
2268 public override void reveal(Object elementOrTreePath) { |
| 10 | 2269 Assert.isNotNull(elementOrTreePath); |
| 2270 Widget w = internalExpand(elementOrTreePath, true); | |
| 2271 if ( auto item = cast(Item)w ) { | |
| 2272 showItem(item); | |
| 2273 } | |
| 2274 } | |
| 2275 | |
| 2276 /** | |
| 2277 * Returns the rightmost visible descendent of the given item. Returns the | |
| 2278 * item itself if it has no children. | |
| 2279 * | |
| 2280 * @param item | |
| 2281 * the item to compute the descendent of | |
| 2282 * @return the rightmost visible descendent or the item itself if it has no | |
| 2283 * children | |
| 2284 */ | |
| 2285 private Item rightMostVisibleDescendent(Item item) { | |
| 2286 Item[] children = getItems(item); | |
| 2287 if (getExpanded(item) && children !is null && children.length > 0) { | |
| 2288 return rightMostVisibleDescendent(children[children.length - 1]); | |
| 2289 } | |
| 2290 return item; | |
| 2291 } | |
| 2292 | |
| 2293 /* (non-Javadoc) Method declared on Viewer. */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
2294 public override Item scrollDown(int x, int y) { |
| 10 | 2295 Item current = getItem(x, y); |
| 2296 if (current !is null) { | |
| 2297 Item next = getNextItem(current, true); | |
| 2298 showItem(next is null ? current : next); | |
| 2299 return next; | |
| 2300 } | |
| 2301 return null; | |
| 2302 } | |
| 2303 | |
| 2304 /* (non-Javadoc) Method declared on Viewer. */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
2305 public override Item scrollUp(int x, int y) { |
| 10 | 2306 Item current = getItem(x, y); |
| 2307 if (current !is null) { | |
| 2308 Item previous = getPreviousItem(current); | |
| 2309 showItem(previous is null ? current : previous); | |
| 2310 return previous; | |
| 2311 } | |
| 2312 return null; | |
| 2313 } | |
| 2314 | |
| 2315 /** | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2316 * Sets the auto-expand level to be used when the input of the viewer is set |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2317 * using {@link #setInput(Object)}. The value 0 means that there is no |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2318 * auto-expand; 1 means that the invisible root element is expanded (since |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2319 * most concrete subclasses do not show the root element, there is usually |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2320 * no practical difference between using the values 0 and 1); 2 means that |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2321 * top-level elements are expanded, but not their children; 3 means that |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2322 * top-level elements are expanded, and their children, but not |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2323 * grandchildren; and so on. |
| 10 | 2324 * <p> |
| 2325 * The value <code>ALL_LEVELS</code> means that all subtrees should be | |
| 2326 * expanded. | |
| 2327 * </p> | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2328 * <p> |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2329 * Note that in previous releases, the Javadoc for this method had an off-by |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2330 * one error. See bug 177669 for details. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2331 * </p> |
| 10 | 2332 * |
| 2333 * @param level | |
| 2334 * non-negative level, or <code>ALL_LEVELS</code> to expand all | |
| 2335 * levels of the tree | |
| 2336 */ | |
| 2337 public void setAutoExpandLevel(int level) { | |
| 2338 expandToLevel_ = level; | |
| 2339 } | |
| 2340 | |
| 2341 /** | |
| 2342 * The <code>AbstractTreeViewer</code> implementation of this method | |
| 2343 * checks to ensure that the content provider is an | |
| 2344 * <code>ITreeContentProvider</code>. | |
| 2345 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
2346 public override void setContentProvider(IContentProvider provider) { |
| 10 | 2347 // the actual check is in assertContentProviderType |
| 2348 super.setContentProvider(provider); | |
| 2349 } | |
| 2350 | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
2351 protected override void assertContentProviderType(IContentProvider provider) { |
| 10 | 2352 Assert.isTrue(cast(ITreeContentProvider)provider |
| 2353 || cast(ITreePathContentProvider)provider ); | |
| 2354 } | |
| 2355 | |
| 2356 /** | |
| 2357 * Sets the expand state of the given item. | |
| 2358 * | |
| 2359 * @param item | |
| 2360 * the item | |
| 2361 * @param expand | |
| 2362 * the expand state of the item | |
| 2363 */ | |
| 2364 protected abstract void setExpanded(Item item, bool expand); | |
| 2365 | |
| 2366 /** | |
| 2367 * Sets which nodes are expanded in this viewer's tree. The given list | |
| 2368 * contains the elements that are to be expanded; all other nodes are to be | |
| 2369 * collapsed. | |
| 2370 * <p> | |
| 2371 * This method is typically used when restoring the interesting state of a | |
| 2372 * viewer captured by an earlier call to <code>getExpandedElements</code>. | |
| 2373 * </p> | |
| 2374 * | |
| 2375 * @param elements | |
| 2376 * the array of expanded elements | |
| 2377 * @see #getExpandedElements | |
| 2378 */ | |
| 2379 public void setExpandedElements(Object[] elements) { | |
| 2380 assertElementsNotNull(elements); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2381 if (checkBusy()) { |
| 10 | 2382 return; |
| 2383 } | |
| 2384 CustomHashtable expandedElements = newHashtable(elements.length * 2 + 1); | |
| 2385 for (int i = 0; i < elements.length; ++i) { | |
| 2386 Object element = elements[i]; | |
| 2387 // Ensure item exists for element. This will materialize items for | |
| 2388 // each element and their parents, if possible. This is important | |
| 2389 // to support expanding of inner tree nodes without necessarily | |
| 2390 // expanding their parents. | |
| 2391 internalExpand(element, false); | |
| 2392 expandedElements.put(element, element); | |
| 2393 } | |
| 2394 // this will traverse all existing items, and create children for | |
| 2395 // elements that need to be expanded. If the tree contains multiple | |
| 2396 // equal elements, and those are in the set of elements to be expanded, | |
| 2397 // only the first item found for each element will be expanded. | |
| 2398 internalSetExpanded(expandedElements, getControl()); | |
| 2399 } | |
| 2400 | |
| 2401 /** | |
| 2402 * Sets which nodes are expanded in this viewer's tree. The given list | |
| 2403 * contains the tree paths that are to be expanded; all other nodes are to | |
| 2404 * be collapsed. | |
| 2405 * <p> | |
| 2406 * This method is typically used when restoring the interesting state of a | |
| 2407 * viewer captured by an earlier call to <code>getExpandedTreePaths</code>. | |
| 2408 * </p> | |
| 2409 * | |
| 2410 * @param treePaths | |
| 2411 * the array of expanded tree paths | |
| 2412 * @see #getExpandedTreePaths() | |
| 2413 * | |
| 2414 * @since 3.2 | |
| 2415 */ | |
| 2416 public void setExpandedTreePaths(TreePath[] treePaths) { | |
| 2417 assertElementsNotNull(treePaths); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2418 if (checkBusy()) |
| 10 | 2419 return; |
| 39 | 2420 IElementComparer treePathComparer = new class(getComparer()) IElementComparer { |
| 10 | 2421 IElementComparer comparer; |
| 39 | 2422 this(IElementComparer c){ |
| 2423 comparer = c; | |
| 10 | 2424 } |
| 2425 public int opEquals(Object a, Object b) { | |
| 2426 return (cast(TreePath) a).opEquals((cast(TreePath) b), comparer); | |
| 2427 } | |
| 2428 | |
| 2429 public hash_t toHash(Object element) { | |
| 2430 return (cast(TreePath) element).toHash(comparer); | |
| 2431 } | |
| 2432 }; | |
| 2433 CustomHashtable expandedTreePaths = new CustomHashtable( | |
| 2434 treePaths.length * 2 + 1, treePathComparer); | |
| 2435 for (int i = 0; i < treePaths.length; ++i) { | |
| 2436 TreePath treePath = treePaths[i]; | |
| 2437 // Ensure item exists for element. This will materialize items for | |
| 2438 // each element and their parents, if possible. This is important | |
| 2439 // to support expanding of inner tree nodes without necessarily | |
| 2440 // expanding their parents. | |
| 2441 internalExpand(treePath, false); | |
| 2442 expandedTreePaths.put(treePath, treePath); | |
| 2443 } | |
| 2444 // this will traverse all existing items, and create children for | |
| 2445 // elements that need to be expanded. If the tree contains multiple | |
| 2446 // equal elements, and those are in the set of elements to be expanded, | |
| 2447 // only the first item found for each element will be expanded. | |
| 2448 internalSetExpandedTreePaths(expandedTreePaths, getControl(), | |
| 2449 new TreePath(new Object[0])); | |
| 2450 } | |
| 2451 | |
| 2452 /** | |
| 2453 * Sets whether the node corresponding to the given element or tree path is | |
| 2454 * expanded or collapsed. | |
| 2455 * | |
| 2456 * @param elementOrTreePath | |
| 2457 * the element | |
| 2458 * @param expanded | |
| 2459 * <code>true</code> if the node is expanded, and | |
| 2460 * <code>false</code> if collapsed | |
| 2461 */ | |
| 2462 public void setExpandedState(Object elementOrTreePath, bool expanded) { | |
| 2463 Assert.isNotNull(elementOrTreePath); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2464 if (checkBusy()) |
| 10 | 2465 return; |
| 2466 Widget item = internalExpand(elementOrTreePath, false); | |
| 2467 if ( cast(Item)item ) { | |
| 2468 if (expanded) { | |
| 2469 createChildren(item); | |
| 2470 } | |
| 2471 setExpanded(cast(Item) item, expanded); | |
| 2472 } | |
| 2473 } | |
| 2474 | |
| 2475 /** | |
| 2476 * Sets the selection to the given list of items. | |
| 2477 * | |
| 2478 * @param items | |
| 2479 * list of items (element type: | |
| 2480 * <code>dwt.widgets.Item</code>) | |
| 2481 */ | |
| 2482 protected abstract void setSelection(SeqView!(Item) items); | |
| 2483 | |
| 2484 /** | |
| 2485 * This implementation of setSelectionToWidget accepts a list of elements or | |
| 2486 * a list of tree paths. | |
| 2487 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
2488 protected override void setSelectionToWidget(SeqView!(Object) v, bool reveal) { |
| 10 | 2489 if (v is null) { |
| 2490 setSelection(new ArraySeq!(Item)); | |
| 2491 return; | |
| 2492 } | |
| 2493 int size = v.size(); | |
| 2494 auto newSelection = new ArraySeq!(Item); | |
| 2495 newSelection.capacity(size); | |
| 2496 for (int i = 0; i < size; ++i) { | |
| 2497 Object elementOrTreePath = v.get(i); | |
| 2498 // Use internalExpand since item may not yet be created. See | |
| 2499 // 1G6B1AR. | |
| 2500 Widget w = internalExpand(elementOrTreePath, false); | |
| 2501 if ( auto it = cast(Item)w ) { | |
| 2502 newSelection.append(it); | |
| 2503 } else if (w is null && null !is cast(TreePath)elementOrTreePath ) { | |
| 2504 TreePath treePath = cast(TreePath) elementOrTreePath; | |
| 2505 Object element = treePath.getLastSegment(); | |
| 2506 if (element !is null) { | |
| 2507 w = internalExpand(element, false); | |
| 2508 if ( auto it = cast(Item)w ) { | |
| 2509 newSelection.append(it); | |
| 2510 } | |
| 2511 } | |
| 2512 } | |
| 2513 } | |
| 2514 setSelection(newSelection); | |
| 2515 | |
| 2516 // Although setting the selection in the control should reveal it, | |
| 2517 // setSelection may be a no-op if the selection is unchanged, | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2518 // so explicitly reveal items in the selection here. |
| 10 | 2519 // See bug 100565 for more details. |
| 2520 if (reveal && newSelection.size() > 0) { | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2521 // Iterate backwards so the first item in the list |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2522 // is the one guaranteed to be visible |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2523 for (int i = (newSelection.size()-1); i >= 0; i--) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2524 showItem(cast(Item) newSelection.get(i)); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2525 } |
| 10 | 2526 } |
| 2527 } | |
| 2528 | |
| 2529 /** | |
| 2530 * Shows the given item. | |
| 2531 * | |
| 2532 * @param item | |
| 2533 * the item | |
| 2534 */ | |
| 2535 protected abstract void showItem(Item item); | |
| 2536 | |
| 2537 /** | |
| 2538 * Updates the tree items to correspond to the child elements of the given | |
| 2539 * parent element. If null is passed for the children, this method obtains | |
| 2540 * them (only if needed). | |
| 2541 * | |
| 2542 * @param widget | |
| 2543 * the widget | |
| 2544 * @param parent | |
| 2545 * the parent element | |
| 2546 * @param elementChildren | |
| 2547 * the child elements, or null | |
| 2548 * @deprecated this is no longer called by the framework | |
| 2549 */ | |
| 2550 protected void updateChildren(Widget widget, Object parent, | |
| 2551 Object[] elementChildren) { | |
| 2552 updateChildren(widget, parent, elementChildren, true); | |
| 2553 } | |
| 2554 | |
| 2555 /** | |
| 2556 * Updates the tree items to correspond to the child elements of the given | |
| 2557 * parent element. If null is passed for the children, this method obtains | |
| 2558 * them (only if needed). | |
| 2559 * | |
| 2560 * @param widget | |
| 2561 * the widget | |
| 2562 * @param parent | |
| 2563 * the parent element | |
| 2564 * @param elementChildren | |
| 2565 * the child elements, or null | |
| 2566 * @param updateLabels | |
| 2567 * <code>true</code> to update labels for existing elements, | |
| 2568 * <code>false</code> to only update labels as needed, assuming | |
| 2569 * that labels for existing elements are unchanged. | |
| 2570 * @since 2.1 | |
| 2571 */ | |
| 2572 private void updateChildren(Widget widget, Object parent, | |
| 2573 Object[] elementChildren, bool updateLabels) { | |
| 2574 // optimization! prune collapsed subtrees | |
| 2575 if (auto ti = cast(Item)widget ) { | |
| 2576 if (!getExpanded(ti)) { | |
| 2577 // need a dummy node if element is expandable; | |
| 2578 // but try to avoid recreating the dummy node | |
| 2579 bool needDummy = isExpandable(ti, null, parent); | |
| 2580 bool haveDummy = false; | |
| 2581 // remove all children | |
| 2582 Item[] items = getItems(ti); | |
| 2583 for (int i = 0; i < items.length; i++) { | |
| 2584 if (items[i].getData() !is null) { | |
| 2585 disassociate(items[i]); | |
| 2586 items[i].dispose(); | |
| 2587 } else { | |
| 2588 if (needDummy && !haveDummy) { | |
| 2589 haveDummy = true; | |
| 2590 } else { | |
| 2591 items[i].dispose(); | |
| 2592 } | |
| 2593 } | |
| 2594 } | |
| 2595 if (needDummy && !haveDummy) { | |
| 2596 newItem(ti, DWT.NULL, -1); | |
| 2597 } | |
| 2598 | |
| 2599 return; | |
| 2600 } | |
| 2601 } | |
| 2602 | |
| 2603 // If the children weren't passed in, get them now since they're needed | |
| 2604 // below. | |
| 2605 if (elementChildren is null) { | |
| 2606 if (isTreePathContentProvider() && null !is cast(Item) widget ) { | |
| 2607 TreePath path = getTreePathFromItem(cast(Item) widget); | |
| 2608 elementChildren = getSortedChildren(path); | |
| 2609 } else { | |
| 2610 elementChildren = getSortedChildren(parent); | |
| 2611 } | |
| 2612 } | |
| 2613 | |
| 2614 Control tree = getControl(); | |
| 2615 | |
| 2616 // WORKAROUND | |
| 2617 int oldCnt = -1; | |
| 2618 if (widget is tree) { | |
| 2619 oldCnt = getItemCount(tree); | |
| 2620 } | |
| 2621 | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2622 Item[] items = getChildren(widget,elementChildren); |
| 71 | 2623 |
| 10 | 2624 // save the expanded elements |
| 2625 CustomHashtable expanded = newHashtable(CustomHashtable.DEFAULT_CAPACITY); // assume | |
| 2626 // num | |
| 2627 // expanded | |
| 2628 // is | |
| 2629 // small | |
| 2630 for (int i = 0; i < items.length; ++i) { | |
| 2631 if (getExpanded(items[i])) { | |
| 2632 Object element = items[i].getData(); | |
| 2633 if (element !is null) { | |
| 2634 expanded.put(element, element); | |
| 2635 } | |
| 2636 } | |
| 2637 } | |
| 2638 | |
| 2639 int min = Math.min(elementChildren.length, items.length); | |
| 2640 | |
| 2641 // dispose of surplus items, optimizing for the case where elements have | |
| 2642 // been deleted but not reordered, or all elements have been removed. | |
| 2643 int numItemsToDispose = items.length - min; | |
| 2644 if (numItemsToDispose > 0) { | |
| 2645 CustomHashtable children = newHashtable(elementChildren.length * 2); | |
| 2646 for (int i = 0; i < elementChildren.length; i++) { | |
| 2647 Object elementChild = elementChildren[i]; | |
| 2648 children.put(elementChild, elementChild); | |
| 2649 } | |
| 2650 int i = 0; | |
| 2651 while (numItemsToDispose > 0 && i < items.length) { | |
| 2652 Object data = items[i].getData(); | |
| 2653 if (data is null || items.length - i <= numItemsToDispose || !children.containsKey(data)) { | |
| 2654 if (data !is null) { | |
| 2655 disassociate(items[i]); | |
| 2656 } | |
| 2657 items[i].dispose(); | |
| 2658 if (i + 1 < items.length) { | |
| 2659 // The components at positions i+1 through | |
| 2660 // items.length-1 in the source array are copied into | |
| 2661 // positions i through items.length-2 | |
| 2662 System.arraycopy(items, i + 1, items, i, items.length - (i+1)); | |
| 2663 } | |
| 2664 numItemsToDispose--; | |
| 2665 } else { | |
| 2666 i++; | |
| 2667 } | |
| 2668 } | |
| 2669 } | |
| 2670 | |
| 2671 // compare first min items, and update item if necessary | |
| 2672 // need to do it in two passes: | |
| 2673 // 1: disassociate old items | |
| 2674 // 2: associate new items | |
| 2675 // because otherwise a later disassociate can remove a mapping made for | |
| 2676 // a previous associate, | |
| 2677 // making the map inconsistent | |
| 2678 for (int i = 0; i < min; ++i) { | |
| 2679 Item item = items[i]; | |
| 2680 Object oldElement = item.getData(); | |
| 2681 if (oldElement !is null) { | |
| 2682 Object newElement = elementChildren[i]; | |
| 2683 if (newElement !is oldElement) { | |
| 2684 if (opEquals(newElement, oldElement)) { | |
| 2685 // update the data to be the new element, since | |
| 2686 // although the elements | |
| 2687 // may be equal, they may still have different labels | |
| 2688 // or children | |
| 2689 Object data = item.getData(); | |
| 2690 if (data !is null) { | |
| 2691 unmapElement(data, item); | |
| 2692 } | |
| 2693 item.setData(newElement); | |
| 2694 mapElement(newElement, item); | |
| 2695 } else { | |
| 2696 disassociate(item); | |
| 2697 // Clear the text and image to force a label update | |
| 2698 item.setImage(null); | |
| 2699 item.setText("");//$NON-NLS-1$ | |
| 2700 | |
| 2701 } | |
| 2702 } | |
| 2703 } | |
| 2704 } | |
| 2705 | |
| 2706 for (int i = 0; i < min; ++i) { | |
| 2707 Item item = items[i]; | |
| 2708 Object newElement = elementChildren[i]; | |
| 2709 if (item.getData() is null) { | |
| 2710 // old and new elements are not equal | |
| 2711 associate(newElement, item); | |
| 2712 updatePlus(item, newElement); | |
| 2713 updateItem(item, newElement); | |
| 2714 } else { | |
| 2715 // old and new elements are equal | |
| 2716 updatePlus(item, newElement); | |
| 2717 if (updateLabels) { | |
| 2718 updateItem(item, newElement); | |
| 2719 } | |
| 2720 } | |
| 2721 } | |
| 2722 | |
| 2723 // Restore expanded state for items that changed position. | |
| 2724 // Make sure setExpanded is called after updatePlus, since | |
| 2725 // setExpanded(false) fails if item has no children. | |
| 2726 // Need to call setExpanded for both expanded and unexpanded | |
| 2727 // cases since the expanded state can change either way. | |
| 2728 // This needs to be done in a second loop, see bug 148025. | |
| 2729 for (int i = 0; i < min; ++i) { | |
| 2730 Item item = items[i]; | |
| 2731 Object newElement = elementChildren[i]; | |
| 2732 setExpanded(item, expanded.containsKey(newElement)); | |
| 2733 } | |
| 2734 | |
| 2735 // add any remaining elements | |
| 2736 if (min < elementChildren.length) { | |
| 2737 for (int i = min; i < elementChildren.length; ++i) { | |
| 2738 createTreeItem(widget, elementChildren[i], i); | |
| 2739 } | |
| 2740 | |
| 2741 // Need to restore expanded state in a separate pass | |
| 2742 // because createTreeItem does not return the new item. | |
| 2743 // Avoid doing this unless needed. | |
| 2744 if (expanded.size() > 0) { | |
| 2745 // get the items again, to include the new items | |
| 2746 items = getChildren(widget); | |
| 2747 for (int i = min; i < elementChildren.length; ++i) { | |
| 2748 // Restore expanded state for items that changed position. | |
| 2749 // Make sure setExpanded is called after updatePlus (called | |
| 2750 // in createTreeItem), since | |
| 2751 // setExpanded(false) fails if item has no children. | |
| 2752 // Only need to call setExpanded if element was expanded | |
| 2753 // since new items are initially unexpanded. | |
| 2754 if (expanded.containsKey(elementChildren[i])) { | |
| 2755 setExpanded(items[i], true); | |
| 2756 } | |
| 2757 } | |
| 2758 } | |
| 2759 } | |
| 2760 | |
| 2761 // WORKAROUND | |
| 2762 if (widget is tree && oldCnt is 0 && getItemCount(tree) !is 0) { | |
| 2763 // System.out.println("WORKAROUND setRedraw"); | |
| 2764 tree.setRedraw(false); | |
| 2765 tree.setRedraw(true); | |
| 2766 } | |
| 2767 } | |
| 2768 | |
| 2769 /** | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2770 * Return the items to be refreshed as part of an update. elementChildren are the |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2771 * new elements. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2772 * @param widget |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2773 * @param elementChildren |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2774 * @since 3.4 |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2775 * @return Item[] |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2776 * <strong>NOTE:</strong> This API is experimental and may be deleted |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2777 * before 3.4 is released. |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2778 */ |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2779 public Item[] getChildren(Widget widget, Object[] elementChildren) { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2780 return getChildren(widget); |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2781 } |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2782 |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2783 /** |
| 10 | 2784 * Updates the "+"/"-" icon of the tree node from the given element. It |
| 2785 * calls <code>isExpandable</code> to determine whether an element is | |
| 2786 * expandable. | |
| 2787 * | |
| 2788 * @param item | |
| 2789 * the item | |
| 2790 * @param element | |
| 2791 * the element | |
| 2792 */ | |
| 2793 protected void updatePlus(Item item, Object element) { | |
| 2794 bool hasPlus = getItemCount(item) > 0; | |
| 2795 bool needsPlus = isExpandable(item, null, element); | |
| 2796 bool removeAll = false; | |
| 2797 bool addDummy = false; | |
| 2798 Object data = item.getData(); | |
| 2799 if (data !is null && opEquals(element, data)) { | |
| 2800 // item shows same element | |
| 2801 if (hasPlus !is needsPlus) { | |
| 2802 if (needsPlus) { | |
| 2803 addDummy = true; | |
| 2804 } else { | |
| 2805 removeAll = true; | |
| 2806 } | |
| 2807 } | |
| 2808 } else { | |
| 2809 // item shows different element | |
| 2810 removeAll = true; | |
| 2811 addDummy = needsPlus; | |
| 2812 | |
| 2813 // we cannot maintain expand state so collapse it | |
| 2814 setExpanded(item, false); | |
| 2815 } | |
| 2816 if (removeAll) { | |
| 2817 // remove all children | |
| 2818 Item[] items = getItems(item); | |
| 2819 for (int i = 0; i < items.length; i++) { | |
| 2820 if (items[i].getData() !is null) { | |
| 2821 disassociate(items[i]); | |
| 2822 } | |
| 2823 items[i].dispose(); | |
| 2824 } | |
| 2825 } | |
| 2826 if (addDummy) { | |
| 2827 newItem(item, DWT.NULL, -1); // append a dummy | |
| 2828 } | |
| 2829 } | |
| 2830 | |
| 2831 /** | |
| 2832 * Gets the expanded elements that are visible to the user. An expanded | |
| 2833 * element is only visible if the parent is expanded. | |
| 2834 * | |
| 2835 * @return the visible expanded elements | |
| 2836 * @since 2.0 | |
| 2837 */ | |
| 2838 public Object[] getVisibleExpandedElements() { | |
| 2839 auto v = new ArraySeq!(Object); | |
| 2840 internalCollectVisibleExpanded(v, getControl()); | |
| 2841 return v.toArray(); | |
| 2842 } | |
| 2843 | |
| 2844 private void internalCollectVisibleExpanded(ArraySeq!(Object) result, Widget widget) { | |
| 2845 Item[] items = getChildren(widget); | |
| 2846 for (int i = 0; i < items.length; i++) { | |
| 2847 Item item = items[i]; | |
| 2848 if (getExpanded(item)) { | |
| 2849 Object data = item.getData(); | |
| 2850 if (data !is null) { | |
| 2851 result.append(data); | |
| 2852 } | |
| 2853 // Only recurse if it is expanded - if | |
| 2854 // not then the children aren't visible | |
| 2855 internalCollectVisibleExpanded(result, item); | |
| 2856 } | |
| 2857 } | |
| 2858 } | |
| 2859 | |
| 2860 /** | |
| 2861 * Returns the tree path for the given item. | |
| 2862 * @param item | |
| 2863 * @return {@link TreePath} | |
| 2864 * | |
| 2865 * @since 3.2 | |
| 2866 */ | |
| 2867 protected TreePath getTreePathFromItem(Item item) { | |
| 2868 auto segments = new LinkSeq!(Object); | |
| 2869 while (item !is null) { | |
| 2870 Object segment = item.getData(); | |
| 2871 Assert.isNotNull(segment); | |
| 2872 segments.prepend(segment); | |
| 2873 item = getParentItem(item); | |
| 2874 } | |
| 2875 return new TreePath(segments.toArray()); | |
| 2876 } | |
| 2877 package TreePath getTreePathFromItem_package(Item item) { | |
| 2878 return getTreePathFromItem_package(item); | |
| 2879 } | |
| 2880 | |
| 2881 /** | |
| 2882 * This implementation of getSelection() returns an instance of | |
| 2883 * ITreeSelection. | |
| 2884 * | |
| 2885 * @since 3.2 | |
| 2886 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
2887 public override ISelection getSelection() { |
| 10 | 2888 Control control = getControl(); |
| 2889 if (control is null || control.isDisposed()) { | |
| 2890 return TreeSelection.EMPTY; | |
| 2891 } | |
| 2892 Widget[] items = getSelection(getControl()); | |
| 2893 auto list = new ArraySeq!(TreePath); | |
| 2894 list.capacity(items.length); | |
| 2895 for (int i = 0; i < items.length; i++) { | |
| 2896 Widget item = items[i]; | |
| 2897 if (item.getData() !is null) { | |
| 2898 list.append(getTreePathFromItem(cast(Item) item)); | |
| 2899 } | |
| 2900 } | |
| 2901 return new TreeSelection( list.toArray(), getComparer()); | |
| 2902 } | |
| 2903 | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
2904 protected override void setSelectionToWidget(ISelection selection, bool reveal) { |
| 10 | 2905 if ( auto treeSelection = cast(ITreeSelection)selection ) { |
| 2906 auto list = new ArraySeq!(Object); | |
| 2907 auto paths = treeSelection.getPaths(); | |
| 2908 list.capacity(paths.length); | |
| 2909 foreach( path; paths ){ | |
| 2910 list.append(path); | |
| 2911 } | |
| 2912 setSelectionToWidget(list, reveal); | |
| 2913 } else { | |
| 2914 super.setSelectionToWidget(selection, reveal); | |
| 2915 } | |
| 2916 } | |
| 2917 | |
| 2918 /** | |
| 2919 * Returns a list of tree paths corresponding to expanded nodes in this | |
| 2920 * viewer's tree, including currently hidden ones that are marked as | |
| 2921 * expanded but are under a collapsed ancestor. | |
| 2922 * <p> | |
| 2923 * This method is typically used when preserving the interesting state of a | |
| 2924 * viewer; <code>setExpandedElements</code> is used during the restore. | |
| 2925 * </p> | |
| 2926 * | |
| 2927 * @return the array of expanded tree paths | |
| 2928 * @see #setExpandedElements | |
| 2929 * | |
| 2930 * @since 3.2 | |
| 2931 */ | |
| 2932 public TreePath[] getExpandedTreePaths() { | |
| 2933 auto items = new ArraySeq!(Item); | |
| 2934 internalCollectExpandedItems(items, getControl()); | |
| 2935 auto result = new ArraySeq!(TreePath); | |
| 2936 result.capacity(items.size()); | |
| 2937 foreach( item; items ){ | |
| 2938 TreePath treePath = getTreePathFromItem(item); | |
| 2939 if (treePath !is null) { | |
| 2940 result.append(treePath); | |
| 2941 } | |
| 2942 } | |
| 2943 return result.toArray(); | |
| 2944 } | |
| 2945 | |
| 2946 private bool isTreePathContentProvider() { | |
| 2947 return null !is cast(ITreePathContentProvider)getContentProvider() ; | |
| 2948 } | |
| 2949 | |
| 2950 /** | |
| 2951 * Inserts the given element as a new child element of the given parent | |
| 2952 * element at the given position. If this viewer has a sorter, the position | |
| 2953 * is ignored and the element is inserted at the correct position in the | |
| 2954 * sort order. | |
| 2955 * <p> | |
| 2956 * This method should be called (by the content provider) when elements have | |
| 2957 * been added to the model, in order to cause the viewer to accurately | |
| 2958 * reflect the model. This method only affects the viewer, not the model. | |
| 2959 * </p> | |
| 2960 * | |
| 2961 * @param parentElementOrTreePath | |
| 2962 * the parent element, or the tree path to the parent | |
| 2963 * @param element | |
| 2964 * the element | |
| 2965 * @param position | |
| 2966 * a 0-based position relative to the model, or -1 to indicate | |
| 2967 * the last position | |
| 2968 * | |
| 2969 * @since 3.2 | |
| 2970 */ | |
| 2971 public void insert(Object parentElementOrTreePath, Object element, | |
| 2972 int position) { | |
| 2973 Assert.isNotNull(parentElementOrTreePath); | |
| 2974 Assert.isNotNull(element); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
2975 if (checkBusy()) |
| 10 | 2976 return; |
| 2977 if (getComparator() !is null || hasFilters()) { | |
| 2978 add(parentElementOrTreePath, [ element ]); | |
| 2979 return; | |
| 2980 } | |
| 2981 Widget[] items; | |
| 2982 if (internalIsInputOrEmptyPath(parentElementOrTreePath)) { | |
| 2983 items = [ getControl() ]; | |
| 2984 } else { | |
| 2985 items = internalFindItems(parentElementOrTreePath); | |
| 2986 } | |
| 2987 | |
| 2988 for (int i = 0; i < items.length; i++) { | |
| 2989 Widget widget = items[i]; | |
| 2990 if (auto item = cast(Item)widget ) { | |
| 2991 | |
| 2992 Item[] childItems = getChildren(item); | |
| 2993 if (getExpanded(item) | |
| 2994 || (childItems.length > 0 && childItems[0].getData() !is null)) { | |
| 2995 // item has real children, go ahead and add | |
| 2996 int insertionPosition = position; | |
| 2997 if (insertionPosition is -1) { | |
| 2998 insertionPosition = getItemCount(item); | |
| 2999 } | |
| 3000 | |
| 3001 createTreeItem(item, element, insertionPosition); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
3002 } else { |
|
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
3003 Object parentElement = parentElementOrTreePath; |
| 71 | 3004 if (null !is cast(TreePath)element ) |
| 3005 parentElement = (cast(TreePath) parentElement).getLastSegment(); | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
3006 updatePlus(item, parentElement); |
| 10 | 3007 } |
| 3008 } else { | |
| 3009 int insertionPosition = position; | |
| 3010 if (insertionPosition is -1) { | |
| 3011 insertionPosition = getItemCount(cast(Control) widget); | |
| 3012 } | |
| 3013 | |
| 3014 createTreeItem(widget, element, insertionPosition); | |
| 3015 } | |
| 3016 } | |
| 3017 } | |
| 3018 | |
| 3019 /* | |
| 3020 * (non-Javadoc) | |
| 3021 * | |
| 3022 * @see dwtx.jface.viewers.ColumnViewer#getColumnViewerOwner(int) | |
| 3023 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
3024 protected override Widget getColumnViewerOwner(int columnIndex) { |
| 10 | 3025 // Return null by default |
| 3026 return null; | |
| 3027 } | |
| 3028 | |
| 3029 /** | |
| 3030 * This implementation of {@link #getItemAt(Point)} returns null to ensure | |
| 3031 * API backwards compatibility. Subclasses should override. | |
| 3032 * | |
| 3033 * @since 3.3 | |
| 3034 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
3035 protected override Item getItemAt(Point point) { |
| 10 | 3036 return null; |
| 3037 } | |
| 3038 | |
| 3039 /** | |
| 3040 * This implementation of {@link #createViewerEditor()} returns null to ensure | |
| 3041 * API backwards compatibility. Subclasses should override. | |
| 3042 * | |
| 3043 * @since 3.3 | |
| 3044 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
3045 protected override ColumnViewerEditor createViewerEditor() { |
| 10 | 3046 return null; |
| 3047 } | |
| 3048 | |
| 3049 /** | |
| 3050 * Returns the number of columns of this viewer. | |
| 3051 * <p><b>Subclasses should overwrite this method, which has a default | |
| 3052 * implementation (returning 0) for API backwards compatility reasons</b></p> | |
| 3053 * | |
| 3054 * @return the number of columns | |
| 3055 * | |
| 3056 * @since 3.3 | |
| 3057 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
3058 protected override int doGetColumnCount() { |
| 10 | 3059 return 0; |
| 3060 } | |
| 3061 | |
| 3062 | |
| 3063 /** | |
| 3064 * This implementation of buildLabel handles tree paths as well as elements. | |
| 3065 * | |
| 3066 * @param updateLabel | |
| 3067 * the ViewerLabel to collect the result in | |
| 3068 * @param elementOrPath | |
| 3069 * the element or tree path for which a label should be built | |
| 3070 * | |
| 3071 * @see dwtx.jface.viewers.StructuredViewer#buildLabel(dwtx.jface.viewers.ViewerLabel, | |
| 3072 * java.lang.Object) | |
| 3073 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
3074 protected override void buildLabel(ViewerLabel updateLabel, Object elementOrPath) { |
| 10 | 3075 Object element; |
| 3076 if (auto path = cast(TreePath)elementOrPath ) { | |
| 3077 IBaseLabelProvider provider = getLabelProvider(); | |
| 3078 if ( auto pprov = cast(ITreePathLabelProvider) provider ) { | |
| 3079 buildLabel(updateLabel, path, pprov); | |
| 3080 return; | |
| 3081 } | |
| 3082 element = path.getLastSegment(); | |
| 3083 } else { | |
| 3084 element = elementOrPath; | |
| 3085 } | |
| 3086 super.buildLabel(updateLabel, element); | |
| 3087 } | |
| 3088 | |
| 3089 /** | |
| 3090 * Returns true if the given object is either the input or an empty tree path. | |
| 3091 * | |
| 3092 * @param elementOrTreePath an element which could either be the viewer's input, or a tree path | |
| 3093 * | |
| 3094 * @return <code>true</code> if the given object is either the input or an empty tree path, | |
| 3095 * <code>false</code> otherwise. | |
| 3096 * @since 3.3 | |
| 3097 */ | |
| 3098 final protected bool internalIsInputOrEmptyPath(Object elementOrTreePath) { | |
|
70
46a6e0e6ccd4
Merge with d-fied sources of 3.4M7
Frank Benoit <benoit@tionex.de>
parents:
54
diff
changeset
|
3099 if (elementOrTreePath.opEquals(getRoot())) |
| 10 | 3100 return true; |
| 3101 if (!(cast(TreePath)elementOrTreePath )) | |
| 3102 return false; | |
| 3103 return (cast(TreePath) elementOrTreePath).getSegmentCount() is 0; | |
| 3104 } | |
| 3105 | |
| 3106 /* | |
| 3107 * Subclasses should implement | |
| 3108 */ | |
|
43
ea8ff534f622
Fix override and super aliases
Frank Benoit <benoit@tionex.de>
parents:
40
diff
changeset
|
3109 protected override ViewerRow getViewerRowFromItem(Widget item) { |
| 10 | 3110 return null; |
| 3111 } | |
| 3112 } |