
21 Sep
2007
21 Sep
'07
5:05 p.m.
On Mon, 2007-09-17 at 16:14 +0200, Joaquín Mª López Muñoz wrote:
So, the per-item overhead of each index of a multi_index_container with n elements is (in sizeof(pointer) units):
* Ordered: 3 * Hashed: 1+1,33/max_load_factor() (assuming the typical occupation of a hash table is 0.5(1+1/GF) where GF is the table growth factor, in our case ~2) * Sequenced: 2 * Random access: 1+0,83 (again assuming an occupation with respect to capacity of 0.5(1+1/GF), but thes indices use GF=1.5)
Wonderful, thank you! - Doug