-/*******************************************************************************\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.modeling.requests;\r
-\r
-import java.util.Collection;\r
-import java.util.Comparator;\r
-import java.util.List;\r
-import java.util.Map;\r
-import java.util.Set;\r
-import java.util.Vector;\r
-import java.util.concurrent.ConcurrentHashMap;\r
-import java.util.concurrent.ConcurrentSkipListSet;\r
-\r
-import org.eclipse.jface.viewers.IFilter;\r
-import org.simantics.db.Resource;\r
-import org.simantics.scl.runtime.function.Function1;\r
-\r
-/**\r
- * @author Tuukka Lehtonen\r
- */\r
-public class CollectionResult {\r
-\r
- public class DiagramFilter implements IFilter {\r
-\r
- private final IFilter proxy;\r
-\r
- public DiagramFilter(IFilter proxy) {\r
- this.proxy = proxy;\r
- }\r
-\r
- @Override\r
- public boolean select(Object node) {\r
- return diagramSet.contains(node) && (proxy == null || proxy.select(node));\r
- }\r
-\r
- }\r
-\r
- final public Set<Node> roots = new ConcurrentSkipListSet<Node>();\r
- final private Set<Node> diagramSet = new ConcurrentSkipListSet<Node>();\r
- final public List<Node> diagramList = new Vector<Node>();\r
- final public Map<Resource, Node> diagrams = new ConcurrentHashMap<Resource, Node>();\r
-\r
- public void addDiagram(Resource r, Node n) {\r
- diagramList.add(n);\r
- diagrams.put(r, n);\r
- diagramSet.add(n);\r
- }\r
-\r
- public Collection<Node> breadthFirstFlatten() {\r
- return breadthFirstFlatten(null);\r
- }\r
-\r
- public Collection<Node> breadthFirstFlatten(IFilter filter) {\r
- return Nodes.breadthFirstFlatten(new DiagramFilter(filter), roots);\r
- }\r
-\r
- public Collection<Node> depthFirstFlatten() {\r
- return depthFirstFlatten(null, null);\r
- }\r
-\r
- public Collection<Node> depthFirstFlatten(IFilter filter, Comparator<? super Node> comparator) {\r
- return Nodes.depthFirstFlatten(new DiagramFilter(filter), roots, comparator);\r
- }\r
-\r
- /**\r
- * @param f\r
- * function that takes the walked Node as argument and returns a\r
- * boolean to describe whether to continue the walk or cancel the\r
- * walk. The returned value cannot be <code>null</code>.\r
- * @return <code>true</code> if the walk was completed or <code>false</code>\r
- * if the walk was cancelled\r
- */\r
- public boolean walkTree(Function1<Node, Boolean> f) {\r
- return Nodes.walkTree(f, roots);\r
- }\r
-\r
+/*******************************************************************************
+ * Copyright (c) 2007, 2010 Association for Decentralized Information Management
+ * in Industry THTH ry.
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors:
+ * VTT Technical Research Centre of Finland - initial API and implementation
+ *******************************************************************************/
+package org.simantics.modeling.requests;
+
+import java.util.Collection;
+import java.util.Comparator;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.Vector;
+import java.util.concurrent.ConcurrentHashMap;
+import java.util.concurrent.ConcurrentSkipListSet;
+
+import org.eclipse.jface.viewers.IFilter;
+import org.simantics.db.Resource;
+import org.simantics.scl.runtime.function.Function1;
+
+/**
+ * @author Tuukka Lehtonen
+ */
+public class CollectionResult {
+
+ public static final IFilter DIAGRAM_RESOURCE_FILTER = o -> Nodes.DIAGRAM_RESOURCE_PREDICATE.test((Node) o);
+ public static final IFilter DIAGRAM_RESOURCE_AND_RVI_FILTER = o -> Nodes.DIAGRAM_RESOURCE_AND_RVI_PREDICATE.test((Node) o);
+
+ public class DiagramFilter implements IFilter {
+
+ private final IFilter proxy;
+
+ public DiagramFilter(IFilter proxy) {
+ this.proxy = proxy;
+ }
+
+ @Override
+ public boolean select(Object node) {
+ return diagramSet.contains(node) && (proxy == null || proxy.select(node));
+ }
+
+ }
+
+ public final Set<Node> roots;
+ private final Set<Node> diagramSet;
+ public final List<Node> diagramList;
+ public final Map<Resource, Node> diagrams;
+
+ public CollectionResult() {
+ this.roots = new ConcurrentSkipListSet<Node>();
+ this.diagramSet = new ConcurrentSkipListSet<Node>();
+ this.diagramList = new Vector<Node>();
+ this.diagrams = new ConcurrentHashMap<Resource, Node>();
+ }
+
+ private CollectionResult(Set<Node> roots, Set<Node> diagramSet, List<Node> diagramList, Map<Resource, Node> diagrams) {
+ this.roots = roots;
+ this.diagramSet = diagramSet;
+ this.diagramList = diagramList;
+ this.diagrams = diagrams;
+ }
+
+ public CollectionResult withRoots(Set<Node> roots) {
+ return new CollectionResult(roots, diagramSet, diagramList, diagrams);
+ }
+
+ public void addDiagram(Resource r, Node n) {
+ diagramList.add(n);
+ diagrams.put(r, n);
+ diagramSet.add(n);
+ }
+
+ public Collection<Node> breadthFirstFlatten() {
+ return breadthFirstFlatten(null);
+ }
+
+ public Collection<Node> breadthFirstFlatten(IFilter filter) {
+ return Nodes.breadthFirstFlatten(new DiagramFilter(filter), roots);
+ }
+
+ public Collection<Node> depthFirstFlatten() {
+ return depthFirstFlatten(null, null);
+ }
+
+ public Collection<Node> depthFirstFlatten(IFilter filter, Comparator<? super Node> comparator) {
+ return Nodes.depthFirstFlatten(new DiagramFilter(filter), roots, comparator);
+ }
+
+ /**
+ * @param f
+ * function that takes the walked Node as argument and returns a
+ * boolean to describe whether to continue the walk or cancel the
+ * walk. The returned value cannot be <code>null</code>.
+ * @return <code>true</code> if the walk was completed or <code>false</code>
+ * if the walk was cancelled
+ */
+ public boolean walkTree(Function1<Node, Boolean> f) {
+ return Nodes.walkTree(f, roots);
+ }
+
}
\ No newline at end of file
Code Review / simantics / platform.git / blobdiff