The Rust Performance Trap I Hit While Sorting Small Network Datasets
I recently ran into one of those performance problems that looks completely obvious in hindsight, but was surprisingly hard to notice while I was inside the code.
I was working on a deep search and ranking part of a Rust project that processed network-related data.
The system had to evaluate many small groups of candidates repeatedly. You can think of these candidates as possible network paths, intermediate nodes, route-like records, latency candidates, or weighted decisions inside a search tree.
At each step, I had a small list of candidates.
