package ocaml-protoc
A Protobuf Compiler for OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
0.1.1.2.tar.gz
sha256=806975aa0d1d3123f19c08ed9c42d73cb7a06278d0bd5415eecc3d9af86d7e41
md5=e86800b09eeb978a3234fc91385cc690
doc/pbrt/Pbrt/Repeated_field/index.html
Module Pbrt.Repeated_field
t
is a container optimized for fast repeated inserts.
It is made of a list of growing size array l
as well as a current array a
in which inserts are performed until a
is full and appended to l
.
The main growing logic is implemented in the add
functions.
val make : 'a -> 'a t
val of_array_no_copy : 'a array -> 'a t
val add : 'a -> 'a t -> unit
val to_array : 'a t -> 'a array
list_rev_iter f l
iterate over the list in reverse order
val iter : ('a -> 'b) -> 'a t -> unit
val iteri : (int -> 'a -> 'b) -> 'a t -> unit
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a
val length : 'a t -> int
val map_to_array : ('a -> 'b) -> 'a t -> 'b array
val map_to_list : ('a -> 'b) -> 'a t -> 'b list
val to_list : 'a t -> 'a list
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>