From 9259c841f51a42dd50f4736ddeb8e85f808d1bcf Mon Sep 17 00:00:00 2001 From: Simon Cruanes Date: Sun, 11 Feb 2018 10:02:48 -0600 Subject: [PATCH] update doc for 2.0 --- 2.0/containers.data/index.html | 2 +- 2.0/containers.iter/index.html | 2 +- 2.0/containers.monomorphic/index.html | 2 +- 2.0/containers.sexp/index.html | 2 +- 2.0/containers.thread/index.html | 2 +- 2.0/containers.top/index.html | 2 +- 2.0/containers.unix/index.html | 2 +- 2.0/containers/CCArray/index.html | 4 +++- 2.0/containers/CCFormat/index.html | 3 ++- 2.0/containers/CCHashtbl/Poly/index.html | 3 ++- 2.0/containers/CCHashtbl/index.html | 3 ++- 2.0/containers/CCHashtbl/module-type-S/index.html | 3 ++- 2.0/containers/CCHeap/Make/index.html | 2 +- 2.0/containers/CCHeap/module-type-S/index.html | 2 +- 2.0/containers/CCList/index.html | 9 ++++++--- 2.0/containers/CCListLabels/index.html | 2 +- 2.0/containers/CCVector/index.html | 2 +- 2.0/containers/Containers/Hashtbl/index.html | 3 ++- .../Containers/Hashtbl/module-type-S'/index.html | 3 ++- 2.0/containers/Containers/index.html | 2 +- 2.0/containers/index.html | 2 +- 21 files changed, 34 insertions(+), 23 deletions(-) diff --git a/2.0/containers.data/index.html b/2.0/containers.data/index.html index 107e18ff..77fc693d 100644 --- a/2.0/containers.data/index.html +++ b/2.0/containers.data/index.html @@ -1,3 +1,3 @@ -containers_data-generated (containers.data.containers_data-generated)

Library containers.data

+index (containers.data.index)

Library containers.data

This library exposes the following toplevel modules:

CCBV
CCBitField
CCCache
CCDeque
CCFQueue
CCGraph
CCHashSet
CCHashTrie
CCHet
CCImmutArray
CCIntMap
CCMixmap
CCMixset
CCMixtbl
CCMultiMap
CCMultiSet
CCPersistentArray
CCPersistentHashtbl
CCRAL
CCRingBuffer
CCSimple_queue
CCTrie
CCWBTree
CCZipper

.

\ No newline at end of file diff --git a/2.0/containers.iter/index.html b/2.0/containers.iter/index.html index 518390cf..408b61d4 100644 --- a/2.0/containers.iter/index.html +++ b/2.0/containers.iter/index.html @@ -1,3 +1,3 @@ -containers_iter-generated (containers.iter.containers_iter-generated)

Library containers.iter

+index (containers.iter.index)

Library containers.iter

This library exposes the following toplevel modules:

CCKList
CCKTree
CCLazy_list

.

\ No newline at end of file diff --git a/2.0/containers.monomorphic/index.html b/2.0/containers.monomorphic/index.html index 191d4a32..480fc0cd 100644 --- a/2.0/containers.monomorphic/index.html +++ b/2.0/containers.monomorphic/index.html @@ -1,3 +1,3 @@ -containers_monomorphic-generated (containers.monomorphic.containers_monomorphic-generated)

Library containers.monomorphic

+index (containers.monomorphic.index)

Library containers.monomorphic

This library exposes the following toplevel modules:

CCMonomorphic

.

\ No newline at end of file diff --git a/2.0/containers.sexp/index.html b/2.0/containers.sexp/index.html index 844363e6..3076792c 100644 --- a/2.0/containers.sexp/index.html +++ b/2.0/containers.sexp/index.html @@ -1,3 +1,3 @@ -containers_sexp-generated (containers.sexp.containers_sexp-generated)

Library containers.sexp

+index (containers.sexp.index)

Library containers.sexp

This library exposes the following toplevel modules:

CCSexp
CCSexp_lex

.

\ No newline at end of file diff --git a/2.0/containers.thread/index.html b/2.0/containers.thread/index.html index 0ee900b0..3519f5f4 100644 --- a/2.0/containers.thread/index.html +++ b/2.0/containers.thread/index.html @@ -1,3 +1,3 @@ -containers_thread-generated (containers.thread.containers_thread-generated)

Library containers.thread

+index (containers.thread.index)

Library containers.thread

This library exposes the following toplevel modules:

CCBlockingQueue
CCLock
CCPool
CCSemaphore
CCThread
CCTimer

.

\ No newline at end of file diff --git a/2.0/containers.top/index.html b/2.0/containers.top/index.html index 8db20a51..64b90375 100644 --- a/2.0/containers.top/index.html +++ b/2.0/containers.top/index.html @@ -1,3 +1,3 @@ -containers_top-generated (containers.top.containers_top-generated)

Library containers.top

+index (containers.top.index)

Library containers.top

This library exposes the following toplevel modules:

Containers_top

.

\ No newline at end of file diff --git a/2.0/containers.unix/index.html b/2.0/containers.unix/index.html index b1620616..39b33277 100644 --- a/2.0/containers.unix/index.html +++ b/2.0/containers.unix/index.html @@ -1,3 +1,3 @@ -containers_unix-generated (containers.unix.containers_unix-generated)

Library containers.unix

+index (containers.unix.index)

Library containers.unix

This library exposes the following toplevel modules:

CCUnix

.

\ No newline at end of file diff --git a/2.0/containers/CCArray/index.html b/2.0/containers/CCArray/index.html index 761208dc..88204ce2 100644 --- a/2.0/containers/CCArray/index.html +++ b/2.0/containers/CCArray/index.html @@ -42,7 +42,9 @@ satisfy the predicate p. That is, it returns Allow different types.
  • Since: 0.20
    • val exists : ('a ‑> bool) ‑> 'a t ‑> bool

    exists p [|a1; ...; an|] checks if at least one element of the array satisfies the predicate p. That is, it returns (p a1) || (p a2) || ... || (p an).

    val exists2 : ('a ‑> 'b ‑> bool) ‑> 'a t ‑> 'b t ‑> bool

    Exists on pairs of arrays.

    • Raises Invalid_argument: if they have distinct lengths. -Allow different types.
    • Since: 0.20
    val fold2 : ('acc ‑> 'a ‑> 'b ‑> 'acc) ‑> 'acc ‑> 'a t ‑> 'b t ‑> 'acc

    Fold on two arrays stepwise.

    • Raises Invalid_argument: if they have distinct lengths.
    • Since: 0.20
    val iter2 : ('a ‑> 'b ‑> unit) ‑> 'a t ‑> 'b t ‑> unit

    Iterate on two arrays stepwise.

    • Raises Invalid_argument: if they have distinct lengths.
    • Since: 0.20
    val shuffle : 'a t ‑> unit

    Shuffle randomly the array, in place.

    val shuffle_with : Random.State.t ‑> 'a t ‑> unit

    Like shuffle but using a specialized random state.

    val random_choose : 'a t ‑> 'a random_gen

    Choose an element randomly.

    • Raises Not_found: if the array/slice is empty.
    val to_seq : 'a t ‑> 'a sequence

    Return a sequence of the elements of an array.

    val to_gen : 'a t ‑> 'a gen

    Return a gen of the elements of an array.

    val to_klist : 'a t ‑> 'a klist

    Return a klist of the elements of an array.

    IO

    val pp : ?⁠sep:string ‑> 'a printer ‑> 'a t printer

    Print an array of items with printing function.

    val pp_i : ?⁠sep:string ‑> (int ‑> 'a printer) ‑> 'a t printer

    Print an array, giving the printing function both index and item.

    val map : ('a ‑> 'b) ‑> 'a t ‑> 'b t

    map f a applies function f to all the elements of a, +Allow different types.

  • Since: 0.20
    • val fold2 : ('acc ‑> 'a ‑> 'b ‑> 'acc) ‑> 'acc ‑> 'a t ‑> 'b t ‑> 'acc

    Fold on two arrays stepwise.

    • Raises Invalid_argument: if they have distinct lengths.
    • Since: 0.20
    val iter2 : ('a ‑> 'b ‑> unit) ‑> 'a t ‑> 'b t ‑> unit

    Iterate on two arrays stepwise.

    • Raises Invalid_argument: if they have distinct lengths.
    • Since: 0.20
    val shuffle : 'a t ‑> unit

    Shuffle randomly the array, in place.

    val shuffle_with : Random.State.t ‑> 'a t ‑> unit

    Like shuffle but using a specialized random state.

    val random_choose : 'a t ‑> 'a random_gen

    Choose an element randomly.

    • Raises Not_found: if the array/slice is empty.
    val to_seq : 'a t ‑> 'a sequence

    Return a sequence of the elements of an array. +The input array is shared with the sequence and modifications of it will result +in modification of the sequence.

    val to_gen : 'a t ‑> 'a gen

    Return a gen of the elements of an array.

    val to_klist : 'a t ‑> 'a klist

    Return a klist of the elements of an array.

    IO

    val pp : ?⁠sep:string ‑> 'a printer ‑> 'a t printer

    Print an array of items with printing function.

    val pp_i : ?⁠sep:string ‑> (int ‑> 'a printer) ‑> 'a t printer

    Print an array, giving the printing function both index and item.

    val map : ('a ‑> 'b) ‑> 'a t ‑> 'b t

    map f a applies function f to all the elements of a, and builds an array with the results returned by f: [| f a.(0); f a.(1); ...; f a.(length a - 1) |].

    val map2 : ('a ‑> 'b ‑> 'c) ‑> 'a t ‑> 'b t ‑> 'c t

    map2 f a b applies function f to all the elements of a and b, and builds an array with the results returned by f: diff --git a/2.0/containers/CCFormat/index.html b/2.0/containers/CCFormat/index.html index 27df39d4..44686013 100644 --- a/2.0/containers/CCFormat/index.html +++ b/2.0/containers/CCFormat/index.html @@ -11,7 +11,8 @@ and returns a printer actionable by (). Examples:

    • return ",@ "
    • return "@{<Red>and then@}@,"
    • return "@[<v>a@ b@]"
    • Since: 1.0
    val of_to_string : ('a ‑> string) ‑> 'a printer

    of_to_string f converts its input to a string using f, then prints the string.

    • Since: 1.0
    val const : 'a printer ‑> 'a ‑> unit printer

    const pp x is a unit printer that uses pp on x.

    • Since: 1.0
    val some : 'a printer ‑> 'a option printer

    some pp will print options as follows: -

    • Some x is printed using pp on x.
    • None is not printed at all.
    • Since: 1.0

    ANSI codes

    Use ANSI escape codes https://en.wikipedia.org/wiki/ANSI_escape_code +

    val lazy_force : 'a printer ‑> 'a lazy_t printer

    lazy_force pp out x forces x and prints the result with pp

    • Since: 2.0
    val lazy_or : ?⁠default:unit printer ‑> 'a printer ‑> 'a lazy_t printer

    lazy_or ?default pp out x prints default if x is not +evaluated yet, or uses pp otherwise

    • Since: 2.0

    ANSI codes

    Use ANSI escape codes https://en.wikipedia.org/wiki/ANSI_escape_code to put some colors on the terminal.

    This uses tags in format strings to specify the style. Current styles are the following:

    Example:

          set_color_default true;;
 
diff --git a/2.0/containers/CCHashtbl/Poly/index.html b/2.0/containers/CCHashtbl/Poly/index.html
index c1fce9a1..63966013 100644
--- a/2.0/containers/CCHashtbl/Poly/index.html
+++ b/2.0/containers/CCHashtbl/Poly/index.html
@@ -1,6 +1,7 @@
 
 Poly (containers.CCHashtbl.Poly)
    Module CCHashtbl.Poly
    val get : ('a, 'b) Hashtbl.t ‑> 'a ‑> 'b option
    Safe version of Hashtbl.find.
    val get_or : ('a, 'b) Hashtbl.t ‑> 'a ‑> default:'b ‑> 'b
    get_or tbl k ~default returns the value associated to k if present,
-and returns default otherwise (if k doesn't belong in tbl).
    • Since: 0.16
    val keys : ('a, 'b) Hashtbl.t ‑> 'a sequence
    Iterate on keys (similar order as Hashtbl.iter).
    val values : ('a, 'b) Hashtbl.t ‑> 'b sequence
    Iterate on values in the table.
    val keys_list : ('a, 'b) Hashtbl.t ‑> 'a list
    keys_list t is the list of keys in t.
    • Since: 0.8
    val values_list : ('a, 'b) Hashtbl.t ‑> 'b list
    values_list t is the list of values in t.
    • Since: 0.8
    val map_list : ('a ‑> 'b ‑> 'c) ‑> ('a, 'b) Hashtbl.t ‑> 'c list
    Map on a hashtable's items, collect into a list.
    val incr : ?⁠by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unit
    incr ?by tbl x increments or initializes the counter associated with x.
+and returns default otherwise (if k doesn't belong in tbl).
    • Since: 0.16
    val keys : ('a, 'b) Hashtbl.t ‑> 'a sequence
    Iterate on keys (similar order as Hashtbl.iter).
    val values : ('a, 'b) Hashtbl.t ‑> 'b sequence
    Iterate on values in the table.
    val keys_list : ('a, 'b) Hashtbl.t ‑> 'a list
    keys_list t is the list of keys in t.
+If the key is in the Hashtable multiple times, all occurrences will be returned.
    • Since: 0.8
    val values_list : ('a, 'b) Hashtbl.t ‑> 'b list
    values_list t is the list of values in t.
    • Since: 0.8
    val map_list : ('a ‑> 'b ‑> 'c) ‑> ('a, 'b) Hashtbl.t ‑> 'c list
    Map on a hashtable's items, collect into a list.
    val incr : ?⁠by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unit
    incr ?by tbl x increments or initializes the counter associated with x.
 If get tbl x = None, then after update, get tbl x = Some 1;
 otherwise, if get tbl x = Some n, now get tbl x = Some (n+1).
    • Parameter by: if specified, the int value is incremented by by rather than 1.
    • Since: 0.16
    val decr : ?⁠by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unit
    Like incr but subtract 1 (or the value of by).
 If the value reaches 0, the key is removed from the table.
diff --git a/2.0/containers/CCHashtbl/index.html b/2.0/containers/CCHashtbl/index.html
index 5b202b9f..5b086362 100644
--- a/2.0/containers/CCHashtbl/index.html
+++ b/2.0/containers/CCHashtbl/index.html
@@ -1,6 +1,7 @@
 
 CCHashtbl (containers.CCHashtbl)
    Module CCHashtbl
    Extension to the standard Hashtbl
    • Since: 0.4
    type 'a sequence = ('a ‑> unit) ‑> unit
    type 'a eq = 'a ‑> 'a ‑> bool
    type 'a hash = 'a ‑> int
    type 'a printer = Format.formatter ‑> 'a ‑> unit
    Polymorphic tables
    This sub-module contains the extension of the standard polymorphic Hashtbl.
    module Poly : sig ... end
    include module type of Poly
    val get : ('a, 'b) Hashtbl.t ‑> 'a ‑> 'b option
    Safe version of Hashtbl.find.
    val get_or : ('a, 'b) Hashtbl.t ‑> 'a ‑> default:'b ‑> 'b
    get_or tbl k ~default returns the value associated to k if present,
-and returns default otherwise (if k doesn't belong in tbl).
    • Since: 0.16
    val keys : ('a, 'b) Hashtbl.t ‑> 'a sequence
    Iterate on keys (similar order as Hashtbl.iter).
    val values : ('a, 'b) Hashtbl.t ‑> 'b sequence
    Iterate on values in the table.
    val keys_list : ('a, 'b) Hashtbl.t ‑> 'a list
    keys_list t is the list of keys in t.
    • Since: 0.8
    val values_list : ('a, 'b) Hashtbl.t ‑> 'b list
    values_list t is the list of values in t.
    • Since: 0.8
    val map_list : ('a ‑> 'b ‑> 'c) ‑> ('a, 'b) Hashtbl.t ‑> 'c list
    Map on a hashtable's items, collect into a list.
    val incr : ?⁠by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unit
    incr ?by tbl x increments or initializes the counter associated with x.
+and returns default otherwise (if k doesn't belong in tbl).
    • Since: 0.16
    val keys : ('a, 'b) Hashtbl.t ‑> 'a sequence
    Iterate on keys (similar order as Hashtbl.iter).
    val values : ('a, 'b) Hashtbl.t ‑> 'b sequence
    Iterate on values in the table.
    val keys_list : ('a, 'b) Hashtbl.t ‑> 'a list
    keys_list t is the list of keys in t.
+If the key is in the Hashtable multiple times, all occurrences will be returned.
    • Since: 0.8
    val values_list : ('a, 'b) Hashtbl.t ‑> 'b list
    values_list t is the list of values in t.
    • Since: 0.8
    val map_list : ('a ‑> 'b ‑> 'c) ‑> ('a, 'b) Hashtbl.t ‑> 'c list
    Map on a hashtable's items, collect into a list.
    val incr : ?⁠by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unit
    incr ?by tbl x increments or initializes the counter associated with x.
 If get tbl x = None, then after update, get tbl x = Some 1;
 otherwise, if get tbl x = Some n, now get tbl x = Some (n+1).
    • Parameter by: if specified, the int value is incremented by by rather than 1.
    • Since: 0.16
    val decr : ?⁠by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unit
    Like incr but subtract 1 (or the value of by).
 If the value reaches 0, the key is removed from the table.
diff --git a/2.0/containers/CCHashtbl/module-type-S/index.html b/2.0/containers/CCHashtbl/module-type-S/index.html
index d5ee11c4..ab79cccf 100644
--- a/2.0/containers/CCHashtbl/module-type-S/index.html
+++ b/2.0/containers/CCHashtbl/module-type-S/index.html
@@ -5,7 +5,8 @@ not bound, it becomes bound to y.
      get tbl x = None, then after update, get tbl x = Some 1;
 otherwise, if get tbl x = Some n, now get tbl x = Some (n+1).
      • Parameter by: if specified, the int value is incremented by by rather than 1.
      • Since: 0.16
    val decr : ?⁠by:int ‑> int t ‑> key ‑> unit
    Like incr but subtract 1 (or the value of by).
 If the value reaches 0, the key is removed from the table.
-This does nothing if the key is not already present in the table.
    • Since: 0.16
    val keys : 'a t ‑> key sequence
    Iterate on keys (similar order as Hashtbl.iter).
    val values : 'a t ‑> 'a sequence
    Iterate on values in the table.
    val keys_list : _ t ‑> key list
    keys_list t is the list of keys in t.
    • Since: 0.8
    val values_list : 'a t ‑> 'a list
    values_list t is the list of values in t.
    • Since: 0.8
    val map_list : (key ‑> 'a ‑> 'b) ‑> 'a t ‑> 'b list
    Map on a hashtable's items, collect into a list.
    val to_seq : 'a t ‑> (key * 'a) sequence
    Iterate on values in the table.
    val of_seq : (key * 'a) sequence ‑> 'a t
    From the given bindings, added in order.
    val add_seq : 'a t ‑> (key * 'a) sequence ‑> unit
    Add the corresponding pairs to the table, using Hashtbl.add.
    • Since: 0.16
    val add_seq_count : int t ‑> key sequence ‑> unit
    add_seq_count tbl seq increments the count of each element of seq
+This does nothing if the key is not already present in the table.
    • Since: 0.16
    val keys : 'a t ‑> key sequence
    Iterate on keys (similar order as Hashtbl.iter).
    val values : 'a t ‑> 'a sequence
    Iterate on values in the table.
    val keys_list : _ t ‑> key list
    keys_list t is the list of keys in t.
+If the key is in the Hashtable multiple times, all occurrences will be returned.
    • Since: 0.8
    val values_list : 'a t ‑> 'a list
    values_list t is the list of values in t.
    • Since: 0.8
    val map_list : (key ‑> 'a ‑> 'b) ‑> 'a t ‑> 'b list
    Map on a hashtable's items, collect into a list.
    val to_seq : 'a t ‑> (key * 'a) sequence
    Iterate on values in the table.
    val of_seq : (key * 'a) sequence ‑> 'a t
    From the given bindings, added in order.
    val add_seq : 'a t ‑> (key * 'a) sequence ‑> unit
    Add the corresponding pairs to the table, using Hashtbl.add.
    • Since: 0.16
    val add_seq_count : int t ‑> key sequence ‑> unit
    add_seq_count tbl seq increments the count of each element of seq
 by calling incr. This is useful for counting how many times each
 element of seq occurs.
    • Since: 0.16
    val of_seq_count : key sequence ‑> int t
    Similar to add_seq_count, but allocates a new table and returns it.
    • Since: 0.16
    val to_list : 'a t ‑> (key * 'a) list
    List of bindings (order unspecified).
    val of_list : (key * 'a) list ‑> 'a t
    Build a table from the given list of bindings k_i -> v_i,
 added in order using add. If a key occurs several times,
diff --git a/2.0/containers/CCHeap/Make/index.html b/2.0/containers/CCHeap/Make/index.html
index 38b7cc68..f38e9a04 100644
--- a/2.0/containers/CCHeap/Make/index.html
+++ b/2.0/containers/CCHeap/Make/index.html
@@ -8,4 +8,4 @@ If h do not contain x then i
 If h do not contain x then it return h.
 The difference with filter is that delete_all stops as soon as
 it enters a subtree whose root is bigger than the element.
    • Since: 2.0
    val iter : (elt ‑> unit) ‑> t ‑> unit
    Iterate on elements.
    val fold : ('a ‑> elt ‑> 'a) ‑> 'a ‑> t ‑> 'a
    Fold on all values.
    val size : t ‑> int
    Number of elements (linear complexity).
    val to_list : t ‑> elt list
    Return the elements of the heap, in no particular order.
    val to_list_sorted : t ‑> elt list
    Return the elements in increasing order.
    • Since: 1.1
    val add_list : t ‑> elt list ‑> t
    Add the elements of the list to the heap. An element occurring several
-times will be added that many times to the heap.
    • Since: 0.16
    val of_list : elt list ‑> t
    of_list l is add_list empty l.
    val add_seq : t ‑> elt sequence ‑> t
    • Since: 0.16
    val of_seq : elt sequence ‑> t
    Build a heap from a given sequence.
    val to_seq : t ‑> elt sequence
    Return a sequence of the elements of the heap.
    val to_seq_sorted : t ‑> elt sequence
    Iterate on the elements, in increasing order.
    • Since: 1.1
    val add_klist : t ‑> elt klist ‑> t
    • Since: 0.16
    val of_klist : elt klist ‑> t
    Build a heap from a given klist.
    val to_klist : t ‑> elt klist
    Return a klist of the elements of the heap.
    val add_gen : t ‑> elt gen ‑> t
    • Since: 0.16
    val of_gen : elt gen ‑> t
    Build a heap from a given gen.
    val to_gen : t ‑> elt gen
    Return a gen of the elements of the heap.
    val to_tree : t ‑> elt ktree
    Return a ktree of the elements of the heap.
    val pp : ?⁠sep:string ‑> elt printer ‑> t printer
    
\ No newline at end of file
+times will be added that many times to the heap.
    • Since: 0.16
    val of_list : elt list ‑> t
    of_list l is add_list empty l. Complexity: O(n log n).
    val add_seq : t ‑> elt sequence ‑> t
    • Since: 0.16
    val of_seq : elt sequence ‑> t
    Build a heap from a given sequence. Complexity: O(n log n).
    val to_seq : t ‑> elt sequence
    Return a sequence of the elements of the heap.
    val to_seq_sorted : t ‑> elt sequence
    Iterate on the elements, in increasing order.
    • Since: 1.1
    val add_klist : t ‑> elt klist ‑> t
    • Since: 0.16
    val of_klist : elt klist ‑> t
    Build a heap from a given klist. Complexity: O(n log n).
    val to_klist : t ‑> elt klist
    Return a klist of the elements of the heap.
    val add_gen : t ‑> elt gen ‑> t
    • Since: 0.16
    val of_gen : elt gen ‑> t
    Build a heap from a given gen. Complexity: O(n log n).
    val to_gen : t ‑> elt gen
    Return a gen of the elements of the heap.
    val to_tree : t ‑> elt ktree
    Return a ktree of the elements of the heap.
    val pp : ?⁠sep:string ‑> elt printer ‑> t printer
    
\ No newline at end of file
diff --git a/2.0/containers/CCHeap/module-type-S/index.html b/2.0/containers/CCHeap/module-type-S/index.html
index 4e53df7c..a93b85ab 100644
--- a/2.0/containers/CCHeap/module-type-S/index.html
+++ b/2.0/containers/CCHeap/module-type-S/index.html
@@ -8,4 +8,4 @@ If h do not contain x then i
 If h do not contain x then it return h.
 The difference with filter is that delete_all stops as soon as
 it enters a subtree whose root is bigger than the element.
    • Since: 2.0
    val iter : (elt ‑> unit) ‑> t ‑> unit
    Iterate on elements.
    val fold : ('a ‑> elt ‑> 'a) ‑> 'a ‑> t ‑> 'a
    Fold on all values.
    val size : t ‑> int
    Number of elements (linear complexity).
    val to_list : t ‑> elt list
    Return the elements of the heap, in no particular order.
    val to_list_sorted : t ‑> elt list
    Return the elements in increasing order.
    • Since: 1.1
    val add_list : t ‑> elt list ‑> t
    Add the elements of the list to the heap. An element occurring several
-times will be added that many times to the heap.
    • Since: 0.16
    val of_list : elt list ‑> t
    of_list l is add_list empty l.
    val add_seq : t ‑> elt sequence ‑> t
    • Since: 0.16
    val of_seq : elt sequence ‑> t
    Build a heap from a given sequence.
    val to_seq : t ‑> elt sequence
    Return a sequence of the elements of the heap.
    val to_seq_sorted : t ‑> elt sequence
    Iterate on the elements, in increasing order.
    • Since: 1.1
    val add_klist : t ‑> elt klist ‑> t
    • Since: 0.16
    val of_klist : elt klist ‑> t
    Build a heap from a given klist.
    val to_klist : t ‑> elt klist
    Return a klist of the elements of the heap.
    val add_gen : t ‑> elt gen ‑> t
    • Since: 0.16
    val of_gen : elt gen ‑> t
    Build a heap from a given gen.
    val to_gen : t ‑> elt gen
    Return a gen of the elements of the heap.
    val to_tree : t ‑> elt ktree
    Return a ktree of the elements of the heap.
    val pp : ?⁠sep:string ‑> elt printer ‑> t printer
    
\ No newline at end of file
+times will be added that many times to the heap.
    val of_list : elt list ‑> t
    of_list l is add_list empty l. Complexity: O(n log n).
    val add_seq : t ‑> elt sequence ‑> t
    • Since: 0.16
    val of_seq : elt sequence ‑> t
    Build a heap from a given sequence. Complexity: O(n log n).
    val to_seq : t ‑> elt sequence
    Return a sequence of the elements of the heap.
    val to_seq_sorted : t ‑> elt sequence
    Iterate on the elements, in increasing order.
    • Since: 1.1
    val add_klist : t ‑> elt klist ‑> t
    • Since: 0.16
    val of_klist : elt klist ‑> t
    Build a heap from a given klist. Complexity: O(n log n).
    val to_klist : t ‑> elt klist
    Return a klist of the elements of the heap.
    val add_gen : t ‑> elt gen ‑> t
    • Since: 0.16
    val of_gen : elt gen ‑> t
    Build a heap from a given gen. Complexity: O(n log n).
    val to_gen : t ‑> elt gen
    Return a gen of the elements of the heap.
    val to_tree : t ‑> elt ktree
    Return a ktree of the elements of the heap.
    val pp : ?⁠sep:string ‑> elt printer ‑> t printer
    
\ No newline at end of file
diff --git a/2.0/containers/CCList/index.html b/2.0/containers/CCList/index.html
index e99edeaa..c7bd3ca3 100644
--- a/2.0/containers/CCList/index.html
+++ b/2.0/containers/CCList/index.html
@@ -66,7 +66,7 @@ according to eq.