Boost C++ Libraries Home Libraries People FAQ More

PrevUpHome

Performance

The following images show the results of randomly inserting, randomly erasing, and iterating over different containers. They come in two flavors, single (1 element at a time), and range (many elements at a time). It can be seen that segmented_tree::seq generally has the fastest random access insert and erase of single elements. It also has the fastest iterators among containers with efficient random access insert and erase. However, btree_seq currently wins by a large margin for range insert and erase. All graphs are logairthmic scale on the y axis.


PrevUpHome