This is a continuation of Part I In Part I, we learned about the Sorted Vector as a replacement for map where iteration, lookups and memory overhead per element matter, while we cared little about insertions and removals. However the examples were rather simple: Keys are strings or integers. What […]
This is Part I, you can find Part II is here After talking with a few fellow Ogre team members, other colleagues, and even with community, I’ve realized that many are not familiar with the sorted vector pattern as a replacement for an std::map. Normally, C++’s std map (a Dictionary […]
(and O(N) for lookup) This pattern will be used widely in Ogre 2.0, so better get used it I thought it would be important to describe and explain it. It’s not rocket science, but without any explanation it can be a bit daunting at first. The problem We need a […]