Recherches récentes
Options de recherche
@martin it looks like an LRU cache. There are multiple crates already implementing this.
Looking at the most popular, it uses a custom unsafe linked list implementation to be able to hold multiple pointers to the same node, which would not be possible with a safe API as the standard library intends to do.
Vec does not deallocate when removing elements, but you can force that with shrink_to_fit.
@martin You could also implement a linked list on top of a Vec, storing indices instead of pointers. It's probably more efficient with regards to cache and reducing the need for multiple allocations.
In embedded you want to limit allocations as much as you can. It often means preallocating all the memory you need at the very beginning of the program. Linked-list are not very friendly for that pattern.