Subject: Re: [boost] [btree] Status report
From: Thorsten Ottosen (thorsten.ottosen_at_[hidden])
Date: 2011-05-19 05:49:30
Den 18-05-2011 20:54, Beman Dawes skrev:
> The slides for my BoostCon "Proposed Boost B-tree Library"
> presentation are available:
A comment more. In
for (map_type::iterator it = bt_map.begin();
it != bt_map.end(); ++it)
cout << " " << it->key() << " --> "
<< it->mapped_value() << '\n';
I got lot of negative feedback when I was not interface compatible with
existing containers in Boost.PtrContainer. Thus, we made the syntax
i->first and i->second availble without using std::pair so at least
generic algorithms would work.
Boost.Bimap does something similar. Would it not be possible to do
something similar, even though the value is fetched lazily?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk