Expand description
cds is a Collection of Data Structures.
cds implements handy data structures and their associated algorithms.
Design and Implementation Principles
- Tested - for both correctness and performance
- Fast - even if it requires
unsafeRust - Secure - do not unnecessarily hold a copy of (possibly sensitive) user data; wipe unused memory
- No malloc - avoid dynamic memory allocation where possible
- 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 arrayArrayString- a string-like array
Crate Features
Modules
arraystring
arraystringA string-like array.
arrayvec
arrayvecA vector-like array.
Types for dealing with fixed-capacity collection length.
Types and functions for dealing with memory.
Macros
array_str
arraystringCreates an ArrayString containing the arguments.
lformat
arraystringFormats an ArrayString possibly truncating the result.