// test stepper
public void testStep() throws Exception {
HashQueue q = new HashQueue();
final List cookieList = new LinkedList();
HashService.Callback cb =
new HashService.Callback() {
public void hashingFinished(
CachedUrlSet urlset,
long timeUsed,
Object cookie,
CachedUrlSetHasher hasher,
Exception e) {
cookieList.add(cookie);
}
};
HashQueue.Request r1, r2, r3, r4, r5;
r1 = req("1", 20000, 10000, 10000, cb);
r2 = req("2", 100000, 20000, 20000, cb);
r3 = req("3", 200000, 30000, 40000, cb);
assertTrue(q.insert(r2));
q.runAndNotify(3, 75, Boolean.TRUE);
long n2 = 20000 - 3 * 75;
assertEquals(n2, getBytesLeft(r2));
assertTrue(q.insert(r1));
assertTrue(q.insert(r3));
q.runAndNotify(3, 75, Boolean.TRUE);
// assertEquals(n2, getBytesLeft(r2));
// assertEquals(n2, getBytesLeft(r1));
}
// test completion & callback
public void testDone() throws Exception {
HashQueue q = new HashQueue();
final List cookieList = new LinkedList();
final List eList = new LinkedList();
HashService.Callback cb =
new HashService.Callback() {
public void hashingFinished(
CachedUrlSet urlset,
long timeUsed,
Object cookie,
CachedUrlSetHasher hasher,
Exception e) {
cookieList.add(cookie);
eList.add(e);
}
};
HashQueue.Request r1, r2, r3, r4, r5;
r1 = req(2000, 0, 100, cb);
r2 = req(10000, 0, 200, cb);
r3 = req(20000, 0, 0, cb);
r4 = req(50000, 0, 1, cb);
assertTrue(q.insert(r1));
assertTrue(q.insert(r2));
assertTrue(q.insert(r4));
assertEquals(0, cookieList.size());
q.removeCompleted();
assertEquals(0, cookieList.size());
// make r1 timeout
r1.deadline.expire();
q.removeCompleted();
List exp = ListUtil.list(r1);
assertEquals(exp, cookieList);
assertEquals(exp, q.getCompletedSnapshot());
// make r2 timeout
TimeBase.step(11000);
// r3 is finished
assertTrue(q.insert(r3));
Exception r4e = new Exception();
// make r4 error
r4.e = r4e;
q.removeCompleted();
// check that they all finished, and in the right order
Object exp2[] = {r1, r2, r3, r4};
assertIsomorphic(exp2, cookieList);
assertIsomorphic(exp2, q.getCompletedSnapshot());
// check their exceptions
assertTrue(eList.get(0) instanceof HashService.Timeout);
assertTrue(eList.get(1) instanceof HashService.Timeout);
assertSame(null, eList.get(2));
assertSame(r4e, eList.get(3));
}
public void testGetAvailableHashTimeBefore() {
HashQueue q = new HashQueue();
assertEquals(500, q.getAvailableHashTimeBefore(Deadline.in(500)));
HashQueue.Request r1, r2, r3, r4, r5, r6, r7;
r1 = simpleReq(200, 100);
r2 = simpleReq(2000, 1200);
r3 = simpleReq(3000, 500);
assertTrue(q.insert(r1));
assertTrue(q.insert(r2));
assertTrue(q.insert(r3));
assertEquals(100, q.getAvailableHashTimeBefore(Deadline.in(100)));
assertEquals(400, q.getAvailableHashTimeBefore(Deadline.in(500)));
assertEquals(700, q.getAvailableHashTimeBefore(Deadline.in(1000)));
assertEquals(700, q.getAvailableHashTimeBefore(Deadline.in(2000)));
assertEquals(1200, q.getAvailableHashTimeBefore(Deadline.in(3000)));
assertEquals(2200, q.getAvailableHashTimeBefore(Deadline.in(4000)));
// this will fully commit first 200 ms
r4 = simpleReq(200, 100);
assertTrue(q.insert(r4));
assertEquals(0, q.getAvailableHashTimeBefore(Deadline.in(100)));
assertEquals(0, q.getAvailableHashTimeBefore(Deadline.in(0)));
}
// test insert order
public void testInsertOrder() throws Exception {
HashQueue q = new HashQueue();
HashQueue.Request r1, r2, r3, r4, r5, r6, r7;
r1 = simpleReq(2000, 0);
r2 = simpleReq(3000, 0);
r3 = simpleReq(5000, 0);
r4 = simpleReq(2500, 0);
r5 = simpleReq(200, 0);
r6 = simpleReq(200, 0); // identical to r5, inserted before it
// so should go before it in queue
// One that has overrun, should end up last
r7 = simpleReq(200, 0);
r7.timeUsed = 201;
Object ord[] = {r6, r5, r1, r4, r2, r3, r7};
assertTrue(q.insert(r1));
assertTrue(q.insert(r2));
assertTrue(q.insert(r3));
assertTrue(q.insert(r6));
assertTrue(q.insert(r4));
assertTrue(q.insert(r5));
assertTrue(q.insert(r7));
assertIsomorphic(ord, (Collection) PrivilegedAccessor.getValue(q, "qlist"));
}
// test request acceptance
public void testAccept() {
HashQueue q = new HashQueue();
HashQueue.Request r1, r2, r3, r4, r5, r6;
r1 = simpleReq(-1, 100);
r2 = simpleReq(2000, 1000);
r3 = simpleReq(3000, 2900);
assertEquals(null, q.head());
assertFalse(q.insert(r1));
assertTrue(q.insert(r2));
assertFalse(q.insert(r3));
// change r2 to overrun
r2.timeUsed = 1200;
// r3 should now be accepted. It would prevent r2 from finishing in
// time, but sr2 should be ignored as it has overrun.
assertTrue(q.insert(r3));
}