+
This library exposes the following toplevel modules:
.
\ 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 @@ -+
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 @@ -+
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 @@ -+
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 @@ -+
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 @@ -+
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 @@ -+
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 predicatep. That is, it returns
Allow different types.val exists : ('a ‑> bool) ‑> 'a t ‑> boolexists 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).
Exists on pairs of arrays.
val random_choose : 'a t ‑> 'a random_genChoose an element randomly.
val random_choose : 'a t ‑> 'a random_genChoose an element randomly.
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.
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) |].
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@]"val of_to_string : ('a ‑> string) ‑> 'a printerof_to_string f converts its input to a string using f,
then prints the string.
some pp will print options as follows:
-
Some x is printed using pp on x.None is not printed at all.Use ANSI escape codes https://en.wikipedia.org/wiki/ANSI_escape_code +
Some x is printed using pp on x.None is not printed at all.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_or : ('a, 'b) Hashtbl.t ‑> 'a ‑> default:'b ‑> 'bget_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 map_list : ('a ‑> 'b ‑> 'c) ‑> ('a, 'b) Hashtbl.t ‑> 'c listMap on a hashtable's items, collect into a list.
val incr : ?by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unitincr ?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_list : ('a, 'b) Hashtbl.t ‑> 'a listkeys_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 map_list : ('a ‑> 'b ‑> 'c) ‑> ('a, 'b) Hashtbl.t ‑> 'c listMap on a hashtable's items, collect into a list.
val incr : ?by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unitincr ?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 ‑> unitLike 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
Polymorphic tables
This sub-module contains the extension of the standard polymorphic Hashtbl.
module Poly : sig ... endinclude module type of Poly
val get_or : ('a, 'b) Hashtbl.t ‑> 'a ‑> default:'b ‑> 'bget_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 map_list : ('a ‑> 'b ‑> 'c) ‑> ('a, 'b) Hashtbl.t ‑> 'c listMap on a hashtable's items, collect into a list.
val incr : ?by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unitincr ?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_list : ('a, 'b) Hashtbl.t ‑> 'a listkeys_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 map_list : ('a ‑> 'b ‑> 'c) ‑> ('a, 'b) Hashtbl.t ‑> 'c listMap on a hashtable's items, collect into a list.
val incr : ?by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unitincr ?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 ‑> unitLike 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
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
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
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
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
Similar to add_seq_count, but allocates a new table and returns it.
- Since: 0.16
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
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
\ No newline at end of file
+times will be added that many times to the heap.- Since: 0.16
\ 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
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
\ No newline at end of file
+times will be added that many times to the heap.- Since: 0.16
\ 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.val iteri : (int ‑> 'a ‑> unit) ‑> 'a t ‑> unitLike iter, but the function is applied to the index of
the element as first argument (counting from 0), and the element
-itself as second argument.
val foldi : ('b ‑> int ‑> 'a ‑> 'b) ‑> 'b ‑> 'a t ‑> 'bLike fold but it also passes in the index of each element to the folded function.
Fold on two lists, with index.
- Raises Invalid_argument: when lists do not have the same length.
- Since: 2.0
val foldi : ('b ‑> int ‑> 'a ‑> 'b) ‑> 'b ‑> 'a t ‑> 'bLike fold but it also passes in the index of each element to the folded function. Tail-recursive.
Fold on two lists, with index.
- Raises Invalid_argument: when lists do not have the same length.
- Since: 2.0
val get_at_idx : int ‑> 'a t ‑> 'a optionGet by index in the list.
If the index is negative, it will get element starting from the end
of the list.
val nth_opt : 'a t ‑> int ‑> 'a optionSafe version of nth.
- Raises Invalid_argument: if the int is negative.
- Since: 1.5
val get_at_idx_exn : int ‑> 'a t ‑> 'aGet the i-th element, or
- Raises Not_found: if the index is invalid.
If the index is negative, it will get element starting from the end
@@ -87,6 +87,9 @@ but do not care about the order, use sort_uni
where the difference between successive elements is
step.
Use a negative step for a decreasing list.- Raises Invalid_argument: if
step=0. - Since: 0.18
val range : int ‑> int ‑> int trange i j iterates on integers from i to j included. It works
both for decreasing and increasing ranges.
val range' : int ‑> int ‑> int tLike range but the second bound is excluded.
-For instance range' 0 5 = [0;1;2;3;4].
Association Lists
module Assoc : sig ... endReferences on Lists
- Since: 0.3.3
module Ref : sig ... endConversions
val random : 'a random_gen ‑> 'a t random_genval random_non_empty : 'a random_gen ‑> 'a t random_genval random_len : int ‑> 'a random_gen ‑> 'a t random_genval random_choose : 'a t ‑> 'a random_genRandomly choose an element in the list.
- Raises Not_found: if the list is empty.
val random_sequence : 'a random_gen t ‑> 'a t random_genInfix Operators
+For instance range' 0 5 = [0;1;2;3;4].
Association Lists
module Assoc : sig ... endReferences on Lists
- Since: 0.3.3
module Ref : sig ... endConversions
val random : 'a random_gen ‑> 'a t random_genval random_non_empty : 'a random_gen ‑> 'a t random_genval random_len : int ‑> 'a random_gen ‑> 'a t random_genval random_choose : 'a t ‑> 'a random_genRandomly choose an element in the list.
- Raises Not_found: if the list is empty.
val random_sequence : 'a random_gen t ‑> 'a t random_genBuild a list from a given sequence.
+In the result, elements appear in the same order as they did in the source sequence.
Build a list from a given gen.
+In the result, elements appear in the same order as they did in the source gen.
Build a list from a given klist.
+In the result, elements appear in the same order as they did in the source klist.
Infix Operators
It is convenient to open CCList.Infix to access the infix operators
-without cluttering the scope too much.
- Since: 0.16
module Infix : sig ... endIO
Lists of pairs
\ No newline at end of file
+without cluttering the scope too much.- Since: 0.16
module Infix : sig ... endIO
\ No newline at end of file
diff --git a/2.0/containers/CCListLabels/index.html b/2.0/containers/CCListLabels/index.html
index ad99f74d..ecfa7b36 100644
--- a/2.0/containers/CCListLabels/index.html
+++ b/2.0/containers/CCListLabels/index.html
@@ -34,7 +34,7 @@ according to eq.val iteri : f:(int ‑> 'a ‑> unit) ‑> 'a t ‑> unitLike iter, but the function is applied to the index of
the element as first argument (counting from 0), and the element
-itself as second argument.
val foldi : f:('b ‑> int ‑> 'a ‑> 'b) ‑> init:'b ‑> 'a t ‑> 'bLike fold but it also passes in the index of each element to the folded function.
val foldi : f:('b ‑> int ‑> 'a ‑> 'b) ‑> init:'b ‑> 'a t ‑> 'bLike fold but it also passes in the index of each element to the folded function. Tail-recursive.
val get_at_idx : int ‑> 'a t ‑> 'a optionGet by index in the list.
If the index is negative, it will get element starting from the end
of the list.
val get_at_idx_exn : int ‑> 'a t ‑> 'aGet the i-th element, or
- Raises Not_found: if the index is invalid.
If the index is negative, it will get element starting from the end
diff --git a/2.0/containers/CCVector/index.html b/2.0/containers/CCVector/index.html
index 9ce4cf5a..3fad8da5 100644
--- a/2.0/containers/CCVector/index.html
+++ b/2.0/containers/CCVector/index.html
@@ -17,7 +17,7 @@ of the elements (might swap with the last element).
size v are undefined (do not access!).val (--) : int ‑> int ‑> (int, 'mut) tRange of integers, either ascending or descending (both included,
therefore the result is never empty).
Example: 1 -- 10 returns the vector [1;2;3;4;5;6;7;8;9;10].
val (--^) : int ‑> int ‑> (int, 'mut) tRange of integers, either ascending or descending, but excluding right.
-Example: 1 --^ 10 returns the vector [1;2;3;4;5;6;7;8;9].
- Since: 0.17
val of_list : 'a list ‑> ('a, 'mut) tto_seq_rev v returns the sequence of elements of v in reverse order,
+Example: 1 --^ 10 returns the vector [1;2;3;4;5;6;7;8;9].
- Since: 0.17
val of_array : 'a array ‑> ('a, 'mut) tof_array a returns a vector corresponding to the array a. Operates in O(n) time.
val of_list : 'a list ‑> ('a, 'mut) tto_seq_rev v returns the sequence of elements of v in reverse order,
that is, the last elements of v are iterated on first.
- Since: 0.14
\ No newline at end of file
diff --git a/2.0/containers/Containers/Hashtbl/index.html b/2.0/containers/Containers/Hashtbl/index.html
index 3a9eaab3..cc514454 100644
--- a/2.0/containers/Containers/Hashtbl/index.html
+++ b/2.0/containers/Containers/Hashtbl/index.html
@@ -1,6 +1,7 @@
Hashtbl (containers.Containers.Hashtbl) Module Containers.Hashtbl
- Since: 0.14
include module type of Hashtbl with type Hashtbl.statistics = Hashtbl.statistics and module Hashtbl.Make = Hashtbl.Make and type ('a, 'b) Hashtbl.t = ('a, 'b) Hashtbl.t
val create : ?random:bool ‑> int ‑> ('a, 'b) tval clear : ('a, 'b) t ‑> unitval reset : ('a, 'b) t ‑> unitval add : ('a, 'b) t ‑> 'a ‑> 'b ‑> unitval find : ('a, 'b) t ‑> 'a ‑> 'bval find_opt : ('a, 'b) t ‑> 'a ‑> 'b optionval find_all : ('a, 'b) t ‑> 'a ‑> 'b listval mem : ('a, 'b) t ‑> 'a ‑> boolval remove : ('a, 'b) t ‑> 'a ‑> unitval replace : ('a, 'b) t ‑> 'a ‑> 'b ‑> unitval iter : ('a ‑> 'b ‑> unit) ‑> ('a, 'b) t ‑> unitval filter_map_inplace : ('a ‑> 'b ‑> 'b option) ‑> ('a, 'b) t ‑> unitval fold : ('a ‑> 'b ‑> 'c ‑> 'c) ‑> ('a, 'b) t ‑> 'c ‑> 'cval length : ('a, 'b) t ‑> intval stats : ('a, 'b) t ‑> statisticsmodule type HashedType : sig ... endmodule type S : sig ... endmodule type SeededHashedType : sig ... endmodule type SeededS : sig ... endmodule MakeSeeded : functor (H : SeededHashedType) -> sig ... endinclude CCHashtbl.Poly
val get_or : ('a, 'b) Hashtbl.t ‑> 'a ‑> default:'b ‑> 'bget_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 CCHashtbl.sequenceIterate on keys (similar order as Hashtbl.iter).
val map_list : ('a ‑> 'b ‑> 'c) ‑> ('a, 'b) Hashtbl.t ‑> 'c listMap on a hashtable's items, collect into a list.
val incr : ?by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unitincr ?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 CCHashtbl.sequenceIterate on keys (similar order as Hashtbl.iter).
val keys_list : ('a, 'b) Hashtbl.t ‑> 'a listkeys_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 map_list : ('a ‑> 'b ‑> 'c) ‑> ('a, 'b) Hashtbl.t ‑> 'c listMap on a hashtable's items, collect into a list.
val incr : ?by:int ‑> ('a, int) Hashtbl.t ‑> 'a ‑> unitincr ?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 ‑> unitLike 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/Containers/Hashtbl/module-type-S'/index.html b/2.0/containers/Containers/Hashtbl/module-type-S'/index.html
index 8aa1da85..12387b4e 100644
--- a/2.0/containers/Containers/Hashtbl/module-type-S'/index.html
+++ b/2.0/containers/Containers/Hashtbl/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
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 add_seq : 'a t ‑> (key * 'a) CCHashtbl.sequence ‑> unitAdd the corresponding pairs to the table, using Hashtbl.add.
- Since: 0.16
val add_seq_count : int t ‑> key CCHashtbl.sequence ‑> unitadd_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
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 add_seq : 'a t ‑> (key * 'a) CCHashtbl.sequence ‑> unitAdd the corresponding pairs to the table, using Hashtbl.add.
- Since: 0.16
val add_seq_count : int t ‑> key CCHashtbl.sequence ‑> unitadd_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 CCHashtbl.sequence ‑> int tSimilar to add_seq_count, but allocates a new table and returns it.
- Since: 0.16
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/Containers/index.html b/2.0/containers/Containers/index.html
index 7ac09f82..89255acd 100644
--- a/2.0/containers/Containers/index.html
+++ b/2.0/containers/Containers/index.html
@@ -1,2 +1,2 @@
-
Containers (containers.Containers) Module Containers
Drop-In replacement to Stdlib
module Array = CCArraymodule ArrayLabels = CCArrayLabelsmodule Array_slice = CCArray_slicemodule Bool = CCBoolmodule Equal = CCEqualmodule Float = CCFloatmodule Format = CCFormatmodule Fun = CCFunmodule Hash = CCHashmodule Hashtbl : sig ... endmodule Heap = CCHeapmodule Int = CCIntmodule Int64 = CCInt64module IO = CCIOmodule List = CCListmodule ListLabels = CCListLabelsmodule Map = CCMapmodule Option = CCOptmodule Ord = CCOrdmodule Pair = CCPairmodule Parse = CCParsemodule Random = CCRandommodule Ref = CCRefmodule Result = CCResultmodule Set = CCSetmodule String = CCStringmodule Vector = CCVectormodule Monomorphic = CCMonomorphic
\ No newline at end of file
+Containers (containers.Containers) Module Containers
Drop-In replacement to Stdlib
module Array = CCArraymodule ArrayLabels = CCArrayLabelsmodule Array_slice = CCArray_slicemodule Bool = CCBoolmodule Equal = CCEqualmodule Float = CCFloatmodule Format = CCFormatmodule Fun = CCFunmodule Hash = CCHashmodule Hashtbl : sig ... endmodule Heap = CCHeapmodule Int = CCIntmodule Int64 = CCInt64module IO = CCIOmodule List = CCListmodule ListLabels = CCListLabelsmodule Map = CCMapmodule Option = CCOptmodule Ord = CCOrdmodule Pair = CCPairmodule Parse = CCParsemodule Random = CCRandommodule Ref = CCRefmodule Result = CCResultmodule Set = CCSetmodule String = CCStringmodule Vector = CCVectorinclude Monomorphic
\ No newline at end of file
diff --git a/2.0/containers/index.html b/2.0/containers/index.html
index 846538d4..abf4fa76 100644
--- a/2.0/containers/index.html
+++ b/2.0/containers/index.html
@@ -1,3 +1,3 @@
-containers-generated (containers.containers-generated) Library containers
+
index (containers.index) Library containers
This library exposes the following toplevel modules:
.
\ No newline at end of file