A Pythonic indexed priority queue
A priority queue dictionary maps hashable objects (keys) to priority-determining values. It provides a hybrid dictionary/priority queue API.
Works with Python 2.7+, 3.4+, and PyPy.
The priority queue is implemented as a binary heap of (key, priority value) pairs, which supports:
- O(1) search for the item with highest priority
- O(log n) removal of the item with highest priority
- O(log n) insertion of a new item
Additionally, an index maps elements to their location in the heap and is kept up to date as the heap is manipulated. As a result, pqdict also supports:
- O(1) lookup of any item by key
- O(log n) removal of any item
- O(log n) updating of any item’s priority level
Documentation is available at http://pqdict.readthedocs.org/en/latest/.
This module is released under the MIT license. The augmented heap implementation was adapted from the heapq module in the Python standard library, which was written by Kevin O’Connor and augmented by Tim Peters and Raymond Hettinger.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size pqdict-1.1.1-py2.py3-none-any.whl (7.7 kB)||File type Wheel||Python version py2.py3||Upload date||Hashes View|
|Filename, size pqdict-1.1.1.tar.gz (84.3 kB)||File type Source||Python version None||Upload date||Hashes View|
Hashes for pqdict-1.1.1-py2.py3-none-any.whl