Expand description

Stable Structures for the Internet Computer

This library is a collection of data structures for developing canisters on the Internet Computer.

The data stuctures are designed to directly use stable memory as the backing store, allowing them to grow to GiBs in size without the need for pre_upgrade/post_upgrade hooks.

Re-exports

pub use btreemap::BTreeMap;
pub use btreemap::BTreeMap as StableBTreeMap;
pub use file_mem::FileMemory;
pub use storable::BoundedStorable;
pub use storable::Storable;
pub use vec_mem::VectorMemory;

Modules

A key/value store based on a B-Tree.
A serializable value stored in the stable memory.
An append-only list data structure, also known as log.
A module for simulating multiple memories within a single memory.

Structs

RestrictedMemory creates a limited view of another memory. This allows one to divide the main memory into non-intersecting ranges and use different layouts in each region.

Traits

Type Definitions