stdcompat 18 · OCaml Package

include module type of struct include Stdlib.Seq end

type !'a t = unit -> 'a node

and !'a node = 'a Stdlib__Seq.node =

| Nil
| Cons of 'a * 'a t

val empty : 'a t

val return : 'a -> 'a t

val cons : 'a -> 'a t -> 'a t

val append : 'a t -> 'a t -> 'a t

val map : ('a -> 'b) -> 'a t -> 'b t

val filter : ('a -> bool) -> 'a t -> 'a t

val filter_map : ('a -> 'b option) -> 'a t -> 'b t

val concat : 'a t t -> 'a t

val flat_map : ('a -> 'b t) -> 'a t -> 'b t

val concat_map : ('a -> 'b t) -> 'a t -> 'b t

val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a

val iter : ('a -> unit) -> 'a t -> unit

val unfold : ('b -> ('a * 'b) option) -> 'b -> 'a t

val is_empty : (unit -> 'a node) -> bool

val uncons : (unit -> 'a node) -> ('a * 'a t) option

val length_rec : int -> 'a t -> int

val length : 'a t -> int

val iteri : (int -> 'a -> 'b) -> 'a t -> unit

val fold_lefti : ('a -> int -> 'b -> 'a) -> 'a -> 'b t -> 'a

val for_all : ('a -> bool) -> 'a t -> bool

val exists : ('a -> bool) -> 'a t -> bool

val find : ('a -> bool) -> 'a t -> 'a option

val find_map : ('a -> 'b option) -> 'a t -> 'b option

val iter2 : ('a -> 'b -> 'c) -> 'a t -> 'b t -> unit

val fold_left2 : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b t -> 'c t -> 'a

val for_all2 : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool

val exists2 : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool

val equal : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool

val compare : ('a -> 'b -> int) -> 'a t -> 'b t -> int

val init : int -> (int -> 'a) -> 'a t

val repeat : 'a -> 'a t

val forever : (unit -> 'a) -> 'a t

val cycle : (unit -> 'a node) -> unit -> 'a node

val iterate1 : ('a -> 'a) -> 'a -> 'a t

val iterate : ('a -> 'a) -> 'a -> unit -> 'a node

val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t

val scan : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a t

val take_rec : int -> 'a t -> 'a t

val take : int -> 'a t -> 'a t

val drop_rec : int -> 'a t -> 'a t

val drop : int -> 'a t -> 'a t

val take_while : ('a -> bool) -> 'a t -> 'a t

val drop_while_rec : ('a -> bool) -> 'a t -> 'a node

val drop_while : ('a -> bool) -> 'a t -> unit -> 'a node

val group : ('a -> 'a -> bool) -> (unit -> 'a node) -> 'a t t

val memoize : 'a t -> 'a t

exception Forced_twice

val once : 'a t -> 'a t

val transpose : (unit -> 'a t node) -> (unit -> 'a node) t

val zip : 'a t -> 'b t -> ('a * 'b) t

val map2 : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t

val interleave : 'a t -> 'a t -> 'a t

val sorted_merge1l : ('a -> 'a -> int) -> 'a node -> 'a -> 'a t -> 'a t -> 'a t

val sorted_merge1r : ('a -> 'a -> int) -> 'a t -> 'a node -> 'a -> 'a t -> 'a t

val sorted_merge1 : 
  ('a -> 'a -> int) ->
  'a node ->
  'a ->
  'a t ->
  'a node ->
  'a ->
  'a t ->
  'a node

val sorted_merge : 
  ('a -> 'a -> int) ->
  (unit -> 'a node) ->
  (unit -> 'a node) ->
  unit ->
  'a node

val map_product1 : ('a -> 'b -> 'c) -> 'a -> 'a t -> 'b t -> 'c node

val map_product : 
  ('a -> 'b -> 'c) ->
  (unit -> 'a node) ->
  'b t ->
  unit ->
  'c node

val product : (unit -> 'a node) -> 'b t -> unit -> ('a * 'b) node

val unzip : ('a * 'b) t -> 'a t * 'b t

val split : ('a * 'b) t -> 'a t * 'b t

val partition_map : ('a -> ('b, 'c) Stdlib__Either.t) -> 'a t -> 'b t * 'c t

val partition : ('a -> bool) -> 'a t -> 'a t * 'a t

val of_dispenser : (unit -> 'a option) -> 'a t

val to_dispenser : 'a t -> unit -> 'a option

val ints : int -> int t

package stdcompat