Sorted Vector

---

The Sorted Vector pattern Part II

This entry was posted in Ogre Uncategorized and tagged Algorithms C++ Map alternative Data Oriented Design Fast iteration Fast lookups lower_bound Sorted Vector on November 29, 2014 by Matias

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 […]

---

The Sorted Vector pattern Part I

This entry was posted in Ogre and tagged Algorithms C++ Map alternative Data Oriented Design Fast iteration Fast lookups lower_bound Sorted Vector on May 11, 2014 by Matias

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 […]

---

---