{"id":13439125,"url":"https://github.com/garro95/priority-queue","last_synced_at":"2026-04-02T02:09:45.506Z","repository":{"id":22492829,"uuid":"96408054","full_name":"garro95/priority-queue","owner":"garro95","description":"A priority queue for Rust with efficient change function. ","archived":false,"fork":false,"pushed_at":"2025-10-15T20:13:37.000Z","size":410,"stargazers_count":215,"open_issues_count":7,"forks_count":34,"subscribers_count":6,"default_branch":"master","last_synced_at":"2025-12-14T05:33:11.275Z","etag":null,"topics":["data-structures","heap","heap-algorithm","min-max-heap","priority-queue"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/garro95.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2017-07-06T08:39:16.000Z","updated_at":"2025-12-13T08:38:01.000Z","dependencies_parsed_at":"2024-06-18T18:41:47.297Z","dependency_job_id":"9b26adff-032d-4a21-adbb-2925c369b6f4","html_url":"https://github.com/garro95/priority-queue","commit_stats":null,"previous_names":[],"tags_count":15,"template":false,"template_full_name":null,"purl":"pkg:github/garro95/priority-queue","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/garro95%2Fpriority-queue","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/garro95%2Fpriority-queue/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/garro95%2Fpriority-queue/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/garro95%2Fpriority-queue/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/garro95","download_url":"https://codeload.github.com/garro95/priority-queue/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/garro95%2Fpriority-queue/sbom","scorecard":{"id":419141,"data":{"date":"2025-08-11","repo":{"name":"github.com/garro95/priority-queue","commit":"1fb35cebe1429ce3228086823737f32a7e9eb3dd"},"scorecard":{"version":"v5.2.1-40-gf6ed084d","commit":"f6ed084d17c9236477efd66e5b258b9d4cc7b389"},"score":3.8,"checks":[{"name":"Dangerous-Workflow","score":10,"reason":"no dangerous workflow patterns detected","details":null,"documentation":{"short":"Determines if the project's GitHub Action workflows avoid dangerous patterns.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#dangerous-workflow"}},{"name":"Binary-Artifacts","score":10,"reason":"no binaries found in the repo","details":null,"documentation":{"short":"Determines if the project has generated executable (binary) artifacts in the source repository.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#binary-artifacts"}},{"name":"Packaging","score":-1,"reason":"packaging workflow not detected","details":["Warn: no GitHub/GitLab publishing workflow detected."],"documentation":{"short":"Determines if the project is published as a package that others can easily download, install, easily update, and uninstall.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#packaging"}},{"name":"Code-Review","score":0,"reason":"Found 1/22 approved changesets -- score normalized to 0","details":null,"documentation":{"short":"Determines if the project requires human code review before pull requests (aka merge requests) are merged.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#code-review"}},{"name":"Maintained","score":7,"reason":"8 commit(s) and 1 issue activity found in the last 90 days -- score normalized to 7","details":null,"documentation":{"short":"Determines if the project is \"actively maintained\".","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#maintained"}},{"name":"Pinned-Dependencies","score":0,"reason":"dependency not pinned by hash detected -- score normalized to 0","details":["Warn: GitHub-owned GitHubAction not pinned by hash: .github/workflows/build.yml:29: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/build.yml/master?enable=pin","Warn: third-party GitHubAction not pinned by hash: .github/workflows/build.yml:30: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/build.yml/master?enable=pin","Warn: GitHub-owned GitHubAction not pinned by hash: .github/workflows/build.yml:39: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/build.yml/master?enable=pin","Warn: third-party GitHubAction not pinned by hash: .github/workflows/build.yml:40: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/build.yml/master?enable=pin","Warn: GitHub-owned GitHubAction not pinned by hash: .github/workflows/build.yml:50: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/build.yml/master?enable=pin","Warn: third-party GitHubAction not pinned by hash: .github/workflows/build.yml:51: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/build.yml/master?enable=pin","Warn: GitHub-owned GitHubAction not pinned by hash: .github/workflows/static-checks.yml:16: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/static-checks.yml/master?enable=pin","Warn: GitHub-owned GitHubAction not pinned by hash: .github/workflows/static-checks.yml:23: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/static-checks.yml/master?enable=pin","Warn: third-party GitHubAction not pinned by hash: .github/workflows/static-checks.yml:24: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/static-checks.yml/master?enable=pin","Warn: GitHub-owned GitHubAction not pinned by hash: .github/workflows/static-checks.yml:32: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/static-checks.yml/master?enable=pin","Warn: third-party GitHubAction not pinned by hash: .github/workflows/static-checks.yml:33: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/static-checks.yml/master?enable=pin","Warn: GitHub-owned GitHubAction not pinned by hash: .github/workflows/static-checks.yml:41: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/static-checks.yml/master?enable=pin","Warn: third-party GitHubAction not pinned by hash: .github/workflows/static-checks.yml:42: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/static-checks.yml/master?enable=pin","Warn: GitHub-owned GitHubAction not pinned by hash: .github/workflows/test.yml:29: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/test.yml/master?enable=pin","Warn: third-party GitHubAction not pinned by hash: .github/workflows/test.yml:30: update your workflow using https://app.stepsecurity.io/secureworkflow/garro95/priority-queue/test.yml/master?enable=pin","Info:   0 out of   8 GitHub-owned GitHubAction dependencies pinned","Info:   0 out of   7 third-party GitHubAction dependencies pinned"],"documentation":{"short":"Determines if the project has declared and pinned the dependencies of its build process.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#pinned-dependencies"}},{"name":"Token-Permissions","score":0,"reason":"detected GitHub workflow tokens with excessive permissions","details":["Warn: no topLevel permission defined: .github/workflows/build.yml:1","Warn: no topLevel permission defined: .github/workflows/static-checks.yml:1","Warn: no topLevel permission defined: .github/workflows/test.yml:1","Info: no jobLevel write permissions found"],"documentation":{"short":"Determines if the project's workflows follow the principle of least privilege.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#token-permissions"}},{"name":"CII-Best-Practices","score":0,"reason":"no effort to earn an OpenSSF best practices badge detected","details":null,"documentation":{"short":"Determines if the project has an OpenSSF (formerly CII) Best Practices Badge.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#cii-best-practices"}},{"name":"Security-Policy","score":0,"reason":"security policy file not detected","details":["Warn: no security policy file detected","Warn: no security file to analyze","Warn: no security file to analyze","Warn: no security file to analyze"],"documentation":{"short":"Determines if the project has published a security policy.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#security-policy"}},{"name":"License","score":0,"reason":"license file not detected","details":["Warn: project does not have a license file"],"documentation":{"short":"Determines if the project has defined a license.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#license"}},{"name":"Fuzzing","score":0,"reason":"project is not fuzzed","details":["Warn: no fuzzer integrations found"],"documentation":{"short":"Determines if the project uses fuzzing.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#fuzzing"}},{"name":"Vulnerabilities","score":10,"reason":"0 existing vulnerabilities detected","details":null,"documentation":{"short":"Determines if the project has open, known unfixed vulnerabilities.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#vulnerabilities"}},{"name":"Signed-Releases","score":-1,"reason":"no releases found","details":null,"documentation":{"short":"Determines if the project cryptographically signs release artifacts.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#signed-releases"}},{"name":"Branch-Protection","score":0,"reason":"branch protection not enabled on development/release branches","details":["Warn: branch protection not enabled for branch 'master'"],"documentation":{"short":"Determines if the default and release branches are protected with GitHub's branch protection settings.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#branch-protection"}},{"name":"SAST","score":0,"reason":"SAST tool is not run on all commits -- score normalized to 0","details":["Warn: 0 commits out of 11 are checked with a SAST tool"],"documentation":{"short":"Determines if the project uses static code analysis.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#sast"}}]},"last_synced_at":"2025-08-19T00:43:35.146Z","repository_id":22492829,"created_at":"2025-08-19T00:43:35.146Z","updated_at":"2025-08-19T00:43:35.146Z"},"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31294413,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-02T01:43:37.129Z","status":"online","status_checked_at":"2026-04-02T02:00:08.535Z","response_time":89,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["data-structures","heap","heap-algorithm","min-max-heap","priority-queue"],"created_at":"2024-07-31T03:01:11.352Z","updated_at":"2026-04-02T02:09:45.472Z","avatar_url":"https://github.com/garro95.png","language":"Rust","funding_links":[],"categories":["Libraries","Rust","库 Libraries","库"],"sub_categories":["Data structures","数据结构 Data structures","数据结构"],"readme":"# PriorityQueue\n[![crate](https://img.shields.io/crates/v/priority-queue.svg)](https://crates.io/crates/priority-queue)\n[![Build](https://github.com/garro95/priority-queue/actions/workflows/build.yml/badge.svg)](https://github.com/garro95/priority-queue/actions/workflows/build.yml)\n[![Test](https://github.com/garro95/priority-queue/actions/workflows/test.yml/badge.svg)](https://github.com/garro95/priority-queue/actions/workflows/test.yml)\n![MSRV](https://img.shields.io/crates/msrv/priority-queue)\n\nThis crate implements a Priority Queue with a function to change the priority of an object.\nPriority and items are stored in an `IndexMap` and the queue is implemented as a Heap of indexes.\n\n\nPlease read the [API documentation here](https://docs.rs/priority-queue/)\n\n## Usage\n\nTo use this crate, simply add the following string to your `Cargo.toml`:\n```\npriority-queue = \"2.0.0\"\n```\nor use the command `cargo add priority-queue`\n\nVersion numbers follow the [semver](https://semver.org/) convention.\n\nThen use the data structure inside your Rust source code as in the following Example.\n\nRemember that, if you need serde support, you should compile using `--features serde`.\n\n## Examples\n```rust\nuse priority_queue::PriorityQueue;\n\nfn main() {\n    let mut pq = PriorityQueue::new();\n\n    assert!(pq.is_empty());\n    pq.push(\"Apples\", 5);\n    pq.push(\"Bananas\", 8);\n    pq.push(\"Strawberries\", 23);\n\n    assert_eq!(pq.peek(), Some((\u0026\"Strawberries\", \u002623)));\n\n    for (item, _) in pq.into_sorted_iter() {\n        println!(\"{}\", item);\n    }\n}\n```\nBy default, the highest priority element will be extracted first. The order can be easily reversed using the standard wrapper [`Reverse\u003cT\u003e`](https://doc.rust-lang.org/std/cmp/struct.Reverse.html).\n```rust\nuse priority_queue::PriorityQueue;\nuse std::cmp::Reverse;\n\nfn main() {\n    let mut pq = PriorityQueue::new();\n\n    assert!(pq.is_empty());\n    pq.push(\"Apples\", Reverse(5));\n    pq.push(\"Bananas\", Reverse(8));\n    pq.push(\"Strawberries\", Reverse(23));\n\n    assert_eq!(pq.peek(), Some((\u0026\"Apples\", \u0026Reverse(5))));\n\n    for (item, _) in pq.into_sorted_iter() {\n        println!(\"{}\", item);\n    }\n}\n```\n\n## Speeding up\n\nYou can use custom BuildHasher for the underlying IndexMap and therefore achieve better performance.\nFor example you can create the queue with the speedy [FxHash](https://github.com/Amanieu/hashbrown) hasher:\n\n```rust\nuse hashbrown::hash_map::DefaultHashBuilder;\n\nlet mut pq = PriorityQueue::\u003c_, _, DefaultHashBuilder\u003e::with_default_hasher();\n```\n\nAttention: FxHash does not offer any protection for dos attacks. This means that some pathological inputs can make the operations on the hashmap O(n^2). Use the standard hasher if you cannot control the inputs.\n\n## Benchmarks\n\nSome benchmarks have been run to compare the performances of this priority queue to the standard BinaryHeap, also using the FxHash hasher.\nOn a Ryzen 9 3900X, the benchmarks produced the following results:\n```\ntest benchmarks::priority_change_on_large_double_queue     ... bench:          25 ns/iter (+/- 1)\ntest benchmarks::priority_change_on_large_double_queue_fx  ... bench:          21 ns/iter (+/- 1)\ntest benchmarks::priority_change_on_large_queue            ... bench:          15 ns/iter (+/- 0)\ntest benchmarks::priority_change_on_large_queue_fx         ... bench:          11 ns/iter (+/- 0)\ntest benchmarks::priority_change_on_large_queue_std        ... bench:     190,345 ns/iter (+/- 4,976)\ntest benchmarks::priority_change_on_small_double_queue     ... bench:          26 ns/iter (+/- 0)\ntest benchmarks::priority_change_on_small_double_queue_fx  ... bench:          20 ns/iter (+/- 0)\ntest benchmarks::priority_change_on_small_queue            ... bench:          15 ns/iter (+/- 0)\ntest benchmarks::priority_change_on_small_queue_fx         ... bench:          10 ns/iter (+/- 0)\ntest benchmarks::priority_change_on_small_queue_std        ... bench:       1,694 ns/iter (+/- 21)\ntest benchmarks::push_and_pop                              ... bench:          31 ns/iter (+/- 0)\ntest benchmarks::push_and_pop_double                       ... bench:          31 ns/iter (+/- 0)\ntest benchmarks::push_and_pop_double_fx                    ... bench:          24 ns/iter (+/- 1)\ntest benchmarks::push_and_pop_fx                           ... bench:          26 ns/iter (+/- 0)\ntest benchmarks::push_and_pop_min_on_large_double_queue    ... bench:         101 ns/iter (+/- 2)\ntest benchmarks::push_and_pop_min_on_large_double_queue_fx ... bench:          98 ns/iter (+/- 0)\ntest benchmarks::push_and_pop_on_large_double_queue        ... bench:         107 ns/iter (+/- 2)\ntest benchmarks::push_and_pop_on_large_double_queue_fx     ... bench:         106 ns/iter (+/- 2)\ntest benchmarks::push_and_pop_on_large_queue               ... bench:          84 ns/iter (+/- 1)\ntest benchmarks::push_and_pop_on_large_queue_fx            ... bench:          78 ns/iter (+/- 2)\ntest benchmarks::push_and_pop_on_large_queue_std           ... bench:          71 ns/iter (+/- 1)\ntest benchmarks::push_and_pop_std                          ... bench:           4 ns/iter (+/- 0)\n```\n\nThe priority change on the standard queue was obtained with the following:\n\n```rust\npq = pq.drain().map(|Entry(i, p)| {\n    if i == 50_000 {\n        Entry(i, p/2)\n    } else {\n        Entry(i, p)\n    }\n}).collect()\n```\n\nThe interpretation of the benchmarks is that the data structures provided by this crate is generally slightly slower than the standard Binary Heap.\n\nOn small queues (\u003c10000 elements), the change_priority function, obtained on the standard Binary Heap with the code above, is way slower than the one provided by `PriorityQueue` and `DoublePriorityQueue`.\nWith the queue becoming bigger, the operation takes almost the same amount of time on `PriorityQueue` and `DoublePriorityQueue`, while it takes more and more time for the standard queue.\n\nIt also emerges that the ability to arbitrarily pop the minimum or maximum element comes with a cost, that is visible in all the operations on `DoublePriorityQueue`, that are slower then the corresponding operations executed on the `PriorityQueue`.\n\n## Contributing\n\nFeel free to contribute to this project with pull requests and/or issues.\n\nAll contribution shall be under a license compatible with the GNU LGPL version 3 or any later version and with the MPL version 2.0.\n\n## Changes\n\n* 2.8.0 Fix several bugs on iterators: [#80](https://github.com/garro95/priority-queue/issues/80), [#81](https://github.com/garro95/priority-queue/issues/81)\n* 2.7.0 Support `serde` feature even in `no-std` environments.\n* 2.6.0 Add equivalent trait support for flexible key lookups: [#74](https://github.com/garro95/priority-queue/pull/74). Convert `with_hasher` to const function: [#73](https://github.com/garro95/priority-queue/pull/73). Thanks to [liwenjieQu](https://github.com/liwenjieQu) and [AsakuraMizu](https://github.com/AsakuraMizu)\n* 2.5.0 Implement `contains`.\n* 2.4.1 Documentation improvements: add examples for `extract_if`\n* 2.4.0 Implement `extract_if`.\n* 2.3.1 Declare rust-version in Crate manifest: [#65](https://github.com/garro95/priority-queue/pull/65). Thanks to [aborgna-q](https://github.com/aborgna-q)\n* 2.3.0 Implement retain and retain_mut\n* 2.2.2 Fix a bug in the heapify_up implementation for DoublePriorityQueue\n* 2.2.1 Fix docs.rs build\n* 2.2.0 Implement `pop_if`. Documentation Improvements\n* 2.1.2 Documentation improvements: [#58](https://github.com/garro95/priority-queue/pull/58). Thanks to [jmr](https://github.com/jmr)\n* 2.1.1 Bug fix: [#56](https://github.com/garro95/priority-queue/issues/56)\n* 2.1.0 Implement `drain` and `reserve` variations\n* 2.0.3 Some licensing-related housekeeping: [#54](https://github.com/garro95/priority-queue/pull/54). Thanks to [musicinmybrain](https://github.com/musicinmybrain)\n* 2.0.2 Fix docs.rs build\n* 2.0.1 Documentation improvements\n* 2.0.0 This release contains **breaking changes**\n    * Some methods now require the trait bound `H: BuildHasher`. \n      This change will likely have a small impact or none.\n    * The standard library support is no longer auto-detected. The feature \"std\" is included in the default feature set, or else can be enabled like any other Cargo feature. Users that need to support `no_std` targets will have to disable default features.\n* 1.4.0 Improve `shrink_to_fit` to also shrink the internal IndexMap ([#50](https://github.com/garro95/priority-queue/issues/50))\n* 1.3.2 Bug fix in the `log2_fast` internal function\n* 1.3.1 Bug fix: [#42](https://github.com/garro95/priority-queue/issues/42)\n* 1.3.0 Return bool from `change_priority_by` (Merged [#41](https://github.com/garro95/priority-queue/pull/41))\n* 1.2.3 Further performance optimizations (mainly on `DoublePriorityQueue`)\n* 1.2.2 Performance optimizations\n* 1.2.1 Bug fix: [#34](https://github.com/garro95/priority-queue/issues/34)\n* 1.2.0 Implement DoublePriorityQueue data structure\n* 1.1.1 Convert documentation to Markdown\n* 1.1.0 Smooth `Q: Sized` requirement on some methods (fix [#32](https://github.com/garro95/priority-queue/issues/32))\n* 1.0.5 Bug fix: [#28](https://github.com/garro95/priority-queue/issues/28)\n* 1.0.4 Bug fix: [#28](https://github.com/garro95/priority-queue/issues/28)\n* 1.0.3 Bug fix: [#26](https://github.com/garro95/priority-queue/issues/26)\n* 1.0.2 Added documentation link to Cargo.toml so the link is shown in the results page of crates.io\n* 1.0.1 Documentation\n* 1.0.0 This release contains **breaking changes!**\n    * `From` and `FromIterator` now accept custom hashers -- **Breaking:**\n      every usage of `from` and `from_iter` must specify some type to help the type inference. To use the default hasher (`RandomState`), often it will be enough to add something like\n\n      ```rust\n\t\tlet pq: PriorityQueue\u003c_, _\u003e = PriorityQueue::from...\n\t  ```\n\n      or you can add a type definition like\n\n      ```rust\n\t\ttype Pq\u003cI, P\u003e = PriorityQueue\u003cI, P\u003e\n\t  ```\n\n      and then use `Pq::from()` or `Pq::from_iter()`\n    * Support no-std architectures\n    * Add a method to remove elements at arbitrary positions\n    * Remove `take_mut` dependency -- **Breaking:**\n      `change_priority_by` signature has changed. Now it takes a priority_setter `F: FnOnce(\u0026mut P)`.\n      If you want you can use the unsafe `take_mut` yourself or also use `std::mem::replace`\n* 0.7.0 Implement the `push_increase` and `push_decrease` convenience methods.\n* 0.6.0 Allow the usage of custom hasher\n* 0.5.4 Prevent panic on extending an empty queue\n* 0.5.3 New implementation of the `Default` trait avoids the requirement that `P: Default`\n* 0.5.2 Fix documentation formatting\n* 0.5.1 Add some documentation for `iter_mut()`\n* 0.5.0 Fix [#7](https://github.com/garro95/priority-queue/issues/7) implementing the `iter_mut` features\n* 0.4.5 Fix [#6](https://github.com/garro95/priority-queue/issues/6) for `change_priority` and `change_priority_by`\n* 0.4.4 Fix [#6](https://github.com/garro95/priority-queue/issues/6)\n* 0.4.3 Fix [#4](https://github.com/garro95/priority-queue/issues/4) changing the way `PriorityQueue` serializes.\n  Note that old serialized `PriorityQueue`s may be incompatible with the new version.\n  The API should not be changed instead.\n* 0.4.2 Improved performance using some unsafe code in the implementation.\n* 0.4.1 Support for `serde` when compiled with `--features serde`.\n  `serde` marked as optional and `serde-test` as dev-dipendency.\n  Now compiling the crate won't download and compile also `serde-test`, neither `serde` if not needed.\n* 0.4.0 Support for serde when compiled with `cfg(serde)`\n* 0.3.1 Fix [#3](https://github.com/garro95/priority-queue/issues/3)\n* 0.3.0 Implement PartialEq and Eq traits\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgarro95%2Fpriority-queue","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgarro95%2Fpriority-queue","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgarro95%2Fpriority-queue/lists"}