else
ArraysUtils.insertionSort(types, sortPermutation);
final int size = data.size();
Permutation sort = new Permutation(sortPermutation);
final Symmetry[] resulting = new Symmetry[symmetries.size() - 1];
int i, j;
int[] permutation;
IntArrayList current;
//0th is identity identity
for (i = 1; i < resulting.length + 1; ++i) {
current = symmetries.get(i).list;
permutation = new int[size];
for (j = 0; j < size; ++j)
permutation[j] = sort.inverse().newIndexOf(current.get(sort.newIndexOf(j)));
resulting[i - 1] = new Symmetry(permutation, symmetries.get(i).sign);
}
SimpleIndices simpleIndices = IndicesFactory.createSimple(indices);
simpleIndices.getSymmetries().addAllUnsafe(resulting);
return simpleIndices;