We have to do it by ourselves, like this:įirst, we have to choose a way to compare elements. Unfortunately, C++ STL doesn't provide a 'std::ordered_vector' container that whould keep items sorted while allocating single chunk of continuous memory. That's why data structures that use separate nodes linked with pointers (like std::list, std::set, std::map) are slower than std::vector and it's often better to keep a sorted collection of elements in a vector, even if you have hundreds or thousands of elements and must sometimes insert or delete them from the middle. According to great presentation Pitfalls of Object Oriented Programming by Tony Albrecht from Sony, a cachce miss (access to some data from the memory which are not currently in CPU cache) costs about 400 cycles! Dynamic memory allocation (like operator new in C++) is also a slow operation. That's why books about C++ teach that for sorted collections - those who provide fast search operation - it's better to use containers like std::set or std::map.īut those who code games in C++ and care about performance know that today's processors (CPU) are very fast in terms of doing calculations and processing lots of data, while access to the RAM memory becomes more and more kind of a bottleneck. We were taught that inserting or deleting elements in the middle of the array is slow because we have to move (by rewriting) all following elements. Nadal je udostępniam, ale prawdopodobnie nie odzwierciedlają one mojej aktualnej wiedzy ani przekonań.Ī one-dimmensional array (also called vector) is very simple data structure. Uwaga! Informacje na tej stronie mają ponad 5 lat.

Flash actionscript 3.0 tryparse