@Test
public void flipTestBigA() {
final int numCases = 1000;
final BitSet bs = new BitSet();
final Random r = new Random(3333);
int checkTime = 2;
MutableRoaringBitmap rb1 = new MutableRoaringBitmap(), rb2 = null; // alternate
// between
// them
for (int i = 0; i < numCases; ++i) {
final int start = r.nextInt(65536 * 20);
int end = r.nextInt(65536 * 20);
if (r.nextDouble() < 0.1) end = start + r.nextInt(100);
if ((i & 1) == 0) {
rb2 = MutableRoaringBitmap.flip(rb1, start, end);
// tweak the other, catch bad sharing
rb1.flip(r.nextInt(65536 * 20), r.nextInt(65536 * 20));
} else {
rb1 = MutableRoaringBitmap.flip(rb2, start, end);
rb2.flip(r.nextInt(65536 * 20), r.nextInt(65536 * 20));
}
if (start < end) bs.flip(start, end); // throws exception
// otherwise
// insert some more ANDs to keep things sparser
if (r.nextDouble() < 0.2 && (i & 1) == 0) {
final MutableRoaringBitmap mask = new MutableRoaringBitmap();
final BitSet mask1 = new BitSet();
final int startM = r.nextInt(65536 * 20);
final int endM = startM + 100000;
mask.flip(startM, endM);
mask1.flip(startM, endM);
mask.flip(0, 65536 * 20 + 100000);
mask1.flip(0, 65536 * 20 + 100000);
rb2.and(mask);
bs.and(mask1);
}
if (i > checkTime) {
System.out.println("check after " + i + ", card = " + rb2.getCardinality());
final MutableRoaringBitmap rb = (i & 1) == 0 ? rb2 : rb1;
final boolean status = equals(bs, rb);
Assert.assertTrue(status);
checkTime *= 1.5;
}
}
}
@Test
public void flipTestBig() {
final int numCases = 1000;
System.out.println("flipTestBig for " + numCases + " tests");
final MutableRoaringBitmap rb = new MutableRoaringBitmap();
final BitSet bs = new BitSet();
final Random r = new Random(3333);
int checkTime = 2;
for (int i = 0; i < numCases; ++i) {
final int start = r.nextInt(65536 * 20);
int end = r.nextInt(65536 * 20);
if (r.nextDouble() < 0.1) end = start + r.nextInt(100);
rb.flip(start, end);
if (start < end) bs.flip(start, end); // throws exception
// otherwise
// insert some more ANDs to keep things sparser
if (r.nextDouble() < 0.2) {
final MutableRoaringBitmap mask = new MutableRoaringBitmap();
final BitSet mask1 = new BitSet();
final int startM = r.nextInt(65536 * 20);
final int endM = startM + 100000;
mask.flip(startM, endM);
mask1.flip(startM, endM);
mask.flip(0, 65536 * 20 + 100000);
mask1.flip(0, 65536 * 20 + 100000);
rb.and(mask);
bs.and(mask1);
}
// see if we can detect incorrectly shared containers
if (r.nextDouble() < 0.1) {
final MutableRoaringBitmap irrelevant = MutableRoaringBitmap.flip(rb, 10, 100000);
irrelevant.flip(5, 200000);
irrelevant.flip(190000, 260000);
}
if (i > checkTime) {
Assert.assertTrue(equals(bs, rb));
checkTime *= 1.5;
}
}
}
public List<TOE> next() {
List<TOE> ret = new LinkedList<TOE>();
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
// if(G.get(i*M+j))
{
BitSet Gnew = (BitSet) (G.clone());
int[] x = {0, 1, -1, 0, 0};
int[] y = {0, 0, 0, 1, -1};
for (int k = 0; k < 5; k++) {
int xi = x[k];
int yi = y[k];
if ((i + xi) >= 0 && (i + xi) < N && (j + yi) >= 0 && (j + yi) < M) {
Gnew.flip((i + xi) * M + (j + yi));
}
}
TOE to = new TOE(N, M, Gnew);
to.mx = i;
to.my = j;
ret.add(to);
}
return ret;
}