package spotlib

  1. Overview
  2. Docs
include Monad.T with type 'a t := 'a Stdlib.Lazy.t
val return : 'a -> 'a Stdlib.Lazy.t
val bind : 'a Stdlib.Lazy.t -> ('a -> 'b Stdlib.Lazy.t) -> 'b Stdlib.Lazy.t
val fmap : ('a -> 'b) -> 'a Stdlib.Lazy.t -> 'b Stdlib.Lazy.t

fmap in Haskell

val liftM : ('a -> 'b) -> 'a Stdlib.Lazy.t -> 'b Stdlib.Lazy.t

synonym of fmap

val fmap2 : ('a -> 'b -> 'c) -> 'a Stdlib.Lazy.t -> 'b Stdlib.Lazy.t -> 'c Stdlib.Lazy.t

fmap2 in Haskell

val liftM2 : ('a -> 'b -> 'c) -> 'a Stdlib.Lazy.t -> 'b Stdlib.Lazy.t -> 'c Stdlib.Lazy.t

synonym of fmap2

val void : 'a Stdlib.Lazy.t -> unit Stdlib.Lazy.t
val seq : 'a Stdlib.Lazy.t list -> 'a list Stdlib.Lazy.t

sequence in Haskell. Not tail recursive.

val seq_ : unit Stdlib.Lazy.t list -> unit Stdlib.Lazy.t

sequence_ in Haskell. Not tail recursive.

val mapM : ('a -> 'b Stdlib.Lazy.t) -> 'a list -> 'b list Stdlib.Lazy.t

Not tail recursive by default

val mapM_ : ('a -> unit Stdlib.Lazy.t) -> 'a list -> unit Stdlib.Lazy.t

Not tail recursive by default

val iteri : (int -> 'a -> unit Stdlib.Lazy.t) -> 'a list -> unit Stdlib.Lazy.t

Iteration with index starting from 0. Not tail recursive by default

val for_ : int -> int -> (int -> unit Stdlib.Lazy.t) -> unit Stdlib.Lazy.t

for like iteration. Not tail recursive by default

val join : 'a Stdlib.Lazy.t Stdlib.Lazy.t -> 'a Stdlib.Lazy.t
val (!!) : 'a Stdlib.Lazy.t -> 'a

Same as Lazy.force

val eager : 'a -> 'a Stdlib.Lazy.t
val from_val : 'a -> 'a Stdlib.Lazy.t
val peek : 'a Stdlib.Lazy.t -> 'a option
val is_val : 'a Stdlib.Lazy.t -> bool
val detuple : ('a * 'b) Stdlib.Lazy.t -> 'a Stdlib.Lazy.t * 'b Stdlib.Lazy.t
OCaml

Innovation. Community. Security.