package spotlib

  1. Overview
  2. Docs
package spotlib
Legend:
Library
Module
Module type
Parameter
Class
Class type
include Monad.T with type 'a t := 'a Lazy.t
include Monad_intf.S1 with type 'a t := 'a Lazy.t
val return : 'a -> 'a Lazy.t
val bind : 'a Lazy.t -> ('a -> 'b Lazy.t) -> 'b Lazy.t
include Monad_intf.EX1 with type 'a t := 'a Lazy.t
val fmap : ('a -> 'b) -> 'a Lazy.t -> 'b Lazy.t

fmap in Haskell

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

synonym of fmap

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

fmap2 in Haskell

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

synonym of fmap2

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

sequence in Haskell. Not tail recursive.

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

sequence_ in Haskell. Not tail recursive.

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

Not tail recursive

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

Not tail recursive

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

Iteration with index starting from 0. Not tail recursive.

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

for like iteration. Not tail recursive

val join : 'a Lazy.t Lazy.t -> 'a Lazy.t
include Monad_intf.Infix1 with type 'a t := 'a Lazy.t
val (>>=) : 'a Lazy.t -> ('a -> 'b Lazy.t) -> 'b Lazy.t

synonym of bind

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

synonum of fmap, with the flipped arguments

Applicative style binops

val (^<$>) : ('a -> 'b) -> 'a Lazy.t -> 'b Lazy.t

same as map, <$> in Haskell

val (/<*>) : ('a -> 'b) Lazy.t -> 'a Lazy.t -> 'b Lazy.t

<*> in Haskell

module S : Monad_intf.S1 with type 'a t := 'a Lazy.t
module EX : Monad_intf.EX1 with type 'a t := 'a Lazy.t
module Infix : Monad_intf.Infix1 with type 'a t := 'a Lazy.t
val (!!) : 'a Lazy.t -> 'a

Same as Lazy.force

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