Prepare version

Author: Gianmarco Garrisi

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "priority-queue"
-version = "2.7.0"
+version = "2.8.0"
 authors = ["Gianmarco Garrisi <gianmarcogarrisi@tutanota.com>"]
 description = "A Priority Queue implemented as a heap with a function to efficiently change the priority of an item."
 repository = "https://github.com/garro95/priority-queue"

README.md

@@ -133,6 +133,7 @@ All contribution shall be under a license compatible with the GNU LGPL version 3
 
 ## Changes
 
+* 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)
 * 2.7.0 Support `serde` feature even in `no-std` environments.
 * 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)
 * 2.5.0 Implement `contains`.

tests/priority_queue.rs

@@ -751,7 +751,7 @@ mod pqueue_tests {
         assert_eq!(into_iter.len(), 5);
         assert_eq!(into_iter.next(), Some(("a", 1)));
         assert_eq!(into_iter.next_back(), Some(("h", 3)));
-        
+
         /*
         As expected, this does not compile
         assert_eq!(pq.pop(), Some(("b", 20)));