private static void reduceVectorWise(long[] buf, int off, int len, int words, int m, int[] ks) { /* * NOTE: It's important we go from highest coefficient to lowest, because for the highest * one (only) we allow the ranges to partially overlap, and therefore any changes must take * effect for the subsequent lower coefficients. */ int baseBit = (words << 6) - m; int j = ks.length; while (--j >= 0) { flipVector(buf, off, buf, off + words, len - words, baseBit + ks[j]); } flipVector(buf, off, buf, off + words, len - words, baseBit); }
private static void reduceVectorWise(long[] buf, int off, int len, int words, int m, int[] ks) { /* * NOTE: It's important we go from highest coefficient to lowest, because for the highest * one (only) we allow the ranges to partially overlap, and therefore any changes must take * effect for the subsequent lower coefficients. */ int baseBit = (words << 6) - m; int j = ks.length; while (--j >= 0) { flipVector(buf, off, buf, off + words, len - words, baseBit + ks[j]); } flipVector(buf, off, buf, off + words, len - words, baseBit); }