package ocaml-protoc

  1. Overview
  2. Docs
A Protobuf Compiler for OCaml

Install 

dune-project
 Dependency

github.com Edit opam file Versions (20)

Authors

  1. M
    Maxime Ransan <maxime.ransan@gmail.com>
  2. P
    Peter Zotov <whitequark@whitequark.org>

Maintainers

  1. M
    Maxime Ransan <maxime.ransan@gmail.com>

Sources

0.1.1.2.tar.gz
sha256=806975aa0d1d3123f19c08ed9c42d73cb7a06278d0bd5415eecc3d9af86d7e41
md5=e86800b09eeb978a3234fc91385cc690

doc/pbrt/Pbrt/Repeated_field/index.html

Module Pbrt.Repeated_field

type 'a t = {
  1. mutable s : int;
  2. mutable i : int;
  3. mutable a : 'a array;
  4. mutable l : 'a array list;
}

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
val list_rev_iter : ('a -> unit) -> 'a list -> unit

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 identity : 'a -> 'a
val to_list : 'a t -> 'a list