X-Git-Url: https://gerrit.simantics.org/r/gitweb?p=simantics%2Fplatform.git;a=blobdiff_plain;f=bundles%2Forg.simantics.browsing.ui.model%2Fsrc%2Forg%2Fsimantics%2Fbrowsing%2Fui%2Fmodel%2Fsorters%2FLinkedListSorter.java;h=2a39e924368a5f1fe36930b46487e442393e1608;hp=ed27b7165c75f0f96e2de39bc9713ca1cb6ad195;hb=0ae2b770234dfc3cbb18bd38f324125cf0faca07;hpb=24e2b34260f219f0d1644ca7a138894980e25b14 diff --git a/bundles/org.simantics.browsing.ui.model/src/org/simantics/browsing/ui/model/sorters/LinkedListSorter.java b/bundles/org.simantics.browsing.ui.model/src/org/simantics/browsing/ui/model/sorters/LinkedListSorter.java index ed27b7165..2a39e9243 100644 --- a/bundles/org.simantics.browsing.ui.model/src/org/simantics/browsing/ui/model/sorters/LinkedListSorter.java +++ b/bundles/org.simantics.browsing.ui.model/src/org/simantics/browsing/ui/model/sorters/LinkedListSorter.java @@ -1,60 +1,60 @@ -/******************************************************************************* - * Copyright (c) 2010, 2011 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.browsing.ui.model.sorters; - -import java.util.HashMap; -import java.util.HashSet; -import java.util.List; -import java.util.Map; -import java.util.Set; - -import org.simantics.browsing.ui.BuiltinKeys; -import org.simantics.browsing.ui.NodeContext; -import org.simantics.browsing.ui.model.browsecontexts.BrowseContext; -import org.simantics.db.ReadGraph; -import org.simantics.db.Resource; -import org.simantics.db.common.utils.ListUtils; -import org.simantics.db.exception.DatabaseException; -import org.simantics.layer0.Layer0; - -public class LinkedListSorter implements Sorter { - - public static final LinkedListSorter INSTANCE = new LinkedListSorter(); - - private LinkedListSorter() {} - - @Override - public void sort(ReadGraph graph, BrowseContext context, List nodes) throws DatabaseException { - - Layer0 L0 = Layer0.getInstance(graph); - Set parents = new HashSet(); - Map map = new HashMap(); - for(NodeContext node : nodes) { - Resource r = (Resource)node.getConstant(BuiltinKeys.INPUT); - Resource parent = graph.getPossibleObject(r, L0.PartOf); - parents.add(parent); - map.put(r, node); - } - - if(parents.contains(null)) return; - if(parents.size() != 1) return; - - Resource parent = parents.iterator().next(); - nodes.clear(); - for(Resource r : ListUtils.toList(graph, parent)) { - NodeContext ctx = map.get(r); - if(ctx != null) nodes.add(ctx); - } - - } - -} +/******************************************************************************* + * Copyright (c) 2010, 2011 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.browsing.ui.model.sorters; + +import java.util.HashMap; +import java.util.HashSet; +import java.util.List; +import java.util.Map; +import java.util.Set; + +import org.simantics.browsing.ui.BuiltinKeys; +import org.simantics.browsing.ui.NodeContext; +import org.simantics.browsing.ui.model.browsecontexts.BrowseContext; +import org.simantics.db.ReadGraph; +import org.simantics.db.Resource; +import org.simantics.db.common.utils.ListUtils; +import org.simantics.db.exception.DatabaseException; +import org.simantics.layer0.Layer0; + +public class LinkedListSorter implements Sorter { + + public static final LinkedListSorter INSTANCE = new LinkedListSorter(); + + private LinkedListSorter() {} + + @Override + public void sort(ReadGraph graph, BrowseContext context, List nodes) throws DatabaseException { + + Layer0 L0 = Layer0.getInstance(graph); + Set parents = new HashSet(); + Map map = new HashMap(); + for(NodeContext node : nodes) { + Resource r = (Resource)node.getConstant(BuiltinKeys.INPUT); + Resource parent = graph.getPossibleObject(r, L0.PartOf); + parents.add(parent); + map.put(r, node); + } + + if(parents.contains(null)) return; + if(parents.size() != 1) return; + + Resource parent = parents.iterator().next(); + nodes.clear(); + for(Resource r : ListUtils.toList(graph, parent)) { + NodeContext ctx = map.get(r); + if(ctx != null) nodes.add(ctx); + } + + } + +}