--- /dev/null
+/*******************************************************************************\r
+ * Copyright (c) 2010, 2011 Association for Decentralized Information Management in\r
+ * 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.model.sorters;\r
+\r
+import java.util.HashMap;\r
+import java.util.HashSet;\r
+import java.util.List;\r
+import java.util.Map;\r
+import java.util.Set;\r
+\r
+import org.simantics.browsing.ui.BuiltinKeys;\r
+import org.simantics.browsing.ui.NodeContext;\r
+import org.simantics.browsing.ui.model.browsecontexts.BrowseContext;\r
+import org.simantics.db.ReadGraph;\r
+import org.simantics.db.Resource;\r
+import org.simantics.db.common.utils.ListUtils;\r
+import org.simantics.db.exception.DatabaseException;\r
+import org.simantics.layer0.Layer0;\r
+\r
+public class LinkedListSorter implements Sorter {\r
+\r
+ public static final LinkedListSorter INSTANCE = new LinkedListSorter();\r
+ \r
+ private LinkedListSorter() {}\r
+\r
+ @Override\r
+ public void sort(ReadGraph graph, BrowseContext context, List<NodeContext> nodes) throws DatabaseException {\r
+\r
+ Layer0 L0 = Layer0.getInstance(graph);\r
+ Set<Resource> parents = new HashSet<Resource>();\r
+ Map<Resource, NodeContext> map = new HashMap<Resource, NodeContext>();\r
+ for(NodeContext node : nodes) {\r
+ Resource r = (Resource)node.getConstant(BuiltinKeys.INPUT);\r
+ Resource parent = graph.getPossibleObject(r, L0.PartOf);\r
+ parents.add(parent);\r
+ map.put(r, node);\r
+ }\r
+ \r
+ if(parents.contains(null)) return;\r
+ if(parents.size() != 1) return;\r
+\r
+ Resource parent = parents.iterator().next();\r
+ nodes.clear();\r
+ for(Resource r : ListUtils.toList(graph, parent)) {\r
+ NodeContext ctx = map.get(r);\r
+ if(ctx != null) nodes.add(ctx);\r
+ }\r
+ \r
+ }\r
+\r
+}\r