Ogre 2.0: O(1) insertion, removal and contiguous memory iteration
(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 […]