80,81c80,81
< // second circularly linked list maintained by the 'nextInBin'
< // pointer. The list will be accessed in FIFO order. The end
---
> // second linked list (a stack) maintained by the 'nextInBin'
> // pointer. The list will be accessed in LIFO order. The end
89c89
< friend void insertBefore(Event *event, Event *curr);
---
> friend Event *insertBefore(Event *event, Event *curr);