diff options
| author | John Whitington <john@coherentgraphics.co.uk> | 2020-09-11 18:10:12 +0100 |
|---|---|---|
| committer | John Whitington <john@coherentgraphics.co.uk> | 2020-09-11 18:10:12 +0100 |
| commit | bcc16f692ba445c22eaef9deed6f12504d77e939 (patch) | |
| tree | df492eeae7f873c9c9c26afda65560a859859663 /stdlib | |
| parent | a866c6d07f6501dbe9aea7ecf19cd928f6041b8a (diff) | |
| download | ocaml-bcc16f692ba445c22eaef9deed6f12504d77e939.tar.gz | |
Fix two little errors
Diffstat (limited to 'stdlib')
| -rw-r--r-- | stdlib/array.mli | 6 | ||||
| -rw-r--r-- | stdlib/arrayLabels.mli | 6 | ||||
| -rw-r--r-- | stdlib/list.mli | 2 | ||||
| -rw-r--r-- | stdlib/listLabels.mli | 2 |
4 files changed, 8 insertions, 8 deletions
diff --git a/stdlib/array.mli b/stdlib/array.mli index 7ea40feec5..3a828ac0b3 100644 --- a/stdlib/array.mli +++ b/stdlib/array.mli @@ -283,9 +283,9 @@ val stable_sort : ('a -> 'a -> int) -> 'a array -> unit elements that compare equal are kept in their original order) and not guaranteed to run in constant heap space. - The current implementation uses Merge Sort. It uses [n/2] - words of heap space, where [n] is the length of the array. - It is usually faster than the current implementation of {!sort}. + The current implementation uses Merge Sort. It uses a temporary array of + length [n/2], where [n] is the length of the array. It is usually faster + than the current implementation of {!sort}. *) val fast_sort : ('a -> 'a -> int) -> 'a array -> unit diff --git a/stdlib/arrayLabels.mli b/stdlib/arrayLabels.mli index 96517c517d..b30d0c05b5 100644 --- a/stdlib/arrayLabels.mli +++ b/stdlib/arrayLabels.mli @@ -283,9 +283,9 @@ val stable_sort : cmp:('a -> 'a -> int) -> 'a array -> unit elements that compare equal are kept in their original order) and not guaranteed to run in constant heap space. - The current implementation uses Merge Sort. It uses [n/2] - words of heap space, where [n] is the length of the array. - It is usually faster than the current implementation of {!sort}. + The current implementation uses Merge Sort. It uses a temporary array of + length [n/2], where [n] is the length of the array. It is usually faster + than the current implementation of {!sort}. *) val fast_sort : cmp:('a -> 'a -> int) -> 'a array -> unit diff --git a/stdlib/list.mli b/stdlib/list.mli index 5f5ca0c499..a669ca48fd 100644 --- a/stdlib/list.mli +++ b/stdlib/list.mli @@ -388,7 +388,7 @@ val assoc : 'a -> ('a * 'b) list -> 'b val assoc_opt : 'a -> ('a * 'b) list -> 'b option (** [assoc_opt a l] returns the value associated with key [a] in the list of pairs [l]. That is, - [assoc a [ ...; (a,b); ...] = b] + [assoc a [ ...; (a,b); ...] = Some b] if [(a,b)] is the leftmost binding of [a] in list [l]. Returns [None] if there is no value associated with [a] in the list [l]. diff --git a/stdlib/listLabels.mli b/stdlib/listLabels.mli index 6d0a0564eb..bc72faed0d 100644 --- a/stdlib/listLabels.mli +++ b/stdlib/listLabels.mli @@ -388,7 +388,7 @@ val assoc : 'a -> ('a * 'b) list -> 'b val assoc_opt : 'a -> ('a * 'b) list -> 'b option (** [assoc_opt a l] returns the value associated with key [a] in the list of pairs [l]. That is, - [assoc a [ ...; (a,b); ...] = b] + [assoc a [ ...; (a,b); ...] = Some b] if [(a,b)] is the leftmost binding of [a] in list [l]. Returns [None] if there is no value associated with [a] in the list [l]. |