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 post is addressed to all the software dev. managers with this mentality, where a (probably manager) was honest in that they don’t care about Data Oriented Design (or any performance optimization strategy that requires some dev time, for that matter). A transcipt ensues: – We worry not so much […]
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 […]
You may have seen on Mike Acton’s twitter account that he posted a review code on OgreNode.cpp. Seems like some community members are waiting for my response, I made a few comments on bounceapp but due to my inexperience with that site I didn’t realize changes had to be saved. […]
…and I’m biased like no one! Now that I’ve got your attention with such pretentious title :), let’s clear a few things: This is an unfair comparison. More than half of Ogre features are disabled (because they do not compile or would crash). It’s possible that adding them back could […]
