{"id":15646637,"url":"https://github.com/nvictus/pqdict","last_synced_at":"2025-04-06T13:10:42.525Z","repository":{"id":57454513,"uuid":"4186493","full_name":"nvictus/pqdict","owner":"nvictus","description":"A Pythonic indexed priority queue","archived":false,"fork":false,"pushed_at":"2024-08-01T02:02:29.000Z","size":989,"stargazers_count":89,"open_issues_count":0,"forks_count":27,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-30T11:09:30.536Z","etag":null,"topics":["dictionary","indexed","priority-queue","python","sorted-dict"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/nvictus.png","metadata":{"files":{"readme":"README.rst","changelog":"CHANGES","contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2012-04-30T20:09:17.000Z","updated_at":"2025-03-04T13:31:49.000Z","dependencies_parsed_at":"2023-01-22T07:30:09.079Z","dependency_job_id":"2ab3d176-8a19-47ae-8a96-ffd00ff0bb7a","html_url":"https://github.com/nvictus/pqdict","commit_stats":{"total_commits":154,"total_committers":9,"mean_commits":17.11111111111111,"dds":"0.12337662337662336","last_synced_commit":"bd8307a74627ed53c55c4bd377c0d998f70ce544"},"previous_names":["nvictus/pqdict","nvictus/priority-queue-dictionary"],"tags_count":8,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nvictus%2Fpqdict","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nvictus%2Fpqdict/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nvictus%2Fpqdict/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nvictus%2Fpqdict/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nvictus","download_url":"https://codeload.github.com/nvictus/pqdict/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247485287,"owners_count":20946398,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dictionary","indexed","priority-queue","python","sorted-dict"],"created_at":"2024-10-03T12:13:33.853Z","updated_at":"2025-04-06T13:10:42.504Z","avatar_url":"https://github.com/nvictus.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"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","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnvictus%2Fpqdict","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnvictus%2Fpqdict","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnvictus%2Fpqdict/lists"}