Subject: Re: [boost] [btree] Status report
From: Matias Capeletto (matias.capeletto_at_[hidden])
Date: 2011-05-21 06:28:13
On Thu, May 19, 2011 at 7:25 PM, Beman Dawes <bdawes_at_[hidden]> wrote:
> But I had not cosidered the impact on algorithms that expect the
> "first" and "second" names, that further complicates the decision.
If it is possible, I think it is a good idea to at least offer the
standard "first" and "second" names as an alternative option.
> On Thu, May 19, 2011 at 5:49 AM, Thorsten Ottosen
> <thorsten.ottosen_at_[hidden]> wrote:
>> Boost.Bimap does something similar. Would it not be possible to do something
>> similar, even though the value is fetched lazily?
> I'll look at Bimap. Thanks for the pointer.
I leave you here a direct pointer to the rationale for Boost.Bimap
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk