Ready for release

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "sequential-storage"
-version = "0.6.0"
+version = "0.6.1"
 edition = "2021"
 license = "MIT OR Apache-2.0"
 description = "A crate for storing data in flash with minimal erase cycles."

README.md

@@ -76,8 +76,16 @@ You should only lose data when you give permission.
 Peeking and popping look at the oldest data it can find.
 When popping, the item is also erased.
 
+When using peek_many, you can look at all data from oldest to newest.
+
 ## Changelog
 
+(DD-MM-YY)
+
+### 0.6.1 - 16-12-23
+
+- Added queue peek_many and pop_many ([#12](https://github.com/tweedegolf/sequential-storage/pull/12))
+
 ### 0.6.0 - 21-11-23
 
 - *Breaking* Internal overhaul of the code. Both map and queue now use the same `item` module to store and read their data with.

src/queue.rs

@@ -176,7 +176,7 @@ pub fn peek_many<S: NorFlash>(flash: &mut S, flash_range: Range<u32>) -> PeekIte
 ///
 /// If you also want to remove the data use [pop].
 ///
-/// The data is written to the given `data_buffer`` and the part that was written is returned.
+/// The data is written to the given `data_buffer` and the part that was written is returned.
 /// It is valid to only use the length of the returned slice and use the original `data_buffer`.
 /// The `data_buffer` may contain extra data on ranges after the returned slice.
 /// You should not depend on that data.
@@ -208,7 +208,7 @@ pub fn pop_many<S: MultiwriteNorFlash>(
 ///
 /// If you don't want to remove the data use [peek].
 ///
-/// The data is written to the given `data_buffer`` and the part that was written is returned.
+/// The data is written to the given `data_buffer` and the part that was written is returned.
 /// It is valid to only use the length of the returned slice and use the original `data_buffer`.
 /// The `data_buffer` may contain extra data on ranges after the returned slice.
 /// You should not depend on that data.