This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: std::ext STL (was: Re: design doc on alternative pointer support)
- From: "Phil Bouchard" <philippe at fornux dot com>
- To: libstdc++ at gcc dot gnu dot org
- Date: Tue, 12 Aug 2008 01:37:17 -0700
- Subject: Re: std::ext STL (was: Re: design doc on alternative pointer support)
- References: <g6ge3q$4hv$1@ger.gmane.org> <12045826.1217359611034.JavaMail.oracle@acsmt301.oracle.com> <g6s37t$8as$1@ger.gmane.org> <15568220.1217500906101.JavaMail.oracle@acsmt305.oracle.com> <g6un58$3dp$1@ger.gmane.org> <31269735.1217585525637.JavaMail.oracle@acsmt301.oracle.com>
"Paolo Carlini" <paolo.carlini@oracle.com> wrote in message
31269735.1217585525637.JavaMail.oracle@acsmt301.oracle.com">news:31269735.1217585525637.JavaMail.oracle@acsmt301.oracle.com...
> Hi,
>
>> In regards to licensing it is queued and on its way.
>
> Great. Remember to keep the libstdc++ maintainers up to date about the
> iter, because FSF does *not* do that automatically.
Ok I've finally signed and mailed the contract back to FSF. They should get
it soon so that means we can study this task more closely and share freely
the code. Once again the primilary patch files can be found at the
following location:
https://svn.boost.org/svn/boost/sandbox/shifted_ptr/bits/
Moreover I have revised my allocator and although the member functions
aren't finalized yet the typedefs are the ones I would like to stick with
given my pointer's special needs to have a pointer to an object of type
shifted<T> as a constructor parameter:
https://svn.boost.org/svn/boost/sandbox/shifted_ptr/boost/shifted_allocator.hpp
Finally we are discussing some new container type that can be added fairly
easily into Libstdc++. It would consist of a container being made of
already existing STL containers altogether. For example:
supercontainer<int, vector, map, list> c;
... would define a container of integers but having direct raw access with
the vector::operator [], O(log n) searching capabilities of a map plus the
ordering of a list. The nodes will have to be adapted and so is
vector::operator [] for remapping indices to actual range of iterators
(because of possible insertion in the middle of consecutive nodes created by
the vector constructor)...
Regards,
-Phil