List of all items[−]
+List of all items in this crate List of all items[−]
Structs
- Deque
- HistoryBuffer
- IndexMap
- IndexSet
- LinearMap
- String
- Vec
- binary_heap::BinaryHeap
- binary_heap::PeekMut
- mpmc::MpMcQueue
- pool::Box
- pool::Node
- pool::Pool
- pool::singleton::Box
- pool::singleton::arc::Arc
- pool::singleton::arc::ArcInner
- sorted_linked_list::FindMut
- sorted_linked_list::Iter
- sorted_linked_list::LinkedIndexU16
- sorted_linked_list::LinkedIndexU8
- sorted_linked_list::LinkedIndexUsize
- sorted_linked_list::Max
- sorted_linked_list::Min
- sorted_linked_list::Node
- sorted_linked_list::SortedLinkedList
- spsc::Consumer
- spsc::Iter
- spsc::IterMut
- spsc::Producer
- spsc::Queue
Enums
Traits
Typedefs
diff --git a/heapless/index.html b/heapless/index.html
index baa03f59..1ee4a023 100644
--- a/heapless/index.html
+++ b/heapless/index.html
@@ -1,4 +1,4 @@
-heapless - Rust Crate heapless[−][src]
Expand description
static
friendly data structures that don’t require dynamic memory allocation
+heapless - Rust Crate heapless[−][src]
Expand description
static
friendly data structures that don’t require dynamic memory allocation
The core principle behind heapless
is that its data structures are backed by a static memory
allocation. For example, you can think of heapless::Vec
as an alternative version of
std::Vec
with fixed capacity and that can’t be re-allocated on the fly (e.g. via push
).
List of all items[−]
Structs
- Deque
- HistoryBuffer
- IndexMap
- IndexSet
- LinearMap
- String
- Vec
- binary_heap::BinaryHeap
- binary_heap::PeekMut
- mpmc::MpMcQueue
- pool::Box
- pool::Node
- pool::Pool
- pool::singleton::Box
- pool::singleton::arc::Arc
- pool::singleton::arc::ArcInner
- sorted_linked_list::FindMut
- sorted_linked_list::Iter
- sorted_linked_list::LinkedIndexU16
- sorted_linked_list::LinkedIndexU8
- sorted_linked_list::LinkedIndexUsize
- sorted_linked_list::Max
- sorted_linked_list::Min
- sorted_linked_list::Node
- sorted_linked_list::SortedLinkedList
- spsc::Consumer
- spsc::Iter
- spsc::IterMut
- spsc::Producer
- spsc::Queue
Enums
Traits
Typedefs
Crate heapless[−][src]
Expand description
static
friendly data structures that don’t require dynamic memory allocation
Crate heapless[−][src]
Expand description
static
friendly data structures that don’t require dynamic memory allocation
The core principle behind heapless
is that its data structures are backed by a static memory
allocation. For example, you can think of heapless::Vec
as an alternative version of
std::Vec
with fixed capacity and that can’t be re-allocated on the fly (e.g. via push
).