org.sonar.graph.DsmManualSorter Maven / Gradle / Ivy
/*
* Sonar, open source software quality management tool.
* Copyright (C) 2009 SonarSource SA
* mailto:contact AT sonarsource DOT com
*
* Sonar is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or (at your option) any later version.
*
* Sonar is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with Sonar; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02
*/
package org.sonar.graph;
import java.util.Arrays;
import java.util.List;
public final class DsmManualSorter {
private final Dsm dsm;
private final List verticesInDesiredOrder;
private DsmManualSorter(Dsm dsm, List verticesInDesiredOrder) {
this.dsm = dsm;
this.verticesInDesiredOrder = verticesInDesiredOrder;
}
public static void sort(Dsm dsm, List vertices) {
DsmManualSorter sorter = new DsmManualSorter(dsm, vertices);
sorter.sort();
}
public static void sort(Dsm dsm, V... vertices) {
sort(dsm, Arrays.asList(vertices));
}
private void sort() {
for (int desiredIndex = 0; desiredIndex < verticesInDesiredOrder.size(); desiredIndex++) {
int currentIndex = getCurrentIndex(verticesInDesiredOrder.get(desiredIndex));
dsm.permute(currentIndex, desiredIndex);
}
}
private int getCurrentIndex(V v) {
for (int currentIndex = 0; currentIndex < dsm.getVertices().length; currentIndex++) {
if (dsm.getVertices()[currentIndex].equals(v)) {
return currentIndex;
}
}
throw new IllegalStateException("Vertex " + v + " is not contained in the DSM.");
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy