Browse thread
Sorted list
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2007-08-04 (14:45) |
From: | skaller <skaller@u...> |
Subject: | Re: [Caml-list] Sorted list |
On Sat, 2007-08-04 at 16:01 +0200, Philippe Wang wrote: > skaller wrote: > > > >> It works ! ... Or did I miss something ? > >> > > > > Yes. Read the manual: the ordered type mandates a total order. > > > > Just because the Ocaml type system is too weak too represent this > > constraint does not remove your obligation to meet it. > > > > Whether or not it happens to work with the current implementation > > isn't relevant. > > > > > > Ok... > Still, using the current implementation (even if it means making a > copy!) should be an efficient solution! You don't know it works, just because 3 lines of tests worked. -- John Skaller <skaller at users dot sf dot net> Felix, successor to C++: http://felix.sf.net