1 /*******************************************************************************
\r
2 * Copyright (c) 2010, 2011 Association for Decentralized Information Management in
\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.model.sorters;
\r
14 import java.util.HashMap;
\r
15 import java.util.HashSet;
\r
16 import java.util.List;
\r
17 import java.util.Map;
\r
18 import java.util.Set;
\r
20 import org.simantics.browsing.ui.BuiltinKeys;
\r
21 import org.simantics.browsing.ui.NodeContext;
\r
22 import org.simantics.browsing.ui.model.browsecontexts.BrowseContext;
\r
23 import org.simantics.db.ReadGraph;
\r
24 import org.simantics.db.Resource;
\r
25 import org.simantics.db.common.utils.ListUtils;
\r
26 import org.simantics.db.exception.DatabaseException;
\r
27 import org.simantics.layer0.Layer0;
\r
29 public class LinkedListSorter implements Sorter {
\r
31 public static final LinkedListSorter INSTANCE = new LinkedListSorter();
\r
33 private LinkedListSorter() {}
\r
36 public void sort(ReadGraph graph, BrowseContext context, List<NodeContext> nodes) throws DatabaseException {
\r
38 Layer0 L0 = Layer0.getInstance(graph);
\r
39 Set<Resource> parents = new HashSet<Resource>();
\r
40 Map<Resource, NodeContext> map = new HashMap<Resource, NodeContext>();
\r
41 for(NodeContext node : nodes) {
\r
42 Resource r = (Resource)node.getConstant(BuiltinKeys.INPUT);
\r
43 Resource parent = graph.getPossibleObject(r, L0.PartOf);
\r
44 parents.add(parent);
\r
48 if(parents.contains(null)) return;
\r
49 if(parents.size() != 1) return;
\r
51 Resource parent = parents.iterator().next();
\r
53 for(Resource r : ListUtils.toList(graph, parent)) {
\r
54 NodeContext ctx = map.get(r);
\r
55 if(ctx != null) nodes.add(ctx);
\r