From ef3d334d4a207ad31d9c7f74f4cc3d5259047e49 Mon Sep 17 00:00:00 2001 From: Maxence Guesdon Date: Mon, 3 Dec 2001 22:16:03 +0000 Subject: commentaires après MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit git-svn-id: http://caml.inria.fr/svn/ocaml/trunk@4083 f963ae5c-01c2-4b8c-9fe0-0dff7051ff02 --- stdlib/sort.mli | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'stdlib/sort.mli') diff --git a/stdlib/sort.mli b/stdlib/sort.mli index 073e1f1a7..43373b5fa 100644 --- a/stdlib/sort.mli +++ b/stdlib/sort.mli @@ -20,22 +20,22 @@ The new functions are faster and use less memory. *) +val list : ('a -> 'a -> bool) -> 'a list -> 'a list (** Sort a list in increasing order according to an ordering predicate. The predicate should return [true] if its first argument is less than or equal to its second argument. *) -val list : ('a -> 'a -> bool) -> 'a list -> 'a list +val array : ('a -> 'a -> bool) -> 'a array -> unit (** Sort an array in increasing order according to an ordering predicate. The predicate should return [true] if its first argument is less than or equal to its second argument. The array is sorted in place. *) -val array : ('a -> 'a -> bool) -> 'a array -> unit +val merge : ('a -> 'a -> bool) -> 'a list -> 'a list -> 'a list (** Merge two lists according to the given predicate. Assuming the two argument lists are sorted according to the predicate, [merge] returns a sorted list containing the elements from the two lists. The behavior is undefined if the two argument lists were not sorted. *) -val merge : ('a -> 'a -> bool) -> 'a list -> 'a list -> 'a list -- cgit v1.2.3-70-g09d2