Crate cds

cds is a Collection of Data Structures.

cds implements handy data structures and their associated algorithms.

Design and Implementation Principles

1. Tested - for both correctness and performance
2. Fast - even if it requires unsafe Rust
3. Secure - do not unnecessarily hold a copy of (possibly sensitive) user data; wipe unused memory
4. No malloc - avoid dynamic memory allocation where possible
5. Compact - allow small memory footprint

Fixed-Capacity Data Structures

Fixed-capacity data structures can be allocated on stack. They do not allocate memory on the heap, and their capacity cannot be dynamically changed.

• ArrayVec - a vector-like array

Crate Features

• arrayvec - enables ArrayVec
• std - enables implementation of std traits which are not available in core. Without this feature the library is no_std.

Modules

arrayvecarrayvec

A vector-like array.

defs

Common definitions.

errors

Errors of the crate.

Macros

array_vecarrayvec

Creates an ArrayVec containing the arguments.

Traits

LengthType

A trait of custom length types.

SpareMemoryPolicy

A trait of custom spare memory policies.