BoundedFIFO bf = new BoundedFIFO(size);
for(int f = 0; f < i; f++) {
bf.put(e[f]);
}
bf.resize(n);
int expectedSize = min(n, min(i, size));
assertEquals(bf.length(), expectedSize);
for(int c = 0; c < expectedSize; c++) {
assertEquals(bf.get(), e[c]);
}