public static void testPurge() {
Table<Integer> table = new Table<Integer>(5, 10, 0);
for (int seqno = 1; seqno <= 25; seqno++) table.add(seqno, seqno);
int[] seqnos = {30, 31, 32, 37, 38, 39, 40, 41, 42, 47, 48, 49};
for (int seqno : seqnos) table.add(seqno, seqno);
System.out.println("table (before remove):\n" + table.dump());
for (int seqno = 1; seqno <= 22; seqno++) table.remove(false);
System.out.println("\ntable (after remove 22, before purge):\n" + table.dump());
table.purge(22);
System.out.println("\ntable: (after purge 22):\n" + table.dump());
assert table.size() == 3 + seqnos.length;
assert table.computeSize() == table.size();
}
public static void testAdditionWithOffset() {
Table<Integer> table = new Table<Integer>(3, 10, 100);
addAndGet(table, 101, 105, 109, 110, 111, 119, 120, 129);
System.out.println("table: " + table.dump());
assert table.size() == 8;
assertCapacity(table.capacity(), 3, 10);
assertIndices(table, 100, 100, 129);
}
public static void testAdditionWithOffset2() {
Table<Integer> table = new Table<Integer>(3, 10, 2);
addAndGet(table, 1000, 1001);
table.compact();
addAndGet(table, 1005, 1009, 1010, 1011, 1019, 1020, 1029);
System.out.println("table: " + table.dump());
assert table.size() == 9;
assertIndices(table, 2, 2, 1029);
}
public static void testAdditionListWithOffset() {
Table<Integer> table = new Table<Integer>(3, 10, 100);
long seqnos[] = {101, 105, 109, 110, 111, 119, 120, 129};
List<Tuple<Long, Integer>> msgs = createList(seqnos);
System.out.println("table: " + table.dump());
assert table.add(msgs);
assert table.size() == 8;
for (long seqno : seqnos) assert table.get(seqno) == seqno;
assertCapacity(table.capacity(), 3, 10);
assertIndices(table, 100, 100, 129);
}
public static void testAddition() {
Table<Integer> table = new Table<Integer>(3, 10, 0);
assert !table.add(0, 0);
addAndGet(table, 1, 5, 9, 10, 11, 19, 20, 29);
System.out.println("table: " + table.dump());
assert table.size() == 8;
int size = table.computeSize();
assert size == 8;
assert table.size() == table.computeSize();
assertCapacity(table.capacity(), 3, 10);
assertIndices(table, 0, 0, 29);
}
public static void testAdditionList() {
Table<Integer> table = new Table<Integer>(3, 10, 0);
List<Tuple<Long, Integer>> msgs = createList(0);
assert !table.add(msgs);
long[] seqnos = {1, 5, 9, 10, 11, 19, 20, 29};
msgs = createList(seqnos);
assert table.add(msgs);
System.out.println("table: " + table.dump());
for (long seqno : seqnos) assert table.get(seqno) == seqno;
assert table.size() == 8;
int size = table.computeSize();
assert size == 8;
assert table.size() == table.computeSize();
assertCapacity(table.capacity(), 3, 10);
assertIndices(table, 0, 0, 29);
}
public void testResizeWithPurgeAndGetOfNonExistingElement() {
Table<Integer> table = new Table<Integer>(3, 10, 0);
for (int i = 1; i <= 50; i++) addAndGet(table, i);
System.out.println("table: " + table);
assertIndices(table, 0, 0, 50);
assert table.size() == 50 && table.getNumMissing() == 0;
// now remove 15 messages
for (long i = 1; i <= 15; i++) {
Integer num = table.remove(false);
assert num != null && num == i;
}
System.out.println("table after removal of seqno 15: " + table);
assertIndices(table, 0, 15, 50);
assert table.size() == 35 && table.getNumMissing() == 0;
table.purge(15);
System.out.println("now triggering a resize() by addition of seqno=55");
addAndGet(table, 55);
assertIndices(table, 15, 15, 55);
assert table.size() == 36 && table.getNumMissing() == 4;
// now we have elements 40-49 in row 1 and 55 in row 2:
List<Integer> list = new ArrayList<Integer>(20);
for (int i = 16; i < 50; i++) list.add(i);
list.add(55);
for (long i = table.getOffset(); i < table.capacity() + table.getOffset(); i++) {
Integer num = table._get(i);
if (num != null) {
System.out.println("num=" + num);
list.remove(num);
}
}
System.out.println("table:\n" + table.dump());
assert list.isEmpty() : " list: " + Util.print(list);
}
