//iterating from 1 because zero'th element is always identity symmetry
for (k = 1; k < basis.size(); ++k) {
c = new int[data.length];
Symmetry s = basis.get(k);
for (j = 0; j < data.length; ++j)
if (cosort[j] < position || cosort[j] >= position + s.dimension())
c[j] = j;
else
c[j] = cosortInv[s.newIndexOf(cosort[j] - position) + position];
resultingSymmetries.addUnsafe(UnsafeCombinatorics.createUnsafe(c, s.isAntiSymmetry()));
}