Re: [boost] [Review] Reminder: Boost.RangeEx review is going on

Subject: Re: [boost] [Review] Reminder: Boost.RangeEx review is going on
From: Steven Watanabe (watanabesj_at_[hidden])
Date: 2009-03-02 10:32:45

AMDG

vicente.botet wrote:
> why do we need two overloading for the non mutating algorithms? I understand the issue for mutatong algorithms, but the parameter is not always const for non mutating ones?
>
> template<class ForwardRange>
> typename range_iterator<ForwardRange>::type
> adjacent_find(ForwardRange& rng);
>
> template<class ForwardRange>
> typename range_iterator<const ForwardRange>::type
> adjacent_find(const ForwardRange& rng);
>   

For the same reason that we have const and non-const overloads
of begin(), end(), operator[], etc.  We may need mutating access
through the result.

In Christ,
Steven Watanabe