diff options
author | Gabriel Scherer <gabriel.scherer@gmail.com> | 2017-02-22 20:26:50 -0500 |
---|---|---|
committer | GitHub <noreply@github.com> | 2017-02-22 20:26:50 -0500 |
commit | a62dd60dee88f33d67c44dde9320658da131f519 (patch) | |
tree | c8b113c99749306d2bc1c37b81e7a5c0ff2a5120 /stdlib/listLabels.mli | |
parent | 12bc55e6ebe182f20698a73af88b19f99a1e4781 (diff) | |
parent | b9dd14cdafa330859db52184e1dbaa9a9bf20013 (diff) | |
download | ocaml-a62dd60dee88f33d67c44dde9320658da131f519.tar.gz |
Merge pull request #1040 from dhekir/trunk
fix several typos in comments
Diffstat (limited to 'stdlib/listLabels.mli')
-rw-r--r-- | stdlib/listLabels.mli | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/stdlib/listLabels.mli b/stdlib/listLabels.mli index 52ded3f957..98fe2a0579 100644 --- a/stdlib/listLabels.mli +++ b/stdlib/listLabels.mli @@ -339,7 +339,7 @@ val merge : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list (** Merge two lists: Assuming that [l1] and [l2] are sorted according to the comparison function [cmp], [merge cmp l1 l2] will return a - sorted list containting all the elements of [l1] and [l2]. + sorted list containing all the elements of [l1] and [l2]. If several elements compare equal, the elements of [l1] will be before the elements of [l2]. Not tail-recursive (sum of the lengths of the arguments). |