Hi, On Tue, 2006-09-19 at 09:55 +0200, Marcus Roth wrote: > Hi, > > Gerrit Voss wrote: > > Hi, > > > > On Mon, 2006-09-18 at 16:44 -0500, Allen Bierbaum 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) > > > std::map<UInt32,FieldContainerPtr> fcStore; > > Why should we implement an one container type if we could use stl. Keep > things simple until we found there is a real > performance issue by profiling.
which new container are you talking about ?? At least I would not call std::vector< std::vector<FieldContainerPtr> > a new container. regards, gerrit ------------------------------------------------------------------------- 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
