Priority Queue Dictionary (pqdict)
==================================
A priority queue dictionary maps hashable objects (keys) to priority-determining values. It provides a hybrid dictionary/priority queue API.
.. image:: https://github.com/nvictus/priority-queue-dictionary/actions/workflows/ci.yml/badge.svg
:target: https://github.com/nvictus/priority-queue-dictionary/actions/workflows/ci.yml
:alt: CI
.. image:: https://readthedocs.org/projects/pqdict/badge/?version=latest
:target: https://readthedocs.org/projects/pqdict/
:alt: Documentation Status
.. image:: https://img.shields.io/pypi/v/pqdict.svg
:target: https://pypi.python.org/pypi/pqdict
The priority queue itself is implemented as a binary heap of (key, priority value) elements, 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 each key to its element's 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
-------------
Documentation is available at http://pqdict.readthedocs.org/.
License
-------
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.
Raw data
{
"_id": null,
"home_page": null,
"name": "pqdict",
"maintainer": null,
"docs_url": "https://pythonhosted.org/pqdict/",
"requires_python": ">=3.7",
"maintainer_email": null,
"keywords": "data structures, dict, heap, priority queue, scheduler",
"author": null,
"author_email": "Nezar Abdennur <nabdennur@gmail.com>",
"download_url": "https://files.pythonhosted.org/packages/cb/e1/027807d870884da9296345606c5020e5edf111416a53455346fff695fa01/pqdict-1.4.1.tar.gz",
"platform": null,
"description": "Priority Queue Dictionary (pqdict)\n==================================\n\nA priority queue dictionary maps hashable objects (keys) to priority-determining values. It provides a hybrid dictionary/priority queue API. \n\n.. image:: https://github.com/nvictus/priority-queue-dictionary/actions/workflows/ci.yml/badge.svg\n :target: https://github.com/nvictus/priority-queue-dictionary/actions/workflows/ci.yml\n :alt: CI\n\n.. image:: https://readthedocs.org/projects/pqdict/badge/?version=latest\n :target: https://readthedocs.org/projects/pqdict/\n :alt: Documentation Status\n\n.. image:: https://img.shields.io/pypi/v/pqdict.svg\n :target: https://pypi.python.org/pypi/pqdict\n\nThe priority queue itself is implemented as a binary heap of (key, priority value) elements, which supports:\n\n- O(1) search for the item with highest priority\n\n- O(log n) removal of the item with highest priority\n\n- O(log n) insertion of a new item\n\nAdditionally, an index maps each key to its element's location in the heap and is kept\nup to date as the heap is manipulated. As a result, ``pqdict`` also supports:\n\n- O(1) lookup of any item by key\n\n- O(log n) removal of any item\n\n- O(log n) updating of any item's priority level\n\n\nDocumentation\n-------------\n\nDocumentation is available at http://pqdict.readthedocs.org/.\n\n\nLicense \n-------\n\nThis 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.\n",
"bugtrack_url": null,
"license": "MIT",
"summary": "A Pythonic indexed priority queue.",
"version": "1.4.1",
"project_urls": {
"changelog": "https://github.com/nvictus/pqdict/blob/master/CHANGES",
"documentation": "https://pqdict.readthedocs.io",
"homepage": "https://github.com/nvictus/pqdict",
"repository": "https://github.com/nvictus/pqdict"
},
"split_keywords": [
"data structures",
" dict",
" heap",
" priority queue",
" scheduler"
],
"urls": [
{
"comment_text": null,
"digests": {
"blake2b_256": "059bd9a0ed5bda0552530ec2e0760499b48a413399fa94ce9c209524d7dc4faf",
"md5": "6ade39f187ccfeb0cf9c0f62c393f4b8",
"sha256": "215223e41d3b5a45d8b38e4a43c0be3b641d5193c84576208b46d9e77e8edc75"
},
"downloads": -1,
"filename": "pqdict-1.4.1-py3-none-any.whl",
"has_sig": false,
"md5_digest": "6ade39f187ccfeb0cf9c0f62c393f4b8",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.7",
"size": 8730,
"upload_time": "2025-09-08T03:57:49",
"upload_time_iso_8601": "2025-09-08T03:57:49.590105Z",
"url": "https://files.pythonhosted.org/packages/05/9b/d9a0ed5bda0552530ec2e0760499b48a413399fa94ce9c209524d7dc4faf/pqdict-1.4.1-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": null,
"digests": {
"blake2b_256": "cbe1027807d870884da9296345606c5020e5edf111416a53455346fff695fa01",
"md5": "42fdb7498bb75ceec2e30fa2da070d20",
"sha256": "37b2711fea2e33952a664a447e7a9a0a45eb66d29243dfd22480c854d90c586b"
},
"downloads": -1,
"filename": "pqdict-1.4.1.tar.gz",
"has_sig": false,
"md5_digest": "42fdb7498bb75ceec2e30fa2da070d20",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.7",
"size": 164733,
"upload_time": "2025-09-08T03:57:51",
"upload_time_iso_8601": "2025-09-08T03:57:51.978565Z",
"url": "https://files.pythonhosted.org/packages/cb/e1/027807d870884da9296345606c5020e5edf111416a53455346fff695fa01/pqdict-1.4.1.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2025-09-08 03:57:51",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "nvictus",
"github_project": "pqdict",
"travis_ci": false,
"coveralls": false,
"github_actions": true,
"lcname": "pqdict"
}
JSON
