package enumerators

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
type 'a t
exception Out_of_bounds
val nth : 'a t -> int64 -> 'a
val elements : 'a t -> 'a list
val size : 'a t -> int64
val size_int : 'a t -> int
val is_empty : 'a t -> bool
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val iter : ('a -> unit) -> 'a t -> unit
val memoize : 'a t -> 'a t
val make : 'a list -> 'a t
val of_list : 'a list -> 'a t
type (!'t, !'elt) set = (module Set.S with type elt = 'elt and type t = 't)
val of_set : ('t, 'elt) set -> 't -> 'elt t
val empty : 'a t
val constant : 'a -> 'a t
val constant_delayed : (unit -> 'a) -> 'a t
val range : int -> int -> int t
val firstn : int64 -> 'a t -> 'a list * 'a t
val filter : ('a -> bool) -> 'a t -> 'a t
val partition : ('a -> bool) -> 'a t -> 'a t * 'a t
val shuffle : 'a t -> 'a t
val scalar_left : 'a -> 'b t -> ('a * 'b) t
val scalar_right : 'a t -> 'b -> ('a * 'b) t
val bitset : ?k:int -> int -> int t
val append : 'a t -> 'a t -> 'a t
val interleave : 'a t -> 'a t -> 'a t
val product : 'a t -> 'b t -> ('a * 'b) t
val squash : 'a t t -> 'a t
val round_robin : 'a t t -> 'a t
val subset : ?k:int -> 'a t list -> 'a list t t
val choose_k_from_list : k:int -> 'a t list -> 'a list t t
val maybe : ('a -> 'a) -> 'a t -> 'a t
val maybe_cons : 'a -> 'a list t -> 'a list t
val maybe_some_of : k:int -> 'a list -> 'a list t -> 'a list t
val depth : 'a t -> int
OCaml

Innovation. Community. Security.