package GuaCaml

  1. Overview
  2. Docs
package GuaCaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
val map : ('a -> 'b) -> 'a list -> 'b list
val map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val split : ('a * 'b) list -> 'a list * 'b list
val combine : 'a list -> 'b list -> ('a * 'b) list
val rev_flatten : 'a list list -> 'a list
val flatten : 'a list list -> 'a list
val of_htbl : ('a, 'b) Hashtbl.t -> ('a * 'b) list
val to_htbl : ?size:int -> ('a * 'b) list -> ('a, 'b) Hashtbl.t
val merge_uniq : 'a list -> 'a list -> 'a list
val collapse_first : ('a * 'b) list -> ('a * 'b list) list
val map_partition : ('a -> ('b, 'c) result) -> 'a list -> 'c list * 'b list
val partition : ('a -> bool) -> 'a list -> 'a list * 'a list
val bool_partition : bool list -> 'a list -> 'a list * 'a list
val list_init : int -> (int -> 'a) -> 'a list
val init : int -> (int -> 'a) -> 'a list
val range : int -> int list
val catlist : 'a -> 'a list list -> 'a list
val option_cons : 'a option -> 'a list -> 'a list
val catmap : ('a -> 'b list) -> 'a list -> 'b list
val list_of_oplist : 'a option list -> 'a list
val unop : 'a option list -> 'a list
val opmap : ('a -> 'b option) -> 'a list -> 'b list
val opmap2 : ('a -> 'b -> 'c option) -> 'a list -> 'b list -> 'c list
val sum : int list -> int
val map_sum : ('a -> int) -> ?init:int -> 'a list -> int
val count : ?carry:int -> ('a -> bool) -> 'a list -> int
val counti : ?carry:int -> ?index:int -> (int -> 'a -> bool) -> 'a list -> int
val count_true : bool list -> int
val count_false : bool list -> int
val count_Some : 'a option list -> int
val count_None : 'a option list -> int
val count_Ok : ('a, 'b) result list -> int
val count_Error : ('a, 'b) result list -> int
val indexes : ('a -> bool) -> 'a list -> int list
val indexes_true : bool list -> int list
val indexesi : (int -> 'a -> bool) -> 'a list -> int list
val of_sorted_indexes : int -> int list -> bool list
val of_indexes : ?sorted:bool -> int -> int list -> bool list
val index : ('a -> bool) -> 'a list -> int option
val list_index : 'a -> 'a list -> int option
val ifind : ('a -> 'b option) -> 'a list -> (int * 'b) option
val find_prefix : ('a -> bool) -> 'a list -> 'a list * 'a list
val find_onehash_prefix : ?p:('a -> bool) -> ('a -> 'b) -> 'a list -> 'a list * 'a list
val ntimes : ?carry:'a list -> 'a -> int -> 'a list
val make : int -> 'a -> 'a list
val ncopy : 'a list -> int -> 'a list
val listfilter : bool list -> 'a list -> 'a list
val consensus0 : ('a0 -> 'a1 -> 'b * 'c0 option * 'c1 option) -> 'a0 list -> 'a1 list -> 'b list * 'c0 list * 'c1 list
val consensusi0 : (int -> 'a0 -> 'a1 -> 'b * 'c0 option * 'c1 option) -> 'a0 list -> 'a1 list -> 'b list * 'c0 list * 'c1 list
val consensus : ('a -> ('b * 'c) -> ('d * 'e) -> ('a * 'f) * ('b * 'g option) * ('d * 'h option)) -> 'a -> ('b * 'c list) -> ('d * 'e list) -> ('a * 'f list) * ('b * 'g list) * ('d * 'h list)
val onehash_check : ('a -> 'b) -> 'b -> 'a list -> bool
val onehash : ('a -> 'b) -> 'a list -> bool
val get_onehash : ('a -> 'b) -> 'a list -> 'b option
val lists_length_check : int -> 'a list list -> bool
val lists_length : 'a list list -> bool
val lists_get_length : 'a list list -> int option
val nth_pop : 'a list -> int -> 'a option * 'a list
val iremove : ('a -> 'b option) -> 'a list -> (int * 'b) option * 'a list
val hdtl : 'a list -> 'a * 'a list
val map_hdtl : 'a list list -> 'a list * 'a list list
val hdtl_nth : int -> 'a list -> 'a list * 'a list
val list_add_partial_to_support : 'a -> 'a list list -> 'a list -> 'a list list
val list_transpose_partial_matrix : 'a -> int -> 'a list list -> 'a list list
val member : 'a -> 'a list -> bool
val int_of_boollist : bool list -> int
val list_uniq : 'a list -> 'a list
val string_of_list : ('a -> string) -> 'a list -> string
val print_list : ('a -> string) -> 'a list -> unit
val list_map_z1 : ('a -> 'a -> 'b) -> 'a list -> 'b list
val indexify : ('a -> bool) -> 'a list -> int option list
val indexify_true : bool list -> int option list
val foldmap : ('b -> 'a -> 'c * 'b) -> ('b -> bool) -> 'b -> 'a list -> 'c list * 'b
val opfoldmap : ('a -> 'b -> 'c option * 'b) -> ('b -> bool) -> 'b -> 'a list -> 'c list * 'b
val list_iterative_reduction : ('a -> 'b option * 'a option) -> 'a -> 'b list
val last : 'a list -> 'a list * 'a
val opget_last : ?last:'a option -> 'a list -> 'a option
val setnth : 'a list -> int -> 'a -> 'a list
val list_min : 'a list -> 'a * int
val list_max : 'a list -> 'a * int
val list_mm : 'a list -> ('a * int) * ('a * int)
val count_head : 'a -> 'a list -> int * 'a list
val rle : ?delta:('a option -> 'a -> 'a) -> 'a list -> (int * 'a) list
val rld : ?delta:('a option -> 'a -> 'a) -> (int * 'a) list -> 'a list
val delta : ('a option -> 'a -> 'b) -> 'a list -> 'b list
val undelta : ('a option -> 'b -> 'a) -> 'b list -> 'a list
val delta_int : int list -> int list
val undelta_int : int list -> int list
val delta'_int : int list -> int list
val undelta'_int : int list -> int list
val liss : ?cmp:('a -> 'a -> int) -> 'a list -> int * bool list
val ldss : ?cmp:('a -> 'a -> int) -> 'a list -> int * bool list
val monodecomp : ?cmp:(int -> int -> int) -> int list -> int array * (bool * int list) list
val mfe : int list -> int list
val mfd : int list -> int list
val argmax : ('a -> 'b) -> ?cmp:('b -> 'b -> int) -> 'a -> 'a list -> 'a * 'b * int
val argmin : ('a -> 'b) -> ?cmp:('b -> 'b -> int) -> 'a -> 'a list -> 'a * 'b * int
val mapreduce : 'a list -> 'b -> ('a -> 'b) -> ('b -> 'b -> 'b) -> 'b
val foldi_left : ?index:int -> (int -> 'a -> 'b -> 'a) -> 'a -> 'b list -> 'a
val opmax : ?cmp:('a -> 'a -> int) -> 'a list -> (int * 'a) option
val opmin : ?cmp:('a -> 'a -> int) -> 'a list -> (int * 'a) option
val for_alli : ?i:int -> (int -> 'a -> bool) -> 'a list -> bool
val for_all_succ : ?nil:(unit -> bool) -> ?fst:('a -> bool) -> ?lst:('a -> bool) -> ('a -> 'a -> bool) -> 'a list -> bool
val sort_fst : ('a -> 'a -> int) -> ('a * 'b) list -> ('a * 'b) list
val stable_sort_fst : ('a -> 'a -> int) -> ('a * 'b) list -> ('a * 'b) list
val lexsort_fst : ('a -> 'a -> int) -> ('a * 'b) list -> 'b list list
val whichsort : int -> int -> ('a -> int * 'b) -> 'a list -> 'b list array
val lexsort_atree : ?rev:bool -> ('a -> 'a -> int) -> ('a list * 'b) list -> ('a, 'b list) Tree.atrees
val leaves_atree : ?carry:'b list -> ('a, 'b) Tree.atree -> 'b list
val leaves_atrees : ?carry:'b list -> ('a, 'b) Tree.atrees -> 'b list
val lexsort : ?rev:bool -> ('a -> 'a -> int) -> ('a list * 'b) list -> 'b list list
val is_nil : 'a list -> bool
val move_map : int -> ('a -> 'b) -> 'a list -> 'b list -> 'a list * 'b list
val flatten_pair : ('a * 'a) list -> 'a list
val rev_flatten_pair : ?carry:'a list -> ('a * 'a) list -> 'a list
val enum_pick : 'a list -> ('a * 'a list) list
val enum_permut : 'a list -> 'a list list
val enum_permut_int : int -> int list list
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct