Module sequential_storage::queue

A queue (fifo) implementation for storing arbitrary data in flash memory.

Use push to add data to the fifo and use peek and pop to get the data back.

Functions

• peek
  Peek at the oldest data.
• pop
  Pop the oldest data from the queue.
• push
  Push data into the queue in the given flash memory with the given range. The data can only be taken out with the pop function.