@@ -33,18 +33,6 @@ val is_empty : _ t -> bool
3333(* * [is_empty l] returns [true] iff [l = []].
3434 @since 0.11 *)
3535
36- val map : ('a -> 'b ) -> 'a t -> 'b t
37- (* * [map f [a0; a1; …; an]] applies function [f] in turn to [a0; a1; …; an].
38- Safe version of {!List.map}. *)
39-
40- val ( > |= ) : 'a t -> ('a -> 'b) -> 'b t
41- (* * [l >|= f] is the infix version of [map] with reversed arguments.
42- @since 0.5 *)
43-
44- val append : 'a t -> 'a t -> 'a t
45- (* * [append l1 l2] returns the list that is the concatenation of [l1] and [l2].
46- Safe version of {!List.append}. *)
47-
4836val cons_maybe : 'a option -> 'a t -> 'a t
4937(* * [cons_maybe (Some x) l] is [x :: l].
5038 [cons_maybe None l] is [l].
@@ -55,21 +43,6 @@ val cons' : 'a t -> 'a -> 'a t
5543 functions such as {!List.fold_left} or {!Array.fold_left}.
5644 @since 3.3 *)
5745
58- val ( @ ) : 'a t -> 'a t -> 'a t
59- (* * [l1 @ l2] is like [append l1 l2].
60- Concatenate the two lists [l1] and [l2]. *)
61-
62- val filter : ('a -> bool ) -> 'a t -> 'a t
63- (* * [filter p l] returns all the elements of the list [l]
64- that satisfy the predicate [p]. The order of the elements
65- in the input list [l] is preserved.
66- Safe version of {!List.filter}. *)
67-
68- val fold_right : ('a -> 'b -> 'b ) -> 'a t -> 'b -> 'b
69- (* * [fold_right f [a1; …; an] b] is
70- [f a1 (f a2 ( … (f an b) … ))].
71- Safe version of {!List.fold_right}. *)
72-
7346val fold_while : ('a -> 'b -> 'a * [ `Stop | `Continue ]) -> 'a -> 'b t -> 'a
7447(* * [fold_while f init l] folds until a stop condition via [('a, `Stop)] is
7548 indicated by the accumulator.
@@ -408,18 +381,9 @@ val mguard : bool -> unit t
408381 ]}
409382 @since 3.1 *)
410383
411- val ( < *> ) : ('a -> 'b) t -> 'a t -> 'b t
412- (* * [funs <*> l] is [product (fun f x -> f x) funs l]. *)
413-
414- val ( < $> ) : ('a -> 'b) -> 'a t -> 'b t
415- (* * [(<$>)] is [map]. *)
416-
417384val return : 'a -> 'a t
418385(* * [return x] is [x]. *)
419386
420- val ( >> = ) : 'a t -> ('a -> 'b t) -> 'b t
421- (* * [l >>= f] is [flat_map f l]. *)
422-
423387val take : int -> 'a t -> 'a t
424388(* * [take n l] takes the [n] first elements of the list [l], drop the rest. *)
425389
@@ -722,15 +686,6 @@ val range' : int -> int -> int t
722686(* * [range' i j] is like {!range} but the second bound [j] is excluded.
723687 For instance [range' 0 5 = [0;1;2;3;4]]. *)
724688
725- val ( -- ) : int -> int -> int t
726- (* * [i -- j] is the list of integers from [i] to [j] included.
727- Infix alias for [range]. *)
728-
729- val ( --^ ) : int -> int -> int t
730- (* * [i --^ j] is the list of integers from [i] to [j] excluded.
731- Infix alias for [range'].
732- @since 0.17 *)
733-
734689val replicate : int -> 'a -> 'a t
735690(* * [replicate n x] replicates the given element [x] [n] times. *)
736691
0 commit comments