15 Mar
2015
15 Mar
'15
7:58 p.m.
Hello, I have runned benchmarks on the original implementation. It works slightly better even than the implementation based on std::map. Insertion time on benchmarks it's about -0.4 seconds better and I can't figure out why. That implementation updates 4 additional pointers and the current implementation does only one copy for updating the value. Also, node size is smaller. I don't understand how the original implementation can be more cache friendly. Cosmin