package containers
Install
Dune Dependency
Authors
Maintainers
Sources
md5=d84e09c5d0abc501aa17cd502e31a038
sha512=8b832f4ada6035e80d81be0cfb7bdffb695ec67d465ed6097a144019e2b8a8f909095e78019c3da2d8181cc3cd730cd48f7519e87d3162442562103b7f36aabb
doc/containers/CCVector/index.html
Module CCVector
Source
Growable, mutable vector
Mutability is rw
(read-write) or ro
(read-only).
The type of a vector of elements of type 'a
, with a mutability flat 'mut
.
Fast internal iterator.
Make an immutable vector (no copy! Don't use the old version).
Create a new vector, the value is used to enforce the type the new vector.
Init the vector with the given function and size.
Clear the content of the vector, and deallocate the underlying array, removing references to all the elements.
Hint to the vector that it should have at least the given capacity.
Hint to the vector that it should have at least the given capacity. Just a hint, will not be enforced if the vector is empty and init
is not provided.
Raised on empty stack.
Shrink to the given size (remove elements above this size). Does nothing if the parameter is bigger than the current size.
Is the element a member of the vector?
Sort the vector, returning a copy of it that is sorted w.r.t the given ordering. The vector itself is unchanged. The underlying array of the new vector can be smaller than the original one.
Sort the vector in place (modifying it). This function change the size of the underlying array.
Sort the array and remove duplicates, in place (e.g. modifying the vector itself).
Map elements of the vector, yielding a new vector.
map f v
is just like map
, but it also passes in the index of each element as the first argument to the function f
.
Filter elements from the vector. filter p v
leaves v
unchanged but returns a new vector that only contains elements of v
satisfying p
.
Existential test (is there an element that satisfies the predicate?).
Universal test (do all the elements satisfy the predicate?).
Find an element that satisfies the predicate.
Find an element that satisfies the predicate, or
find_map f v
returns the first Some y = f x
for x
in v
, or None
if f x = None
for each x
in v
.
Map elements with a function, possibly filtering some of them out.
Filter-map elements of the vector in place
Map each element to a sub-vector.
Like flat_map
, but using Seq
for intermediate collections.
Like flat_map
, but using list
for intermediate collections.
All combinaisons of tuples from the two vectors are passed to the function.
Remove the n-th
element of the vector. Does NOT preserve the order of the elements (might swap with the last element).
rev_iter f a
is the same as iter f (rev a)
, only more efficient.
Number 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!).
Range 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]
.
Range of integers, either ascending or descending, but excluding right. Example: 1 --^ 10
returns the vector [1;2;3;4;5;6;7;8;9]
.
of_array a
returns a vector corresponding to the array a
. Operates in O(n)
time.
to_array v
returns an array corresponding to the vector v
.
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.
Return an iterator with the elements contained in the vector.
to_seq v
returns the sequence of elements of v
in reverse order, that is, the last elements of v
are iterated on first.
Vector as an array slice. By doing it we expose the internal array, so be careful!.
slice_seq 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 ->
('a -> string) ->
('a, _) t ->
string
Print the vector in a string
Let operators on OCaml >= 4.08.0, nothing otherwise