]> gerrit.simantics Code Review - simantics/platform.git/blobdiff - bundles/org.simantics.browsing.ui.swt/src/org/simantics/browsing/ui/swt/DefaultIsExpandedProcessor.java
Migrated source code from Simantics SVN
[simantics/platform.git] / bundles / org.simantics.browsing.ui.swt / src / org / simantics / browsing / ui / swt / DefaultIsExpandedProcessor.java
diff --git a/bundles/org.simantics.browsing.ui.swt/src/org/simantics/browsing/ui/swt/DefaultIsExpandedProcessor.java b/bundles/org.simantics.browsing.ui.swt/src/org/simantics/browsing/ui/swt/DefaultIsExpandedProcessor.java
new file mode 100644 (file)
index 0000000..7c2ecfd
--- /dev/null
@@ -0,0 +1,149 @@
+/*******************************************************************************\r
+ * Copyright (c) 2007, 2010 Association for Decentralized Information Management\r
+ * in Industry THTH ry.\r
+ * All rights reserved. This program and the accompanying materials\r
+ * are made available under the terms of the Eclipse Public License v1.0\r
+ * which accompanies this distribution, and is available at\r
+ * http://www.eclipse.org/legal/epl-v10.html\r
+ *\r
+ * Contributors:\r
+ *     VTT Technical Research Centre of Finland - initial API and implementation\r
+ *******************************************************************************/\r
+package org.simantics.browsing.ui.swt;\r
+\r
+import gnu.trove.map.hash.THashMap;\r
+import gnu.trove.set.hash.THashSet;\r
+\r
+import java.util.Collection;\r
+import java.util.HashSet;\r
+import java.util.Map;\r
+import java.util.Set;\r
+\r
+import org.eclipse.swt.SWT;\r
+import org.eclipse.swt.widgets.Event;\r
+import org.eclipse.swt.widgets.Listener;\r
+import org.eclipse.swt.widgets.Tree;\r
+import org.simantics.browsing.ui.BuiltinKeys;\r
+import org.simantics.browsing.ui.GraphExplorer;\r
+import org.simantics.browsing.ui.NodeContext;\r
+import org.simantics.browsing.ui.NodeContext.PrimitiveQueryKey;\r
+import org.simantics.browsing.ui.PrimitiveQueryUpdater;\r
+import org.simantics.browsing.ui.common.processors.AbstractPrimitiveQueryProcessor;\r
+import org.simantics.browsing.ui.common.processors.IsExpandedProcessor;\r
+import org.simantics.browsing.ui.common.processors.ProcessorLifecycle;\r
+\r
+/**\r
+ * @author Tuukka Lehtonen\r
+ */\r
+public class DefaultIsExpandedProcessor extends AbstractPrimitiveQueryProcessor<Boolean> implements\r
+IsExpandedProcessor, ProcessorLifecycle {\r
+\r
+    /**\r
+     * The set of currently expanded node contexts.\r
+     */\r
+    private final Set<NodeContext>                        expanded        = new THashSet<NodeContext>();\r
+    private final Map<NodeContext, PrimitiveQueryUpdater> expandedQueries = new THashMap<NodeContext, PrimitiveQueryUpdater>();\r
+\r
+    private Tree tree;\r
+\r
+    public DefaultIsExpandedProcessor() {\r
+    }\r
+\r
+    @Override\r
+    public Object getIdentifier() {\r
+        return BuiltinKeys.IS_EXPANDED;\r
+    }\r
+\r
+    @Override\r
+    public String toString() {\r
+        return "IsExpandedProcessor";\r
+    }\r
+\r
+    @Override\r
+    public Boolean query(PrimitiveQueryUpdater updater, NodeContext context, PrimitiveQueryKey<Boolean> key) {\r
+        boolean isExpanded = expanded.contains(context);\r
+        //System.out.println("isExpanded(" + updater + ", " + context + "): " + isExpanded);\r
+        expandedQueries.put(context, updater);\r
+        return Boolean.valueOf(isExpanded);\r
+    }\r
+\r
+    @Override\r
+    public Collection<NodeContext> getExpanded() {\r
+        return new HashSet<NodeContext>(expanded);\r
+    }\r
+\r
+    @Override\r
+    public boolean getExpanded(NodeContext context) {\r
+        return this.expanded.contains(context);\r
+    }\r
+\r
+    @Override\r
+    public boolean setExpanded(NodeContext context, boolean expanded) {\r
+        return _setExpanded(context, expanded);\r
+    }\r
+\r
+    @Override\r
+    public boolean replaceExpanded(NodeContext context, boolean expanded) {\r
+        return nodeStatusChanged(context, expanded);\r
+    }\r
+\r
+    private boolean _setExpanded(NodeContext context, boolean expanded) {\r
+        if (expanded) {\r
+            return this.expanded.add(context);\r
+        } else {\r
+            return this.expanded.remove(context);\r
+        }\r
+    }\r
+\r
+    Listener treeListener = new Listener() {\r
+        @Override\r
+        public void handleEvent(Event event) {\r
+            NodeContext context = (NodeContext) event.item.getData();\r
+            switch (event.type) {\r
+                case SWT.Expand:\r
+                    nodeStatusChanged(context, true);\r
+                    break;\r
+                case SWT.Collapse:\r
+                    nodeStatusChanged(context, false);\r
+                    break;\r
+            }\r
+        }\r
+    };\r
+\r
+    protected boolean nodeStatusChanged(NodeContext context, boolean expanded) {\r
+        boolean result = _setExpanded(context, expanded);\r
+        PrimitiveQueryUpdater updater = expandedQueries.get(context);\r
+        if (updater != null)\r
+            updater.scheduleReplace(context, BuiltinKeys.IS_EXPANDED, expanded);\r
+        return result;\r
+    }\r
+\r
+    @Override\r
+    public void attached(GraphExplorer explorer) {\r
+        Object control = explorer.getControl();\r
+        if (control instanceof Tree) {\r
+            this.tree = (Tree) control;\r
+            tree.addListener(SWT.Expand, treeListener);\r
+            tree.addListener(SWT.Collapse, treeListener);\r
+        } else {\r
+            System.out.println("WARNING: " + getClass().getSimpleName() + " attached to unsupported control: " + control);\r
+        }\r
+    }\r
+\r
+    @Override\r
+    public void clear() {\r
+        expanded.clear();\r
+        expandedQueries.clear();\r
+    }\r
+\r
+    @Override\r
+    public void detached(GraphExplorer explorer) {\r
+        clear();\r
+        if (tree != null) {\r
+            tree.removeListener(SWT.Expand, treeListener);\r
+            tree.removeListener(SWT.Collapse, treeListener);\r
+            tree = null;\r
+        }\r
+    }\r
+\r
+}
\ No newline at end of file