All combinaisons of tuples from the two vectors are passed to the function.
val get : ( 'a, _ ) t -> int -> 'aAccess element by its index, or
remove_and_shift v i remove the i-th element from v. Move elements that are after the i-th in v, in linear time. Preserve the order of the elements in v. See remove_unordered for constant time removal function that doesn't preserve the order of elements.
remove_unordered v i remove the i-th element from v. Does NOT preserve the order of the elements in v (might swap with the last element). See remove_and_shift if you want to keep the ordering.
val rev_iter : ( 'a -> unit ) -> ( 'a, _ ) t -> unitrev_iter f a is the same as iter f (rev a), only more efficient.
val size : ( 'a, _ ) t -> intNumber of elements in the vector.
val capacity : ( _, _ ) t -> intNumber of elements the vector can contain without being resized.
Access the underlying shared array (do not modify!). unsafe_get_array v is longer than size v, but elements at higher index than 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].
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 ) tval to_array : ( 'a, _ ) t -> 'a arrayto_array v returns an array corresponding to the vector v.
val to_list : ( 'a, _ ) t -> 'a listReturn a list with the elements contained in the vector.
Convert an Iterator to a vector. Renamed from of_std_seq since 3.0.
to_iter_rev v returns the sequence of elements of v in reverse order, that is, the last elements of v are iterated on first.
val to_seq : ( 'a, _ ) t -> 'a Stdlib.Seq.tReturn an iterator with the elements contained in the vector. Renamed from to_std_seq since 3.0.
val to_seq_rev : ( 'a, _ ) t -> 'a Stdlib.Seq.tto_seq v returns the sequence of elements of v in reverse order, that is, the last elements of v are iterated on first. Renamed from to_std_seq since 3.0.
Vector as an array slice. By doing it we expose the internal array, so be careful!.
slice_iter v start len is the sequence of elements from v.(start) to v.(start+len-1).
val to_string :
+ ( 'c, _ ) tAll combinaisons of tuples from the two vectors are passed to the function.
val get : ( 'a, _ ) t -> int -> 'aAccess element by its index, or
remove_and_shift v i remove the i-th element from v. Move elements that are after the i-th in v, in linear time. Preserve the order of the elements in v. See remove_unordered for constant time removal function that doesn't preserve the order of elements.
remove_unordered v i remove the i-th element from v. Does NOT preserve the order of the elements in v (might swap with the last element). See remove_and_shift if you want to keep the ordering.
insert v i x insert the given element at index i. Elements at location i and later are first shifted over in linear time before inserting x. Preserve the order of elements in v.
val rev_iter : ( 'a -> unit ) -> ( 'a, _ ) t -> unitrev_iter f a is the same as iter f (rev a), only more efficient.
val size : ( 'a, _ ) t -> intNumber of elements in the vector.
val capacity : ( _, _ ) t -> intNumber of elements the vector can contain without being resized.
Access the underlying shared array (do not modify!). unsafe_get_array v is longer than size v, but elements at higher index than 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].
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 ) tval to_array : ( 'a, _ ) t -> 'a arrayto_array v returns an array corresponding to the vector v.
val to_list : ( 'a, _ ) t -> 'a listReturn a list with the elements contained in the vector.
Convert an Iterator to a vector. Renamed from of_std_seq since 3.0.
to_iter_rev v returns the sequence of elements of v in reverse order, that is, the last elements of v are iterated on first.
val to_seq : ( 'a, _ ) t -> 'a Stdlib.Seq.tReturn an iterator with the elements contained in the vector. Renamed from to_std_seq since 3.0.
val to_seq_rev : ( 'a, _ ) t -> 'a Stdlib.Seq.tto_seq v returns the sequence of elements of v in reverse order, that is, the last elements of v are iterated on first. Renamed from to_std_seq since 3.0.
Vector as an array slice. By doing it we expose the internal array, so be careful!.
slice_iter v start len is the sequence of elements from v.(start) to v.(start+len-1).
val to_string :
?start:string ->
?stop:string ->
?sep:string ->
diff --git a/dev/containers/Containers/.dune-keep b/dev/containers/Containers/.dummy
similarity index 100%
rename from dev/containers/Containers/.dune-keep
rename to dev/containers/Containers/.dummy
diff --git a/dev/containers/ContainersLabels/.dune-keep b/dev/containers/ContainersLabels/.dummy
similarity index 100%
rename from dev/containers/ContainersLabels/.dune-keep
rename to dev/containers/ContainersLabels/.dummy
diff --git a/dev/containers/Containers_codegen/.dune-keep b/dev/containers/Containers_codegen/.dummy
similarity index 100%
rename from dev/containers/Containers_codegen/.dune-keep
rename to dev/containers/Containers_codegen/.dummy
diff --git a/dev/containers/Containers_top/.dune-keep b/dev/containers/Containers_top/.dummy
similarity index 100%
rename from dev/containers/Containers_top/.dune-keep
rename to dev/containers/Containers_top/.dummy