Re: [Boost-build] Containers for BJamC++

From: Alex Besogonov (cyberax_at_[hidden])
Date: 2006-05-17 11:15:18

Vladimir Prus wrote:
>> 1. A good intrusive single-linked list implementation with refcounted
>> nodes. Currently I'm using boost::shared_ptr<std::list<jam_string> > and
>> its performance is far from stellar.
> I think that Boost.Jam::list.h is pretty good one ;-)
I ended up writing my own implementation. It uses refcounting, custom 
allocation, provides iterators and works a little bit faster than list.h

It even stores one list node directly in the list object, so most 
operations don't require heap allocations at all.

>> 2. A good hash_map implementation. Currently I'm using stdext::hash_map
>> on MSVC and std::map on other compilers. It would be better to have
>> in-tree hash_map implementation.
> I think that Boost.Jam::hash.h is pretty good one ;-)
Not really, it's not very fast and doesn't support 
constructors/destructors. I'm going to try Google's hashtable - it is 
BSD-licensed and seems to be good enough.

> I'd really want to keep dependencies to the minimum.
We can just include them into BJamC++ source tree.

-- 
With respect,
             Alex Besogonov (cyberax_at_[hidden])