Structs

  • Queue with the possibility to remove elements from the middle of the list by their keys.
  • A wrapper around the pointer to the key of the queue element. This wrapper forwards the implementations of Eq and Hash to K. This is required becuase by default the implementations of Eq and Hash from the pointer itself will be used.