2 Checks for usage of any `LinkedList`, suggesting to use a
3 `Vec` or a `VecDeque` (formerly called `RingBuf`).
8 > The TL;DR of `LinkedList` is that it's built on a massive amount of
9 pointers and indirection.
10 > It wastes memory, it has terrible cache locality, and is all-around slow.
12 > "only" amortized for push/pop, should be faster in the general case for
14 > workload, and isn't even amortized at all if you can predict the capacity
17 > `LinkedList`s are only really good if you're doing a lot of merging or
19 > This is because they can just mangle some pointers instead of actually
20 copying the data. Even
21 > if you're doing a lot of insertion in the middle of the list, `RingBuf`
23 > because of how expensive it is to seek to the middle of a `LinkedList`.
26 False positives – the instances where using a
27 `LinkedList` makes sense are few and far between, but they can still happen.
31 let x: LinkedList<usize> = LinkedList::new();