1 /*******************************************************************************
\r
2 * Copyright (c) 2007, 2012 Association for Decentralized Information Management
\r
3 * in Industry THTH ry.
\r
4 * All rights reserved. This program and the accompanying materials
\r
5 * are made available under the terms of the Eclipse Public License v1.0
\r
6 * which accompanies this distribution, and is available at
\r
7 * http://www.eclipse.org/legal/epl-v10.html
\r
10 * VTT Technical Research Centre of Finland - initial API and implementation
\r
11 *******************************************************************************/
\r
12 package org.simantics.browsing.ui.swt;
\r
14 import java.util.HashSet;
\r
16 import org.eclipse.swt.SWT;
\r
17 import org.eclipse.swt.widgets.Control;
\r
18 import org.eclipse.swt.widgets.TreeItem;
\r
19 import org.simantics.browsing.ui.BuiltinKeys;
\r
20 import org.simantics.browsing.ui.CheckedState;
\r
21 import org.simantics.browsing.ui.NodeContext;
\r
22 import org.simantics.browsing.ui.NodeQueryManager;
\r
23 import org.simantics.browsing.ui.common.internal.GENodeQueryManager;
\r
24 import org.simantics.browsing.ui.common.internal.IGraphExplorerContext;
\r
25 import org.simantics.browsing.ui.content.PrunedChildrenResult;
\r
28 * This class is responsible for updating the {@link TreeItem}s contained by the
\r
29 * SWT Tree in {@link GraphExplorerImpl}.
\r
31 * It will reschedule itself for as long as there are UI items to update in the
\r
32 * explorer. This class is not responsible for performing any throttling of
\r
33 * <code>UpdateRunner</code> executions.
\r
35 * @author Antti Villberg
\r
37 class UpdateRunner implements Runnable {
\r
39 final GraphExplorerImpl ge;
\r
40 //final IGraphExplorerContext geContext;
\r
42 UpdateRunner(GraphExplorerImpl ge, IGraphExplorerContext geContext) {
\r
44 // this.geContext = geContext;
\r
50 } catch (Throwable t) {
\r
51 t.printStackTrace();
\r
56 public void doRun() {
\r
58 if (ge.isDisposed())
\r
61 HashSet<TreeItem> items = new HashSet<TreeItem>();
\r
64 synchronized (ge.pendingItems) {
\r
66 doRoot = ge.pendingRoot;
\r
68 for (TreeItem item : ge.pendingItems) {
\r
69 //if(item.isDisposed()) continue;
\r
70 //if(item.getParentItem() == null) doRoot = true;
\r
71 //else items.add(item.getParentItem());
\r
75 if(item.isDisposed()) continue;
\r
80 ge.pendingItems = new HashSet<TreeItem>();
\r
81 ge.pendingRoot = false;
\r
87 NodeQueryManager manager = new GENodeQueryManager(ge.explorerContext, null, null, TreeItemReference.create(null));
\r
89 PrunedChildrenResult children = manager.query(ge.rootContext, BuiltinKeys.PRUNED_CHILDREN);
\r
90 int maxChildren = ge.getMaxChildren(manager, ge.rootContext);
\r
91 int childCount = Math.min(children.getPrunedChildren().length, maxChildren);
\r
92 ge.tree.clearAll(true);
\r
93 ge.tree.setItemCount(childCount);
\r
98 for (TreeItem item : items) {
\r
99 if (item.isDisposed())
\r
102 final NodeContext context = (NodeContext)item.getData();
\r
103 assert(context != null);
\r
105 NodeQueryManager manager = new GENodeQueryManager(ge.explorerContext, null, null, TreeItemReference.create(item));
\r
107 PrunedChildrenResult children = manager.query(context, BuiltinKeys.PRUNED_CHILDREN);
\r
109 int maxChildren = ge.getMaxChildren(manager, context);
\r
110 item.setItemCount(Math.min(children.getPrunedChildren().length, maxChildren));
\r
112 ge.setTextAndImage(item, manager, context, itemIndex);
\r
114 item.clearAll(true);
\r
116 boolean isExpanded = manager.query(context, BuiltinKeys.IS_EXPANDED);
\r
117 item.setExpanded(isExpanded);
\r
119 if ((((Control) ge.getControl()).getStyle() & SWT.CHECK) != 0) {
\r
120 CheckedState checked = manager.query(context, BuiltinKeys.IS_CHECKED);
\r
121 item.setChecked(CheckedState.CHECKED_STATES.contains(checked));
\r
122 item.setGrayed(CheckedState.GRAYED == checked);
\r
129 synchronized (ge.pendingItems) {
\r
130 if (!ge.scheduleUpdater())
\r
131 ge.updating = false;
\r