From: Beman Dawes (bdawes_at_[hidden])
Date: 2003-10-23 13:36:02
At 12:51 PM 10/23/2003, David Abrahams wrote:
>Beman Dawes <bdawes_at_[hidden]> writes:
>> What is the fix? There really needs to be some convenient way to do a
>> find_first on a const container. Provide a version that takes begin
>> and end iterators? Or is that already done by one of the algorithms in
>> detail that you are going to move into boost::algorithm::string?
>I'm not sure a fix is needed. The first variant will already match
>const containers, as long as they're not temporaries.
> template <class T>
> int f(T& x);
> int const x;
> int y = f(x); // T deduced as const int.
I guess the original problem was a non-problem.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk