package colibri2

  1. Overview
  2. Docs
package colibri2
Legend:
Library
Module
Module type
Parameter
Class
Class type
val singleton : 'a -> 'a list

val add : 'a -> 'a list -> 'a list

::

val rev_map_fold_left : ('acc -> 'a -> 'acc * 'b) -> 'acc -> 'a list -> 'acc * 'b list
val map_fold_left : ('acc -> 'a -> 'acc * 'b) -> 'acc -> 'a list -> 'acc * 'b list
val equal : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val compare : ('a -> 'a -> int) -> 'a list -> 'a list -> int
val cons : ('a -> 'b) -> 'b list -> 'a -> 'b list
val map_join_left : ('a -> 'b) -> ('b -> 'b -> 'b) -> 'a list -> 'b
val apply : ('a -> 'b list) -> 'a list -> 'b list

apply f [a1;..;an] returns (f a1)@...@(f an)

val fold_product : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b list -> 'c list -> 'a

fold_product f acc l1 l2 apply the function f with the accumulator acc on all the pair of elements of l1 and l2 tail-recursive

val fold_product_l : ('a -> 'b list -> 'a) -> 'a -> 'b list list -> 'a

generalisation of Lists.fold_product not tail-recursive

val product : 'b list -> 'c list -> ('b * 'c) list

product l1 l2 create on all the pair of elements of l1 and l2 tail-recursive

val flatten_rev : 'a list list -> 'a list
val part : ('a -> 'a -> int) -> 'a list -> 'a list list

part cmp l returns the list of the congruence classes with respect to cmp. They are returned in reverse order

val first : ('a -> 'b option) -> 'a list -> 'b

first f l returns the first result of the application of f to an element of l which doesn't return None. raise Not_found if all the element of l return None

val find_nth : ('a -> bool) -> 'a list -> int

find_nth p l returns the index of the first element that satifies the predicate p. raise Not_found if no element of l verify the predicate

val first_nth : ('a -> 'b option) -> 'a list -> int * 'b

The combinaison of list_first and list_find_nth.

val mapi : (int -> 'a -> 'b) -> 'a list -> 'b list
val iteri : (int -> 'a -> unit) -> 'a list -> unit
val fold_lefti : ('a -> int -> 'b -> 'a) -> 'a -> 'b list -> 'a

similar to List.map, List.iter and List.fold_left, but with element index passed as extra argument (in 0..len-1)

val prefix : int -> 'a list -> 'a list

the first n elements of a list

val chop : int -> 'a list -> 'a list

removes the first n elements of a list; raises Invalid_argument if the list is not long enough

val chop_last : 'a list -> 'a list * 'a

removes (and returns) the last element of a list

val last_rev : int -> 'a list -> 'a list * 'a list * int

return :

  • the reverse the last n elements of a list;
  • return the remaining part of the list.
  • if the list is not long enough return the number of elements needed ( 0 otherwise )
val hash : ('a -> int) -> int -> 'a list -> int
val filter_map_homo : ('a -> 'a option) -> 'a list -> 'a list
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct