This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: [RFC] optional fast iterators for set/map in libstdc++
- From: Paolo Carlini <paolo dot carlini at oracle dot com>
- To: Paolo Bonzini <bonzini at gnu dot org>
- Cc: "janis187 at us dot ibm dot com" <janis187 at us dot ibm dot com>, "libstdc++ at gcc dot gnu dot org" <libstdc++ at gcc dot gnu dot org>, "gcc-patches at gcc dot gnu dot org" <gcc-patches at gcc dot gnu dot org>
- Date: Fri, 08 May 2009 11:36:32 +0200
- Subject: Re: [RFC] optional fast iterators for set/map in libstdc++
- References: <1241744347.6152.26.camel@janis-laptop> <4A03CC71.1040509@gnu.org> <33E69F99-2B19-4F84-AD9F-7059523366DA@oracle.com>
Paolo Carlini wrote:
>> implemented using only 2 bits rather than 16 bytes of overhead (and then
>> you can in principle get rid of the parent pointer, and end up actually
>> saving memory).
> Thanks Paolo. Then I also suggest exploring other ways to implement
> the same basic idea.
Note that the _Rb_tree_color enum can certainly host the two bits
without changing the memory layout of _Rb_tree_node_base. I wonder if we
could even implement some of this (not optimally, maybe) without
breaking binary compatibility... Paolo, any idea?
Paolo.