'a list t represents a list temporarily stored in the reverse of its logical order.
e.g. to represent the sequence 1 then 2 we may store 2 :: 1 :: []
val sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.tinclude Ppx_compare_lib.Comparable.S1 with type +'a t := 'a tval compare :
'a Base__Ppx_compare_lib.compare ->
'a t Base__Ppx_compare_lib.compareinclude Ppx_compare_lib.Equal.S1 with type +'a t := 'a tval equal : 'a Base__Ppx_compare_lib.equal -> 'a t Base__Ppx_compare_lib.equalval empty : 'a list tThe empty list.
to_list empty == []
/O(1)/. Add an item to the logical end of the list.
to_list (snoc xs x) == to_list xs @ [x]
val singleton : 'a -> 'a list tval of_list : 'a list -> 'a list t/O(n)/. Convert from a list, preserving the logical order.
val to_list : 'a list t -> 'a list/O(n)/. Convert to a list, preserving the logical order.
val of_list_rev : 'a list -> 'a list t/O(1)/ Convert from a list, reversing the logical order.
val to_list_rev : 'a list t -> 'a list/O(1)/ Convert to a list, reversing the logical order.
val map_to_list : ?tail:'b list -> 'a list t -> f:('a -> 'b) -> 'b list/O(n)/. Perform a map while converting to a list.
/O(n)/ where /n/ is the length of x.
map_to_list x ~f ~tail:y == List.map (to_list x) ~f @ y
The default ~tail is [].
/O(n)/ Map and append values from a list, preserving logical order.
/O(n)/ where /n/ is the length of y.
map_append x y ~f == List.fold (List.map y ~f) ~init:x ~f:snoc
include Core.Quickcheckable.S1 with type 'a t := 'a tval quickcheck_generator :
'a Base_quickcheck.Generator.t ->
'a t Base_quickcheck.Generator.tval quickcheck_observer :
'a Base_quickcheck.Observer.t ->
'a t Base_quickcheck.Observer.tval quickcheck_shrinker :
'a Base_quickcheck.Shrinker.t ->
'a t Base_quickcheck.Shrinker.tmodule Stable : sig ... end