Data structure for O(log N) find and update, considering small L1 cache

Question

I\'m currently working on an embedded device project where I\'m running into performance problems. Profiling has located an O(N) operation that I\'d like to eliminate.

I

Answer 1

Since you have limited N, can't you use std::set B with Boost's pool_allocator?