pub async fn iter<'s, S: NorFlash, CI: CacheImpl>(
flash: &'s mut S,
flash_range: Range<u32>,
cache: &'s mut CI,
) -> Result<QueueIterator<'s, S, CI>, Error<S::Error>>Expand description
Get an iterator-like interface to iterate over the items stored in the queue. This goes from oldest to newest.
The iteration happens non-destructively, or in other words it peeks at every item. The returned entry has a QueueIteratorEntry::pop function with which you can decide to pop the item after you’ve seen the contents.