Module bern_kernel::mem::linked_list
source · [−]Expand description
Doubly-linked list.
The goal here is to create a fast and efficient linked list. Lists use an array of nodes as memory pool, the array must be static.
In contrast to std::collections::LinkedList
you will only ever get a reference to a node and never a copy/move.
Atomicity
In an attempt to reduce interrupt latency and with multicore systems in mind, the linked list uses atomic operations. However, these are not safe yet. Use a critical section when accessing the linked list.
Structs
A cursor over a LinkedList with editing operations.
An iterator over the elements of a LinkedList.
An mutable iterator over the elements of a LinkedList.
A doubly-linked list owning its nodes.
An element/node of a list.