Hi,
On Tue, 2006-09-19 at 11:18 +0200, Carsten Neumann wrote:
> An: [email protected]
> Betreff: Re: [Opensg-core] fc store
> > >
> > > 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? ;)
> >
>
> what about std::deque<> ? AFAIR this gives you the vector interface, but the
> underlying memory grows in independent chunks.
yeah that one makes more sense I have a look.
regards,
gerrit
--
It's Emergent[*], you see.
[*] [adj] A word favored by computer nerds; mandatory for DARPA research
applications; on recent evidence, a synonym for 'doomed'.
-------------------------------------------------------------------------
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
