package arrayjit

  1. Overview
  2. Docs
val cons : (hd:'a -> tl:'a mutable_list -> 'a mutable_list) Variantslib.Variant.t
val fold : init:'a -> empty:('b -> 'c mutable_list Variantslib.Variant.t -> 'd) -> cons: ('e -> (hd:'f -> tl:'f mutable_list -> 'f mutable_list) Variantslib.Variant.t -> 'g) -> 'h
val iter : empty:('a mutable_list Variantslib.Variant.t -> Base.unit) -> cons: ((hd:'b -> tl:'b mutable_list -> 'b mutable_list) Variantslib.Variant.t -> Base.unit) -> Base.unit
val map : 'a mutable_list -> empty:('b mutable_list Variantslib.Variant.t -> 'c) -> cons: ((hd:'d -> tl:'d mutable_list -> 'd mutable_list) Variantslib.Variant.t -> hd:'e -> tl:'f mutable_list -> 'g) -> 'h
val make_matcher : empty:('a mutable_list Variantslib.Variant.t -> 'b -> (unit -> 'c) * 'd) -> cons: ((hd:'e -> tl:'e mutable_list -> 'e mutable_list) Variantslib.Variant.t -> 'f -> (hd:'g -> tl:'g mutable_list -> 'h) * 'i) -> 'j -> ('g mutable_list -> 'h) * 'k
val to_rank : 'a mutable_list -> int
val to_name : 'a mutable_list -> string
val descriptions : (string * int) list
OCaml

Innovation. Community. Security.