Hi all,
Gerrit Voss wrote:
>
>>- It looks like the container store vector grows without bound. Entries
>>in the vector are never reclaimed. Has this ever been a problem? If
>>so, would it be better to use another type of data structure that allows
>>space to be reclaimed (hash_map with increasing id)?
>
>
> it's somewhere on my todo list but I haven't hat time to look into it.
> There is one thing I would like to see soon. Basically instead of using
> one big vector use many fixed size vectors. This at least should get
> around the need to have one big memory blob.
> Reusing ids is something I would like to have but I haven't figured out
> all the implications on parts that do id remappings (like the cluster).
If possible I would like to avoid reusing IDs, especially because of the
implications. A hash_map would be an option, but I thought there was
another data structure based on fixed-size blocks that could be used for
this. Similar in structure to a pool, but not quite like it. I can't
find it in STL, not sure where I got that from. Hm, did I give that as a
homework in my programming class once? ;)
Dirk
-------------------------------------------------------------------------
Take Surveys. Earn Cash. Influence the Future of IT
Join SourceForge.net's Techsay panel and you'll get the chance to share your
opinions on IT & business topics through brief surveys -- and earn cash
http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
_______________________________________________
Opensg-core mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/opensg-core
