This commit is contained in:
Fardale 2023-02-15 02:56:15 +01:00 committed by GitHub
parent 38d6aa4ad1
commit a30e471a6f
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
15 changed files with 23 additions and 25 deletions

View file

@ -17,8 +17,8 @@ type 'a printer = Format.formatter -> 'a -> unit
[@@@ifge 4.8]
include module type of Array
(** @inline
{{: https://caml.inria.fr/pub/docs/manual-ocaml/libref/Array.html} Documentation for the standard Array module}*)
(** {{: https://caml.inria.fr/pub/docs/manual-ocaml/libref/Array.html} Documentation for the standard Array module}
@inline *)
[@@@elifge 4.6]
@ -313,7 +313,7 @@ val sort_generic :
@since 0.14 *)
(** {3 Infix Operators}
It is convenient to {!open CCArray.Infix} to access the infix operators
It is convenient to [open CCArray.Infix] to access the infix operators
without cluttering the scope too much.
@since 2.7 *)

View file

@ -17,8 +17,8 @@ type 'a printer = Format.formatter -> 'a -> unit
[@@@ifge 4.8]
include module type of ArrayLabels with module Floatarray = Array.Floatarray
(** @inline
{{: https://caml.inria.fr/pub/docs/manual-ocaml/libref/Array.html} Documentation for the standard Array module}*)
(** {{: https://caml.inria.fr/pub/docs/manual-ocaml/libref/Array.html} Documentation for the standard Array module}
@inline *)
[@@@elifge 4.6]
@ -327,7 +327,7 @@ val sort_generic :
@since 0.14 *)
(** {3 Infix Operators}
It is convenient to {!open CCArray.Infix} to access the infix operators
It is convenient to [open CCArray.Infix] to access the infix operators
without cluttering the scope too much.
@since 2.7 *)

View file

@ -176,7 +176,7 @@ module type S = sig
[pp_stop] is called at the end, [pp_sep] is called between each elements.
By defaults [pp_start] and [pp_stop] does nothing and [pp_sep] defaults to
(fun out -> Format.fprintf out ",@ ").
Renamed from {!print} since 2.0
Renamed from [print] since 2.0
@since 0.16 *)
end

View file

@ -5,9 +5,8 @@
[@@@ifge 4.08]
include module type of Int
(** @inline
{{: https://caml.inria.fr/pub/docs/manual-ocaml/libref/Int.html} Documentation for the standard Int module}*)
(** {{: https://caml.inria.fr/pub/docs/manual-ocaml/libref/Int.html} Documentation for the standard Int module}
@inline *)
[@@@endif]

View file

@ -13,8 +13,8 @@ type 'a random_gen = Random.State.t -> 'a
[@@@ifge 4.8]
include module type of List with type 'a t := 'a list
(** @inline
{{: https://caml.inria.fr/pub/docs/manual-ocaml/libref/List.html} Documentation for the standard List module}*)
(** {{: https://caml.inria.fr/pub/docs/manual-ocaml/libref/List.html} Documentation for the standard List module}
@inline *)
type +'a t = 'a list
@ -612,7 +612,7 @@ val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t
itself as second argument. *)
val iteri : (int -> 'a -> unit) -> 'a t -> unit
(** [iteri f l] is like {!iter}, but the function [f] is applied to the index of
(** [iteri f l] is like {!val-iter}, but the function [f] is applied to the index of
the element as first argument (counting from 0), and the element
itself as second argument. *)

View file

@ -910,7 +910,7 @@ val of_gen : 'a gen -> 'a t
In the result, elements appear in the same order as they did in the source [gen]. *)
(** {2 Infix Operators}
It is convenient to {!open CCList.Infix} to access the infix operators
It is convenient to [open CCList.Infix] to access the infix operators
without cluttering the scope too much.
@since 0.16 *)

View file

@ -47,7 +47,7 @@ val none : 'a t
val flat_map : ('a -> 'b t) -> 'a t -> 'b t
(** [flat_map f o] is equivalent to {!map} followed by {!flatten}.
Flip version of {!>>=}. *)
Flip version of {!(>>=)}. *)
val bind : 'a t -> ('a -> 'b t) -> 'b t
(** [bind o f] is [f v] if [o] is [Some v], [None] otherwise.

View file

@ -239,7 +239,7 @@ end
val recurse : slice -> 'a t -> 'a t
(** [recurse slice p] parses the [slice]
(most likely obtained via another combinator, such as {!split_1}
or {!split_n}), using [p].
or {!split_list}), using [p].
The slice contains a position which is used to relocate error
messages to their position in the whole input, not just relative to
@ -294,7 +294,7 @@ val chars_fold_transduce :
| `Fail of string ]) ->
'acc ->
('acc * string) t
(** Same as {!char_fold} but with the following differences:
(** Same as {!chars_fold} but with the following differences:
- returns a string along with the accumulator, rather than the slice
of all the characters accepted by [`Continue _].

View file

@ -47,7 +47,7 @@ val cycle : 'a t -> 'a t
val iterate : ('a -> 'a) -> 'a -> 'a t
(** [iterate f a] corresponds to the infinite sequence containing [a], [f a], [f (f a)],
...]
...
@since 3.10 *)
val unfold : ('b -> ('a * 'b) option) -> 'b -> 'a t

View file

@ -1,8 +1,7 @@
[@@@ifge 4.8]
(** Let operators on OCaml >= 4.08.0, nothing otherwise
@since 2.8
@inline *)
@since 2.8 *)
module type LET = sig
type 'a t

View file

@ -388,7 +388,7 @@ module Split : sig
val list_ :
?drop:drop_if_empty -> by:string -> string -> (string * int * int) list
(** [list_ ~drop ~by s] splits the given string [s] along the given separator [by].
Should only be used with very small separators, otherwise use {!Containers_string.KMP}.
Should only be used with very small separators.
@return a [list] of slices [(s,index,length)] that are
separated by [by]. {!String.sub} can then be used to actually extract
a string from the slice.

View file

@ -428,7 +428,7 @@ module Split : sig
string ->
(string * int * int) list
(** [list_ ?drop ~by s] splits the given string [s] along the given separator [by].
Should only be used with very small separators, otherwise use {!Containers_string.KMP}.
Should only be used with very small separators.
@return a [list] of slices [(s,index,length)] that are
separated by [by]. {!String.sub} can then be used to actually extract
a string from the slice.

View file

@ -9,7 +9,7 @@
a new signature.
The size of the bitvector used to be rounded up to the multiple of 30 or 62.
In other words some functions such as {!iter} would iterate on more
In other words some functions such as {!val-iter} would iterate on more
bits than what was originally asked for. This is not the case anymore.
*)

View file

@ -2,7 +2,7 @@
(** {1 Lazy Tree Structure}
This structure can be used to represent trees and directed
graphs (as infinite trees) in a lazy fashion. Like {!CCKList}, it
graphs (as infinite trees) in a lazy fashion. It
is a structural type. *)
type 'a iter = ('a -> unit) -> unit

View file

@ -2,7 +2,7 @@
(** Lazy Tree Structure
This structure can be used to represent trees and directed
graphs (as infinite trees) in a lazy fashion. Like {!CCKList}, it
graphs (as infinite trees) in a lazy fashion. It
is a structural type. *)
type 'a iter = ('a -> unit) -> unit