}
assertTrue("Initial size was " + tm.size(), tm.size() == 21);
Text checkRow = new Text("000");
try {
DeletingIterator it = new DeletingIterator(new SortedMapIterator(tm), false);
it.seek(new Range(), EMPTY_COL_FAMS, false);
TreeMap<Key,Value> tmOut = new TreeMap<Key,Value>();
while (it.hasTop()) {
tmOut.put(it.getTopKey(), it.getTopValue());
it.next();
}
assertTrue("size after no propagation was " + tmOut.size(), tmOut.size() == 15);
for (Entry<Key,Value> e : tmOut.entrySet()) {
if (e.getKey().getRow().equals(checkRow)) {
byte[] b = e.getValue().get();
assertTrue(b[0] == 'n');
assertTrue(b[1] == 'e');
assertTrue(b[2] == 'w');
}
}
} catch (IOException e) {
assertFalse(true);
}
try {
DeletingIterator it = new DeletingIterator(new SortedMapIterator(tm), true);
it.seek(new Range(), EMPTY_COL_FAMS, false);
TreeMap<Key,Value> tmOut = new TreeMap<Key,Value>();
while (it.hasTop()) {
tmOut.put(it.getTopKey(), it.getTopValue());
it.next();
}
assertTrue("size after propagation was " + tmOut.size(), tmOut.size() == 16);
for (Entry<Key,Value> e : tmOut.entrySet()) {
if (e.getKey().getRow().equals(checkRow)) {
byte[] b = e.getValue().get();