Use std::vector for cursor storage
We traverse the cursors way more than we do inserts/removals so we should optimize for fast traversal. Benchmarks on my PC show that even upto a thousand items a sorted std::vector wins the race.
We traverse the cursors way more than we do inserts/removals so we should optimize for fast traversal. Benchmarks on my PC show that even upto a thousand items a sorted std::vector wins the race.