Module Js_list

module Js_list: sig .. end
Application order is left to right, tail recurisve

type 'a t = 'a list 
val length : 'a t -> int
val cons : 'a -> 'a t -> 'a t
val isEmpty : 'a t -> bool
val hd : 'a t -> 'a option
val tl : 'a t -> 'a t option
val nth : 'a t -> int -> 'a option
val revAppend : 'a t -> 'a t -> 'a t
val rev : 'a t -> 'a t
val mapRev : ([ `Arity_1 of 'a ], 'b) Js.Internal.fn -> 'a t -> 'b t
val map : ([ `Arity_1 of 'a ], 'b) Js.Internal.fn -> 'a t -> 'b t
val iter : ([ `Arity_1 of 'a ], unit) Js.Internal.fn -> 'a t -> unit
val iteri : ([ `Arity_2 of int * 'a ], unit) Js.Internal.fn -> 'a t -> unit
val foldLeft : ([ `Arity_2 of 'a * 'b ], 'a) Js.Internal.fn -> 'a -> 'b list -> 'a
Application order is left to right, tail recurisve
val foldRight : ([ `Arity_2 of 'a * 'b ], 'b) Js.Internal.fn -> 'a list -> 'b -> 'b
Application order is right to left tail-recursive.
val flatten : 'a t t -> 'a t
val filter : ([ `Arity_1 of 'a ], bool) Js.Internal.fn -> 'a t -> 'a t
val filterMap : ([ `Arity_1 of 'a ], 'b option) Js.Internal.fn ->
'a t -> 'b t
val countBy : ([ `Arity_1 of 'a ], bool) Js.Internal.fn -> 'a list -> int
val init : int -> ([ `Arity_1 of int ], 'a) Js.Internal.fn -> 'a t
val equal : ([ `Arity_2 of 'a * 'a ], bool) Js.Internal.fn -> 'a list -> 'a list -> bool