# HG changeset patch # User Matthias Görgens # Date 1268698896 0 # Node ID 795ac4c3776bc0716c54e5c382c79a22bf7ede6b # Parent 2162dfc5d1123b55848bf9431814d64de8332275 Just sanitizing indentation in stdext/listext.mli diff -r 2162dfc5d112 -r 795ac4c3776b stdext/listext.mli --- a/stdext/listext.mli +++ b/stdext/listext.mli @@ -148,22 +148,22 @@ (('a -> 'b -> 'c -> 'd) -> 'e -> 'f -> 'g -> 'h) -> 'e -> ('b -> 'c -> 'i) -> 'f -> 'g -> ('a -> 'i -> 'd) -> 'h - (** Applies a function f that generates optional values, to each - of the items in a list A [a1; ...; am], generating a new list - of non-optional values B [b1; ...; bn], with m >= n. For each - value a in list A, list B contains a corresponding value b if - and only if the application of (f a) results in Some b. *) - val filter_map : ('a -> 'b option) -> 'a list -> 'b list - - (** Returns true if and only if the given list is in sorted order - according to the given comparison function. *) - val is_sorted : ('a -> 'a -> int) -> 'a list -> bool - - (** Returns the intersection of two lists. *) - val intersect : 'a list -> 'a list -> 'a list - - (** Returns the set difference of two lists *) - val set_difference : 'a list -> 'a list -> 'a list + (** Applies a function f that generates optional values, to each + of the items in a list A [a1; ...; am], generating a new list + of non-optional values B [b1; ...; bn], with m >= n. For each + value a in list A, list B contains a corresponding value b if + and only if the application of (f a) results in Some b. *) + val filter_map : ('a -> 'b option) -> 'a list -> 'b list + + (** Returns true if and only if the given list is in sorted order + according to the given comparison function. *) + val is_sorted : ('a -> 'a -> int) -> 'a list -> bool + + (** Returns the intersection of two lists. *) + val intersect : 'a list -> 'a list -> 'a list + + (** Returns the set difference of two lists *) + val set_difference : 'a list -> 'a list -> 'a list (** Act as List.assoc, but return the given default value if the key is not in the list. *)