mAsterdam wrote:
> VC wrote:
>> mAsterdam wrote:
[snip]
>>> merge_in_its_own_right merges a list of lists into a list. It
>>>
>>> - should not have assumptions about an
>>> intrinsic order of the listed values.
>>> - should preserve the order of the values
>>> and fail if it can't.
>> According to you specification the function should fail otherwise the
>> function will behave as an ordinary (in the ML/Haskell sense) merge :
>> 'if ordering(L1) == ordering(L2) merge otherwise fail'
>
> Yep.
On second thought I'm not sure.
Does 'ordering(L1) == ordering(L2)' in the ML/Haskell sense hold for
L1 = [a, b, a, c]
L2 = [a, a, c]
?
Received on Sat Sep 03 2005 - 09:19:06 CDT
