Expand description

This is a storage wrapper based on AppendStore called DequeStore. It guarantees constant-cost appending to and popping from a list of items in storage on both directions (front and back).

This is achieved by storing each item in a separate storage entry. A special key is reserved for storing the length of the collection so far. Another special key is reserved for storing the offset of the collection.

Structs

A type allowing only reads from an deque store. useful in the context_, u8 of queries.

A type allowing both reads from and writes to the deque store at a given storage location.

An iterator over the contents of the deque store.