monadlib 0.2 · OCaml Package

An alternative to the batteries lazy list library, with generally improved laziness.

author Phil Scott

Types

type 'a t = 'a node_t Lazy.t

and 'a node_t =

| Nil
| Cons of 'a * 'a t

Creation

val nil : 'a t

val singleton : 'a -> 'a t

val repeat : 'a -> 'a t

A constant stream of the input.

val from : (unit -> 'a) -> 'a t

A list whose elements come from unit-delayed expressions.

val of_list : 'a list -> 'a t

Convert an eager list to a lazy one.

val range : int -> int -> int t

The lazy list of values 0..n

val unfold : 'a -> ('a -> ('b * 'a) option) -> 'b t

Create a list using a function representing the body of a loop. The loop terminates when the body returns None.

val (^:^) : 'a -> 'a t -> 'a t

Binary cons operator.

Access

val hd : 'a t -> 'a

Predicates

val is_empty : 'a t -> bool

val is_non_empty : 'a t -> bool

val any : ('a -> bool) -> 'a t -> bool

Tests whether any element of the list is satisfied by a predicate.

val all : ('a -> bool) -> 'a t -> bool

Tests whether every element of the list is satisfied by a predicate.

Transformations

val cons : 'a -> 'a t -> 'a t

val (^@^) : 'a t -> 'a t -> 'a t

Append

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

val filter : ('a -> bool) -> 'a t -> 'a t

val filter_map : ('a -> 'b option) -> 'a t -> 'b t

Maps a partial function.

val take : int -> 'a t -> 'a t

val drop : int -> 'a t -> 'a t

val take_while : ('a -> bool) -> 'a t -> 'a t

Take elements to the first element for which the predicate fails.

val drop_while : ('a -> bool) -> 'a t -> 'a t

Drop elements until the first element for which the predicate fails.

val span : ('a -> bool) -> 'a t -> 'a t * 'a t

span p xs is equivalent to (take_while p xs, drop_while p xs).

val partition : ('a -> bool) -> 'a t -> 'a t * 'a t

Splits a list into those elements which satisfy a predicate and those which don't.

val combine_with : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t

Maps a binary function across corresponding elements of two lists.

val zip_with : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t

Maps a binary function across corresponding elements of two lists, up to the length of the shortest list.

val zip : 'a t -> 'b t -> ('a * 'b) t

Zip with pairing.

val unzip : ('a * 'b) t -> 'a t * 'b t

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

val fold_right1 : ('a -> 'a Lazy.t -> 'a) -> 'a t -> 'a

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

val fold_left1 : ('a -> 'a -> 'a) -> 'a t -> 'a

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

Folds but keeps successive elements.

val scan1 : ('a -> 'a -> 'a) -> 'a t -> 'a t

val map_accum_l : ('acc -> 'a -> 'acc * 'b) -> 'acc -> 'a t -> 'b t

Maps a function across a list whilst accumulating a state value.

val map_accum_l2 : 
  ('acc -> 'a -> 'acc Lazy.t * 'b) ->
  'acc ->
  'a t ->
  'acc Lazy.t * 'b t

As map_accum_l, but also returns the final accumulated value. The input list will be forced only once, even if both components of the pair are forced. However, two passes of the list are still required.

val concat : 'a t t -> 'a t

val flatten : 'a t list -> 'a t

Concatenation eager in the outer list.

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

As fun f xss -> concat (map f xs)

val inits : 'a t -> 'a t t

The prefixes of a list starting from nil.

val tails : 'a t -> 'a t t

The suffixes of a list starting from the list itself.

val interleave : 'a t -> 'a t -> 'a t

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

Non-deterministic application in lists.

Set operations

val subset : ?cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool

Tests whether every element in the first list is equivalent to the elements in the second list.

val unique : ?cmp:('a -> 'a -> bool) -> 'a t -> 'a t

Remove duplicates from a list.

val mem : ?cmp:('a -> 'a -> bool) -> 'a -> 'a t -> bool

val difference : ('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t

Based on a partial order. Any element in the first argument which is smaller than an element in the second is removed.

val union : ?cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t

val intersect : ?cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t

Retains elements in the first argument which are equivalent to some element in the second.

val intersect_class : ?cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t

Retains elements in the first argument which are equivalent to some element in the second, and vice versa.

val cat_option : 'a option t -> 'a t

Filters out all Nones and strips Somes.

val maxima : ('a -> 'a -> bool) -> 'a t -> 'a t

Reduce a list to its maxima according to the partial-order.

val nub : ('a -> 'a -> bool) -> 'a t -> 'a t

Haskell style nub.

Miscellaneous

val tl : 'a t -> 'a t

val length : 'a t -> int

val next : 'a t -> 'a node_t

Force the first node in a list.

val of_delay : (unit -> 'a t) -> 'a t

The following function is sometimes useful for defining recursive lists.

val iter : ('a -> unit) -> 'a t -> unit

Loops a side-effecting procedure over the elements of a list.

val to_list : 'a t -> 'a list

val enum : 'a t -> 'a BatEnum.t

val is_forced : 'a t -> bool

True if the whole list has been forced.

val to_forced : 'a t -> 'a t

Retrieve as much of a lazy list as has been forced to far.

val find_all : ('a -> 'b -> bool) -> 'a list -> 'b t -> 'b list

Find all elements of a set.

package monadlib