package capnp

  1. Overview
  2. Docs
type ro = Message.ro
type rw = Message.rw
type (!'cap, !'a, !'arr) t = ('cap, 'a, 'arr) InnerArray.t
val length : ('cap, 'a, 'arr) t -> int
val get : ('cap, 'a, 'arr) t -> int -> 'a
val set : (rw, 'a, 'arr) t -> int -> 'a -> unit
val init : (rw, 'a, 'arr) t -> int -> unit
val mem : ?equal:('a -> 'a -> bool) -> ('cap, 'a, 'arr) t -> 'a -> bool
val is_empty : ('cap, 'a, 'arr) t -> bool
val iter : ('cap, 'a, 'arr) t -> f:('a -> unit) -> unit
val iteri : ('cap, 'a, 'arr) t -> f:(int -> 'a -> unit) -> unit
val fold : ('cap, 'a, 'arr) t -> init:'acc -> f:('acc -> 'a -> 'acc) -> 'acc
val fold_right : ('cap, 'a, 'arr) t -> f:('a -> 'acc -> 'acc) -> init:'acc -> 'acc
val foldi : ('cap, 'a, 'arr) t -> init:'acc -> f:(int -> 'acc -> 'a -> 'acc) -> 'acc
val foldi_right : ('cap, 'a, 'arr) t -> f:(int -> 'a -> 'acc -> 'acc) -> init:'acc -> 'acc
val exists : ('cap, 'a, 'arr) t -> f:('a -> bool) -> bool
val forall : ('cap, 'a, 'arr) t -> f:('a -> bool) -> bool
val count : ('cap, 'a, 'arr) t -> f:('a -> bool) -> int
val find : ('cap, 'a, 'arr) t -> f:('a -> bool) -> 'a option
val find_map : ('cap, 'a, 'arr) t -> f:('a -> 'b option) -> 'b option
val to_list : ('cap, 'a, 'arr) t -> 'a list
val to_array : ('cap, 'a, 'arr) t -> 'a array
val set_list : (rw, 'a, 'arr) t -> 'a list -> unit
val set_array : (rw, 'a, 'arr) t -> 'a array -> unit
val map_array : ('cap, 'a, 'arr) t -> f:('a -> 'b) -> 'b array
val map_list : ('cap, 'a, 'arr) t -> f:('a -> 'b) -> 'b list
OCaml

Innovation. Community. Security.