Module `CCList.Infix`

val (>|=) : 'a t -> ('a -> 'b) -> 'b t: l >|= f is the infix version of map with reversed arguments.

val (@) : 'a t -> 'a t -> 'a t: l1 @ l2 concatenates two lists l1 and l2. As append.

val (<*>) : ('a -> 'b) t -> 'a t -> 'b t: funs <*> l is product (fun f x -> f x) funs l.

val (<$>) : ('a -> 'b) -> 'a t -> 'b t: f <$> l is like map.

val (>>=) : 'a t -> ('a -> 'b t) -> 'b t: l >>= f is flat_map f l.

val (--) : int -> int -> int t: i -- j is the infix alias for range. Bounds included.

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

i --^ j is the infix alias for range'. Second bound j excluded.

since: 0.17

Let operators on OCaml >= 4.08.0, nothing otherwise

since: 2.8

include CCShimsMkLet_.S with type 'a t_let := 'a list

type 'a t_let

val let+ : 'a t_let -> ('a -> 'b) -> 'b t_let
val and+ : 'a t_let -> 'b t_let -> ('a * 'b) t_let
val let* : 'a t_let -> ('a -> 'b t_let) -> 'b t_let
val and* : 'a t_let -> 'b t_let -> ('a * 'b) t_let

include CCShimsMkLetList_.S

val and& : 'a list -> 'b list -> ('a * 'b) list

(and&) is combine_shortest. It allows to perform a synchronized product between two lists, stopping gently at the shortest. Usable both with let+ and let*.

# let f xs ys zs =
    let+ x = xs
    and& y = ys
    and& z = zs in
    x + y + z;;
val f : int list -> int list -> int list -> int list = <fun>
# f [1;2] [5;6;7] [10;10];;
- : int list = [16; 18]

since: 3.1