You can search for identifiers within the package.
in-package search v0.2.0
val flatten : 'a list list -> 'a list
val sum : int list -> int
val floatSum : float list -> float
val float_sum : float list -> float
val map : f:('a -> 'b) -> 'a list -> 'b list
val indexedMap : f:(int -> 'a -> 'b) -> 'a list -> 'b list
val indexed_map : f:(int -> 'a -> 'b) -> 'a list -> 'b list
val mapi : f:(int -> 'a -> 'b) -> 'a list -> 'b list
val map2 : f:('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val getBy : f:('a -> bool) -> 'a list -> 'a option
val get_by : f:('a -> bool) -> 'a list -> 'a option
val find : f:('a -> bool) -> 'a list -> 'a option
val elemIndex : value:int -> int list -> int option
val elem_index : value:int -> int list -> int option
val last : 'a list -> 'a option
val member : value:'a -> 'a list -> bool
val uniqueBy : f:('a -> string) -> 'a list -> 'a list
val unique_by : f:('a -> string) -> 'a list -> 'a list
val getAt : index:int -> 'a list -> 'a option
val get_at : index:int -> 'a list -> 'a option
val any : f:('a -> bool) -> 'a list -> bool
val head : 'a list -> 'a option
val drop : count:int -> 'a list -> 'a list
val init : 'a list -> 'a list option
val filterMap : f:('a -> 'b option) -> 'a list -> 'b list
val filter_map : f:('a -> 'b option) -> 'a list -> 'b list
val filter : f:('a -> bool) -> 'a list -> 'a list
val concat : 'a list list -> 'a list
val partition : f:('a -> bool) -> 'a list -> 'a list * 'a list
val foldr : f:('a -> 'b -> 'b) -> init:'b -> 'a list -> 'b
val foldl : f:('a -> 'b -> 'b) -> init:'b -> 'a list -> 'b
val findIndex : f:('a -> bool) -> 'a list -> int option
val find_index : f:('a -> bool) -> 'a list -> int option
val take : count:int -> 'a list -> 'a list
val updateAt : index:int -> f:('a -> 'a) -> 'a list -> 'a list
val update_at : index:int -> f:('a -> 'a) -> 'a list -> 'a list
val length : 'a list -> int
val reverse : 'a list -> 'a list
val dropWhile : f:('a -> bool) -> 'a list -> 'a list
val drop_while : f:('a -> bool) -> 'a list -> 'a list
val isEmpty : 'a list -> bool
val is_empty : 'a list -> bool
val cons : 'a -> 'a list -> 'a list
val takeWhile : f:('a -> bool) -> 'a list -> 'a list
val take_while : f:('a -> bool) -> 'a list -> 'a list
val all : f:('a -> bool) -> 'a list -> bool
val tail : 'a list -> 'a list option
val append : 'a list -> 'a list -> 'a list
val removeAt : index:int -> 'a list -> 'a list
val remove_at : index:int -> 'a list -> 'a list
val minimumBy : f:('a -> 'comparable) -> 'a list -> 'a option
val minimum_by : f:('a -> 'comparable) -> 'a list -> 'a option
val maximumBy : f:('a -> 'comparable) -> 'a list -> 'a option
val maximum_by : f:('a -> 'comparable) -> 'a list -> 'a option
val maximum : 'comparable list -> 'comparable option
val sortBy : f:('a -> 'b) -> 'a list -> 'a list
val sort_by : f:('a -> 'b) -> 'a list -> 'a list
val span : f:('a -> bool) -> 'a list -> 'a list * 'a list
val groupWhile : f:('a -> 'a -> bool) -> 'a list -> 'a list list
val group_while : f:('a -> 'a -> bool) -> 'a list -> 'a list list
val splitAt : index:int -> 'a list -> 'a list * 'a list
val split_at : index:int -> 'a list -> 'a list * 'a list
val insertAt : index:int -> value:'a -> 'a list -> 'a list
val insert_at : index:int -> value:'a -> 'a list -> 'a list
val splitWhen : f:('a -> bool) -> 'a list -> ('a list * 'a list) option
val split_when : f:('a -> bool) -> 'a list -> ('a list * 'a list) option
val intersperse : 'a -> 'a list -> 'a list
val initialize : int -> (int -> 'a) -> 'a list
val sortWith : ('a -> 'a -> int) -> 'a list -> 'a list
val sort_with : ('a -> 'a -> int) -> 'a list -> 'a list
val iter : f:('a -> unit) -> 'a list -> unit