optimized data structure for fast inserts so that decoding can be efficient
Type can be constructed at no cost from an existing array.
val make : 'a -> 'a tmake v create an initial repeated field container v is not used but needed to initialize the internal array data structure.
This design flow is intentional to keep optimal performance.
Therefore lengh (make 1) will return 0.
val of_array_no_copy : 'a array -> 'a tof_array_no_copy a initialized a new repeated field container with a.
a is not copied into a but only referenced so any later modification to any a element will affected a t container.
val length : 'a t -> intlength c returns the number of insterted element in c.
val add : 'a -> 'a t -> unitadd x c appends a to container c
This operation is not constant time since it might trigger an alocation of an array. However it is optimized for the total insert time of element one by one.
val to_array : 'a t -> 'a arrayto_array c convert the repeated field container to an array.
val to_list : 'a t -> 'a listto_list c convert the repeated field container to an list.
val iter : ('a -> unit) -> 'a t -> unititer f c applies f to all element in c
val iteri : (int -> 'a -> unit) -> 'a t -> unititeri f c applies f to all element in c
val fold_left : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'bfold_left f e0 c accumulates e0 through each elements
val map_to_array : ('a -> 'b) -> 'a t -> 'b arraymap_to_array f c map all c element to an array containing f e_i element.
val map_to_list : ('a -> 'b) -> 'a t -> 'b listmap_to_list f c map all c element to a list containing f e_i element.