by storing indices (u8) in the queues instead of pointers (*mut u8)
in the binary heap we store the baseline inline along with the index and the task name. Before we
stored a pointer to the message and had to lookup the baseline when comparing two nodes in the heap.