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.Arrays;
\r
15 import java.util.Comparator;
\r
16 import java.util.List;
\r
18 import org.simantics.browsing.ui.NodeContext;
\r
19 import org.simantics.browsing.ui.model.browsecontexts.BrowseContext;
\r
20 import org.simantics.db.ReadGraph;
\r
21 import org.simantics.db.exception.DatabaseException;
\r
23 public abstract class AbstractSorter<T> implements Sorter {
\r
25 public abstract T getSortingCriterion(ReadGraph graph, BrowseContext context, NodeContext node) throws DatabaseException;
\r
26 public abstract int compare(T a, T b);
\r
28 static class OrderNodeContext<T> {
\r
29 public final NodeContext node;
\r
30 public final T criterion;
\r
32 public OrderNodeContext(NodeContext node, T criterion) {
\r
34 this.criterion = criterion;
\r
38 Comparator<OrderNodeContext<T>> comparator = new Comparator<OrderNodeContext<T>>() {
\r
40 public int compare(OrderNodeContext<T> o1, OrderNodeContext<T> o2) {
\r
41 return AbstractSorter.this.compare(o1.criterion, o2.criterion);
\r
46 public void sort(ReadGraph graph, BrowseContext context, List<NodeContext> nodes) throws DatabaseException {
\r
47 @SuppressWarnings("unchecked")
\r
48 OrderNodeContext<T>[] orderNodes = new OrderNodeContext[nodes.size()];
\r
49 for (int i = 0; i < orderNodes.length; i++) {
\r
50 NodeContext node = nodes.get(i);
\r
51 orderNodes[i] = new OrderNodeContext<T>(node, getSortingCriterion(graph, context, node));
\r
53 Arrays.sort(orderNodes, comparator);
\r
54 for (int i = 0; i < orderNodes.length; i++)
\r
55 nodes.set(i, orderNodes[i].node);
\r