diff --git a/dev/index.html b/dev/index.html index 34d946a..61e6bf0 100644 --- a/dev/index.html +++ b/dev/index.html @@ -11,7 +11,7 @@

OCaml package documentation

    -
  1. iter 1.6
    2. +
  2. iter 1.7
diff --git a/dev/iter/Iter/Infix/index.html b/dev/iter/Iter/Infix/index.html index 036862f..27e638b 100644 --- a/dev/iter/Iter/Infix/index.html +++ b/dev/iter/Iter/Infix/index.html @@ -1,2 +1,2 @@ -Infix (iter.Iter.Infix)

Module Iter.Infix

val (--) : int -> int -> int t

a -- b is the range of integers from a to b, both included, in increasing order. It will therefore be empty if a > b.

val (--^) : int -> int -> int t

a --^ b is the range of integers from b to a, both included, in decreasing order (starts from a). It will therefore be empty if a < b.

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

Monadic bind (infix version of flat_map

  • since 0.5
val (>|=) : 'a t -> ('a -> 'b) -> 'b t

Infix version of map

  • since 0.5
val (<*>) : ('a -> 'b) t -> 'a t -> 'b t

Applicative operator (product+application)

  • since 0.5
val (<+>) : 'a t -> 'a t -> 'a t

Concatenation of iterators

  • since 0.5
val let+ : 'a t -> ('a -> 'b) -> 'b t

Alias for map

  • since NEXT_RELEASE
val and+ : 'a t -> 'b t -> ('a * 'b) t

Alias for product

  • since NEXT_RELEASE
val let* : 'a t -> ('a -> 'b t) -> 'b t

Alias for flat_map

  • since NEXT_RELEASE
val and* : 'a t -> 'b t -> ('a * 'b) t

Alias for product

  • since NEXT_RELEASE
\ No newline at end of file +Infix (iter.Iter.Infix)

Module Iter.Infix

val (--) : int -> int -> int t

a -- b is the range of integers from a to b, both included, in increasing order. It will therefore be empty if a > b.

val (--^) : int -> int -> int t

a --^ b is the range of integers from b to a, both included, in decreasing order (starts from a). It will therefore be empty if a < b.

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

Monadic bind (infix version of flat_map

  • since 0.5
val (>|=) : 'a t -> ('a -> 'b) -> 'b t

Infix version of map

  • since 0.5
val (<*>) : ('a -> 'b) t -> 'a t -> 'b t

Applicative operator (product+application)

  • since 0.5
val (<+>) : 'a t -> 'a t -> 'a t

Concatenation of iterators

  • since 0.5
val let+ : 'a t -> ('a -> 'b) -> 'b t

Alias for map

  • since 1.7
val and+ : 'a t -> 'b t -> ('a * 'b) t

Alias for product

  • since 1.7
val let* : 'a t -> ('a -> 'b t) -> 'b t

Alias for flat_map

  • since 1.7
val and* : 'a t -> 'b t -> ('a * 'b) t

Alias for product

  • since 1.7
\ No newline at end of file diff --git a/dev/iter/Iter/index.html b/dev/iter/Iter/index.html index a097beb..41300e5 100644 --- a/dev/iter/Iter/index.html +++ b/dev/iter/Iter/index.html @@ -31,7 +31,7 @@ let () = Random.self_init () (* Generate random values. *) -let l = Iter.random_int 1000 |> Iter.take 3 |> Iter.to_list

Infix functions

module Infix : sig ... end
include module type of Infix
val (--) : int -> int -> int t

a -- b is the range of integers from a to b, both included, in increasing order. It will therefore be empty if a > b.

val (--^) : int -> int -> int t

a --^ b is the range of integers from b to a, both included, in decreasing order (starts from a). It will therefore be empty if a < b.

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

Monadic bind (infix version of flat_map

  • since 0.5
val (>|=) : 'a t -> ('a -> 'b) -> 'b t

Infix version of map

  • since 0.5
val (<*>) : ('a -> 'b) t -> 'a t -> 'b t

Applicative operator (product+application)

  • since 0.5
val (<+>) : 'a t -> 'a t -> 'a t

Concatenation of iterators

  • since 0.5
val let+ : 'a t -> ('a -> 'b) -> 'b t

Alias for map

  • since NEXT_RELEASE
val and+ : 'a t -> 'b t -> ('a * 'b) t

Alias for product

  • since NEXT_RELEASE
val let* : 'a t -> ('a -> 'b t) -> 'b t

Alias for flat_map

  • since NEXT_RELEASE
val and* : 'a t -> 'b t -> ('a * 'b) t

Alias for product

  • since NEXT_RELEASE

Pretty printing

val pp_seq : +let l = Iter.random_int 1000 |> Iter.take 3 |> Iter.to_list

Infix functions

module Infix : sig ... end
include module type of Infix
val (--) : int -> int -> int t

a -- b is the range of integers from a to b, both included, in increasing order. It will therefore be empty if a > b.

val (--^) : int -> int -> int t

a --^ b is the range of integers from b to a, both included, in decreasing order (starts from a). It will therefore be empty if a < b.

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

Monadic bind (infix version of flat_map

  • since 0.5
val (>|=) : 'a t -> ('a -> 'b) -> 'b t

Infix version of map

  • since 0.5
val (<*>) : ('a -> 'b) t -> 'a t -> 'b t

Applicative operator (product+application)

  • since 0.5
val (<+>) : 'a t -> 'a t -> 'a t

Concatenation of iterators

  • since 0.5
val let+ : 'a t -> ('a -> 'b) -> 'b t

Alias for map

  • since 1.7
val and+ : 'a t -> 'b t -> ('a * 'b) t

Alias for product

  • since 1.7
val let* : 'a t -> ('a -> 'b t) -> 'b t

Alias for flat_map

  • since 1.7
val and* : 'a t -> 'b t -> ('a * 'b) t

Alias for product

  • since 1.7

Pretty printing

val pp_seq : ?sep:string -> (Stdlib.Format.formatter -> 'a -> unit) -> Stdlib.Format.formatter ->