@Test
public final void testSetAndGet() {
// set regions [4..8], [11..14], [16..23], [9..10] to variables
fill(mF324, mCells, mR[1]);
fill(mF324, mCells, mR[3]);
fill(mF324, mCells, mR[5]);
fill(mF324, mCells, mR[2]);
assertTrue(equivalent(mF324, mCells));
// check that the dense regions in the matrix are [4..14] and [16..23]
Iterator<IndexedEntry<BooleanValue>> indeces = mF324.iterator();
checkEquals(Ints.merge(Ints.merge(mR[1], mR[2]), mR[3]), indeces);
checkEquals(mR[5], indeces);
// wipe out 4, 14, 23, and 10
blank(mF324, mCells, mR[1].min());
blank(mF324, mCells, mR[3].max());
blank(mF324, mCells, mR[5].max());
blank(mF324, mCells, mR[2].max());
assertTrue(equivalent(mF324, mCells));
// add 4 again
fill(mF324, mCells, range(mR[1].min(), mR[1].min()));
indeces = mF324.iterator();
checkEquals(
Ints.merge(range(mR[1].min(), mR[1].max()), range(mR[2].min(), mR[2].max() - 1)), indeces);
checkEquals(range(mR[2].max() + 1, mR[3].max() - 1), indeces);
checkEquals(range(mR[5].min(), mR[5].max() - 1), indeces);
// System.out.println(mF324);
}
@Test
public final void testClosure() {
BooleanMatrix mF44 = f.matrix(Dimensions.square(4, 2));
assertTrue(equivalent(mF44, mF44.closure()));
mF44.set(0, vars[0]);
mF44.set(9, vars[9]);
assertTrue(equivalent(mF44, mF44.closure()));
mF44.set(2, vars[2]);
BooleanValue[] result = new BooleanValue[mF44.dimensions().capacity()];
for (int i = 0; i < result.length; i++) {
result[i] = FALSE;
}
result[0] = vars[0];
result[1] = f.and(vars[2], vars[9]);
result[1] = f.or(result[1], f.and(vars[0], result[1]));
result[2] = vars[2];
result[9] = vars[9];
assertTrue(equivalent(mF44.closure(), result));
mF44.set(7, vars[7]);
result[7] = vars[7];
result[3] = f.and(vars[2], f.and(vars[9], vars[7]));
result[11] = f.and(vars[7], vars[9]);
assertTrue(equivalent(mF44.closure(), result));
// System.out.println(mF44.closure());
}
/**
* @return true if all cells in m have the same value as the corresponding cell in the given array
* of formulas. The method assumes that m.dimensions.capacity==cells.length.
*/
private static final boolean equivalent(BooleanMatrix m, BooleanValue[] cells) {
for (int i = 0; i < cells.length; i++) {
if (m.get(i) != cells[i]) {
// System.out.println(i + ": " + m.get(i) + " vs. " + cells[i]);
return false;
}
}
return true;
}
@Before
public void setUp() throws Exception {
mF324 = f.matrix(dim324);
mT324 = mF324.not();
mF43 = f.matrix(dim43);
mF4 = f.matrix(dim4);
Arrays.fill(mCells, FALSE);
}
/**
* @return true if all cells in m have the same value as the corresponding cell in bs. The method
* assumes that m.dimensions==b.dimensions.
*/
private static final boolean equivalent(BooleanMatrix m, BooleanMatrix b) {
if (!(equivalent(m.dimensions(), b.dimensions()) && m.density() == b.density())) return false;
int max = m.dimensions().capacity();
for (int i = 0; i < max; i++) {
if (m.get(i) != b.get(i)) return false;
}
return true;
}
@Test
public final void testDotProduct() {
fill(mF43, range(0, dim43.capacity() - 1));
fill(mF4, range(0, dim4.capacity() - 1));
assertDotProductFalse(mF324, mF43);
assertDotProductFalse(mF324, mF4);
fill(mF324, range(0, dim324.capacity() - 1));
BooleanValue[] result = new BooleanValue[dim324.dot(dim43).capacity()];
for (int i = 0; i < result.length; i++) {
result[i] = BooleanAccumulator.treeGate(Operator.Nary.OR);
}
int rows43 = dim324.dimension(dim324.numDimensions() - 1);
int rows324 = dim324.capacity() / rows43;
int cols43 = dim43.capacity() / rows43;
for (int i = 0; i < rows324; i++) {
for (int j = 0; j < cols43; j++) {
for (int k = 0; k < rows43; k++) {
int index324 = i * rows43 + k;
int index43 = j + k * cols43;
int indexR = cols43 * i + j;
((BooleanAccumulator) result[indexR]).add(f.and(mF324.get(index324), mF43.get(index43)));
}
}
}
for (int i = 0; i < result.length; i++) {
result[i] = f.accumulate((BooleanAccumulator) result[i]);
}
assertTrue(equivalent(mF324.dot(mF43), result));
for (int i = 0; i < dim324.capacity(); i += 2) {
mF324.set(i, FALSE);
}
for (int i = 1; i < dim4.capacity(); i += 2) {
mF4.set(i, FALSE);
}
assertDotProductFalse(mF324, mF4);
}
@Test
public final void testNot() {
fill(mT324, mCells, mR[1]);
fill(mT324, mCells, mR[3]);
for (int i = mR[1].min(); i <= mR[1].max(); i++) {
mCells[i] = f.not(mCells[i]);
}
for (int i = mR[3].min(); i <= mR[3].max(); i++) {
mCells[i] = f.not(mCells[i]);
}
mT324.set(mR[1].max() + 1, FALSE);
mCells[mR[1].max() + 1] = TRUE;
BooleanMatrix mNot = mT324.not();
assertTrue(equivalent(mT324.dimensions(), mNot.dimensions()));
assertTrue(equivalent(mNot, mCells));
// System.out.println(mT324);
// System.out.println(mNot);
}
@Test
public final void testAnd() {
assertTrue(equivalent(mT324, mT324.and(mT324)));
assertTrue(equivalent(mF324, mF324.and(mF324)));
assertTrue(equivalent(mF324, mF324.and(mT324)));
assertTrue(equivalent(mT324.and(mF324), mF324.and(mT324)));
for (int i = mR[2].min(); i <= mR[2].max(); i++) {
mT324.set(i, vars[i]);
mF324.set(i, vars[2 * i % vars.length]);
mCells[i] = f.and(vars[i], vars[2 * i % vars.length]);
}
assertTrue(equivalent(mT324.and(mF324), mCells));
mT324.set(mR[4].min(), vars[mR[4].min()]);
mF324.set(mR[3].min(), vars[mR[3].min()]);
mCells[mR[3].min()] = vars[mR[3].min()];
assertTrue(equivalent(mT324.and(mF324), mCells));
// System.out.println(mT324);
// System.out.println(mF324);
}
@Test
public final void testTranspose() {
BooleanMatrix mF43t = mF43.transpose();
assertEquals(mF43.density(), mF43t.density());
assertTrue(equivalent(dim43.transpose(), mF43t.dimensions()));
fill(mF43, range(0, dim43.capacity() - 1));
BooleanValue[] result = new BooleanValue[dim43.capacity()];
final int a = dim43.dimension(0), b = dim43.dimension(1);
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
result[j * a + i] = vars[i * b + j];
}
}
mF43t = mF43.transpose();
assertEquals(mF43.density(), mF43t.density());
assertTrue(equivalent(dim43.transpose(), mF43t.dimensions()));
assertTrue(equivalent(mF43t, result));
}
@Test
public final void testOverride() {
assertTrue(equivalent(mT324.override(mT324), mT324));
assertTrue(equivalent(mT324.override(mF324), mT324));
assertTrue(equivalent(mF324.override(mT324), mT324));
assertTrue(equivalent(mF324.override(mF324), mF324));
final BooleanMatrix mF324c = mF324.clone(), mT324c = mT324.clone();
mF324.set(3, vars[3]);
mF324.set(17, vars[17]);
mF324.set(22, vars[22]);
assertTrue(equivalent(mF324.override(mF324c), mF324));
assertTrue(equivalent(mF324.override(mT324), mT324));
mF324c.set(9, vars[9]);
assertTrue(equivalent(mF324.override(mF324c), mF324.or(mF324c)));
mT324.set(0, BooleanConstant.FALSE);
assertTrue(equivalent(mF324.override(mT324), mT324));
assertTrue(equivalent(mT324.override(mT324c), mT324c));
assertTrue(equivalent(mT324c.override(mT324), mT324));
final BooleanMatrix mFoF = f.matrix(dim324);
mF324.set(10, vars[10]);
mF324c.set(3, vars[4]);
mF324c.set(20, vars[20]);
mF324c.set(19, vars[19]);
mFoF.set(3, f.or(vars[4], f.and(vars[3], f.not(vars[4]))));
mFoF.set(9, vars[9]);
mFoF.set(10, f.and(vars[10], f.not(vars[9])));
mFoF.set(17, f.and(vars[17], f.and(f.not(vars[19]), f.not(vars[20]))));
mFoF.set(22, f.and(vars[22], f.and(f.not(vars[19]), f.not(vars[20]))));
mFoF.set(20, vars[20]);
mFoF.set(19, vars[19]);
assertTrue(equivalent(mF324.override(mF324c), mFoF));
mT324.set(3, vars[4]);
mT324.set(11, vars[11]);
for (int i = 16; i < 24; i++) mT324.set(i, vars[i - 16]);
final BooleanMatrix mFoT = f.matrix(dim324);
for (int i = 0; i < 16; i++) mFoT.set(i, mT324.get(i));
final BooleanAccumulator g = BooleanAccumulator.treeGate(Operator.AND);
for (int i = 0; i < 8; i++) g.add(f.not(vars[i]));
final BooleanValue v3 = f.accumulate(g);
for (int i = 16; i < 24; i++) mFoT.set(i, f.or(f.and(v3, mF324.get(i)), mT324.get(i)));
assertTrue(equivalent(mF324.override(mT324), mFoT));
final BooleanMatrix mToF = f.matrix(dim324);
for (int i = 0; i < 8; i++)
mToF.set(i, f.or(mF324.get(i), f.and(mT324.get(i), f.not(vars[3]))));
for (int i = 8; i < 16; i++)
mToF.set(i, f.or(mF324.get(i), f.and(mT324.get(i), f.not(vars[10]))));
for (int i = 16; i < 24; i++)
mToF.set(i, f.or(mF324.get(i), f.and(mT324.get(i), f.and(f.not(vars[17]), f.not(vars[22])))));
assertTrue(equivalent(mT324.override(mF324), mToF));
final BooleanMatrix mToT = f.matrix(dim324).not();
mT324c.set(11, vars[12]);
mT324c.set(12, vars[13]);
mT324c.set(18, vars[18]);
for (int i = 0; i < 16; i++) mToT.set(i, mT324.get(i));
for (int i = 16; i < 24; i++) mToT.set(i, f.or(mT324.get(i), f.and(mT324c.get(i), v3)));
assertTrue(equivalent(mT324c.override(mT324), mToT));
}
@Test
public final void testCrossProduct() {
final BooleanMatrix mT43 = mF43.not();
fill(mT43, range(0, dim43.capacity() - 1));
fill(mF4, range(0, dim4.capacity() - 1));
assertCrossProductFalse(mF324, mT43);
assertCrossProductFalse(mF324, mF4);
fill(mT324, range(0, dim324.capacity() - 1));
BooleanValue[] result = new BooleanValue[dim324.cross(dim43).capacity()];
Arrays.fill(result, TRUE);
final int c324 = dim324.capacity(), c43 = dim43.capacity();
final int c32443 = c324 * c43;
for (int i = 0; i < c32443; i++) {
result[i] = f.and(mT324.get(i / c43), mT43.get(i % c43));
}
assertTrue(equivalent(mT324.cross(mT43), result));
mT324.set(1, TRUE);
for (int i = c43; i < c43 * 2; i++) {
result[i] = mT43.get(i % c43);
}
assertTrue(equivalent(mT324.cross(mT43), result));
mT43.set(5, TRUE);
for (int i = 0; i < c324; i++) {
result[i * c43 + 5] = mT324.get(i);
}
assertTrue(equivalent(mT324.cross(mT43), result));
mT324.set(10, FALSE);
for (int i = c43 * 10; i < c43 * 11; i++) {
result[i] = FALSE;
}
assertTrue(equivalent(mT324.cross(mT43), result));
// System.out.println(Arrays.asList(result));
// System.out.println(mT324.crossProduct(mT43));
}
private final void assertCrossProductFalse(BooleanMatrix mF, BooleanMatrix m) {
BooleanMatrix product = mF.cross(m);
assertEquals(0, product.density());
assertTrue(equivalent(mF.dimensions().cross(m.dimensions()), product.dimensions()));
}
@Test
public final void testOr() {
assertTrue(equivalent(mT324, mT324.or(mT324)));
assertTrue(equivalent(mF324, mF324.or(mF324)));
assertTrue(equivalent(mT324, mT324.or(mF324)));
assertTrue(equivalent(mT324.or(mF324), mF324.or(mT324)));
Arrays.fill(mCells, TRUE);
for (int i = mR[1].min(); i <= mR[1].max(); i++) {
mT324.set(i, vars[i]);
mF324.set(i, vars[2 * i % vars.length]);
mCells[i] = f.or(vars[i], vars[2 * i % vars.length]);
}
assertTrue(equivalent(mT324.or(mF324), mCells));
mT324.set(mR[0].max(), vars[mR[0].max()]);
mF324.set(mR[2].min(), vars[mR[2].min()]);
mCells[mR[0].max()] = vars[mR[0].max()];
assertTrue(equivalent(mT324.or(mF324), mCells));
// System.out.println(mT324);
// System.out.println(mF324);
// System.out.println(Arrays.asList(mCells));
}
/** @ensures m'.elements = m.elements ++ index->FALSE && cells'[index] = FALSE */
private static final void blank(BooleanMatrix m, BooleanValue[] cells, int index) {
m.set(index, FALSE);
cells[index] = FALSE;
}
/**
* @ensures sets the cells in m, from range.min() to range.max(), to the corresponding values in
* vars.
*/
private final void fill(BooleanMatrix m, IntRange range) {
for (int i = range.min(); i <= range.max(); i++) {
m.set(i, vars[i]);
}
}
/**
* @ensures sets the cells in m and the array, from range.min() to range.max(), to the
* corresponding values in vars.
*/
private final void fill(BooleanMatrix m, BooleanValue[] cells, IntRange range) {
for (int i = range.min(); i <= range.max(); i++) {
m.set(i, vars[i]);
cells[i] = vars[i];
}
}