|
Boost : |
Subject: Re: [boost] [MultiIndex] Memory consumption of ordered indices
From: Joaquin M Lopez Munoz (joaquin_at_[hidden])
Date: 2015-02-21 03:53:03
Olaf van der Spek <ml <at> vdspek.org> writes:
>
> On Fri, Feb 20, 2015 at 3:01 PM, Joaquin M Lopez Munoz
> <joaquin <at> tid.es> wrote:
> >
> > The overhead (on most platforms) is three pointers per node (and index):
> >
> > http://stackoverflow.com/a/4208349/213114
> >
> > Color is usually embedded into one of the pointers:
> >
> > http://bannalia.blogspot.com/2008/11/
> > optimizing-red-black-tree-color-bits.html
>
> And for sequenced?
Two pointers per node.
> [...]
> > What's a "write-only" structure supposed to be useful for? [...]
>
> The data structure is filled once (data read from DB) and then
> queried lots.
I'd say "read only" is a more common name fo this usage pattern.
> Perhaps a flat_map would be better suited.
If you only have one¹à°Ñ¡¥Ì¥Ì±¥±äͼ´µ±
Ñ}µ
Àݽձ¥Ù)å½ÔÑ¡±
Íеµ½Éä½ÙÉ¡
¸())½
Å×µ¸43ÍÁè5׎è)Q±Í¹¥
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk