A TimeQ is a queue datastructure where the contained items are time
ordered.
The underlying storage is a hashed hierarchical timer wheel, which
allows for relatively cheap insertion and popping of ready items.
It is also possible to cancel an entry given its id.