[C++-sig] Re: indexing_v2 status update

[Raoul Gough]

David Abrahams <dave at boost-consulting.com> writes:

> Raoul Gough <RaoulGough at yahoo.co.uk> writes:
>
>>> If zero one and two all work, then N works by induction.  But anyway...
>>
>> Are we talking about a mathematical proof or testing strategy here :-)
>> You would have to prove that for all i, correct(i) implies
>> correct(i+1) and then go on to prove e.g. correct(0). Proving general
>> things about code is hard though, so the i -> i+1 implication would be
>> difficult. In this case, restricting the testing to 0 and 1 element
>> sets completely ignores potential problems with ordering of elements.
>>
>> e.g. is set<a,b> == set<b,a> ???
>
> I wasn't really serious ;->

I should have known, even without a smiley!

-- 
Raoul Gough.
export LESS='-X'