1 /*******************************************************************************
\r
2 * Copyright (c) 2007, 2010 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.modeling.requests;
\r
14 import java.util.Collection;
\r
15 import java.util.Comparator;
\r
16 import java.util.List;
\r
17 import java.util.Map;
\r
18 import java.util.Set;
\r
19 import java.util.Vector;
\r
20 import java.util.concurrent.ConcurrentHashMap;
\r
21 import java.util.concurrent.ConcurrentSkipListSet;
\r
23 import org.eclipse.jface.viewers.IFilter;
\r
24 import org.simantics.db.Resource;
\r
25 import org.simantics.scl.runtime.function.Function1;
\r
28 * @author Tuukka Lehtonen
\r
30 public class CollectionResult {
\r
32 public class DiagramFilter implements IFilter {
\r
34 private final IFilter proxy;
\r
36 public DiagramFilter(IFilter proxy) {
\r
41 public boolean select(Object node) {
\r
42 return diagramSet.contains(node) && (proxy == null || proxy.select(node));
\r
47 final public Set<Node> roots = new ConcurrentSkipListSet<Node>();
\r
48 final private Set<Node> diagramSet = new ConcurrentSkipListSet<Node>();
\r
49 final public List<Node> diagramList = new Vector<Node>();
\r
50 final public Map<Resource, Node> diagrams = new ConcurrentHashMap<Resource, Node>();
\r
52 public void addDiagram(Resource r, Node n) {
\r
58 public Collection<Node> breadthFirstFlatten() {
\r
59 return breadthFirstFlatten(null);
\r
62 public Collection<Node> breadthFirstFlatten(IFilter filter) {
\r
63 return Nodes.breadthFirstFlatten(new DiagramFilter(filter), roots);
\r
66 public Collection<Node> depthFirstFlatten() {
\r
67 return depthFirstFlatten(null, null);
\r
70 public Collection<Node> depthFirstFlatten(IFilter filter, Comparator<? super Node> comparator) {
\r
71 return Nodes.depthFirstFlatten(new DiagramFilter(filter), roots, comparator);
\r
76 * function that takes the walked Node as argument and returns a
\r
77 * boolean to describe whether to continue the walk or cancel the
\r
78 * walk. The returned value cannot be <code>null</code>.
\r
79 * @return <code>true</code> if the walk was completed or <code>false</code>
\r
80 * if the walk was cancelled
\r
82 public boolean walkTree(Function1<Node, Boolean> f) {
\r
83 return Nodes.walkTree(f, roots);
\r