001    /*
002     * Sonar, open source software quality management tool.
003     * Copyright (C) 2008-2012 SonarSource
004     * mailto:contact AT sonarsource DOT com
005     *
006     * Sonar is free software; you can redistribute it and/or
007     * modify it under the terms of the GNU Lesser General Public
008     * License as published by the Free Software Foundation; either
009     * version 3 of the License, or (at your option) any later version.
010     *
011     * Sonar is distributed in the hope that it will be useful,
012     * but WITHOUT ANY WARRANTY; without even the implied warranty of
013     * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
014     * Lesser General Public License for more details.
015     *
016     * You should have received a copy of the GNU Lesser General Public
017     * License along with Sonar; if not, write to the Free Software
018     * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02
019     */
020    package org.sonar.graph;
021    
022    import java.util.Arrays;
023    import java.util.List;
024    
025    
026    public final class DsmManualSorter<V> {
027    
028      private final Dsm<V> dsm;
029      private final List<V> verticesInDesiredOrder;
030    
031      private DsmManualSorter(Dsm<V> dsm, List<V> verticesInDesiredOrder) {
032        this.dsm = dsm;
033        this.verticesInDesiredOrder = verticesInDesiredOrder;
034      }
035    
036      public static <V> void sort(Dsm<V> dsm, List<V> vertices) {
037        DsmManualSorter<V> sorter = new DsmManualSorter<V>(dsm, vertices);
038        sorter.sort();
039      }
040    
041      public static <V> void sort(Dsm<V> dsm, V... vertices) {
042        sort(dsm, Arrays.asList(vertices));
043      }
044    
045      private void sort() {
046        for (int desiredIndex = 0; desiredIndex < verticesInDesiredOrder.size(); desiredIndex++) {
047          int currentIndex = getCurrentIndex(verticesInDesiredOrder.get(desiredIndex));
048          dsm.permute(currentIndex, desiredIndex);
049        }
050      }
051    
052      private int getCurrentIndex(V v) {
053        for (int currentIndex = 0; currentIndex < dsm.getVertices().length; currentIndex++) {
054          if (dsm.getVertices()[currentIndex].equals(v)) {
055            return currentIndex;
056          }
057        }
058        throw new IllegalStateException("Vertex " + v + " is not contained in the DSM.");
059      }
060    
061    }