Need help in chosing a suitable Container

[pc]

Hi,
Currently we are using a CDwordArray type array to store some
DWORD data. This data is dynamic and we need to continuously grow
the array size using SetAtGrow() . Due to performance reasons, we
are planning to try out other possible choices (Cmap,Clist,STL.....).
We want to use the Container that has
the best performance in terms of insertion & random access. We
would like to know the STL Container Class that would suit this
scenario.

thanks & regards,
Sumanth

[Karl Heinz Buchegger]

pc wrote:

Hi,
Currently we are using a CDwordArray type array to store some
DWORD data. This data is dynamic and we need to continuously grow
the array size using SetAtGrow() . Due to performance reasons, we
are planning to try out other possible choices (Cmap,Clist,STL.....).
We want to use the Container that has
the best performance in terms of insertion & random access. We
would like to know the STL Container Class that would suit this
scenario.

The STL replacement for MFCs CxxxArray is called std::vector.
It provides very similar functionality.

--
Karl Heinz Buchegger
kb******@gascad.at

[Allan Bruce]

"Karl Heinz Buchegger" <kb******@gascad.at> wrote in message
news:42***************@gascad.at...

pc wrote:

Hi,
Currently we are using a CDwordArray type array to store some
DWORD data. This data is dynamic and we need to continuously grow
the array size using SetAtGrow() . Due to performance reasons, we
are planning to try out other possible choices (Cmap,Clist,STL.....).
We want to use the Container that has
the best performance in terms of insertion & random access. We
would like to know the STL Container Class that would suit this
scenario.

The STL replacement for MFCs CxxxArray is called std::vector.
It provides very similar functionality.

If you want good performance for both insertion and random access then
consider using a hashtable, they have a little overhead in generating a hash
code but otherwise have very good performance for random access and
insertion. The only other stipulation is that the generated hashcodes must
be unique.

Allan