TrieQueue e is a priority queue
IQueue instance satisfying
QueueKey (TrieQueue e) ~ [e], with the property that this queue frequently performs better than any other queue
implementation in this package for keys of type
This particular implementation is highly experimental and possibly a genuinely new data structure. See the source code for details. However, for many cases this priority queue may be used for a heap sort that runs faster than the Data.List implementation, or the vanilla Data.Queue.PQueue implementation.