Module `IStdlib.RevList`

type 'a t

val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

val empty : 'a t: Return empty list

val cons : 'a -> 'a t -> 'a t: Add an element to the end of list

val to_list : 'a t -> 'a list: Return normal-ordered list

val of_list : 'a list -> 'a t: Make reverse-ordered list from normal-ordered one

val exists : 'a t -> f:('a -> bool) -> bool: Similar to List.exists

val map : 'a t -> f:('a -> 'b) -> 'b t: Similar to List.map

val rev_map : 'a t -> f:('a -> 'b) -> 'b list: Similar to List.rev_map, so return normal-ordered list

val rev_map_append : 'a t -> 'b list -> f:('a -> 'b) -> 'b list: Similar to List.rev_map_append

val rev_partition_map : 'a t -> f:('a -> ('b, 'c) IStdlib.IStd.Either.t) -> 'b list * 'c list: Similar to List.partition_map, but return normal-ordered lists