module Make:
Container.Make
is to bind the resulting module and to
explicitly import each of the functions that one wants:
module C = Container.Make (struct ... end)
let count = C.count
let exists = C.exists
let find = C.find
...
This is preferable to:
include Container.Make (struct ... end)
because the include
makes it too easy to shadow specialized implementations of
container functions (length
being a common one).
Parameters: |
|
type 'a
t
val mem : ?equal:('a -> 'a -> bool) -> 'a t -> 'a -> bool
equal
is not providedval length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold : 'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
fold t ~init ~f
returns f (... f (f (f init e1) e2) e3 ...) en
, where e1..en
are the elements of t
val exists : 'a t -> f:('a -> bool) -> bool
true
if and only if there exists an element for which the provided
function evaluates to true
. This is a short-circuiting operation.val for_all : 'a t -> f:('a -> bool) -> bool
true
if and only if the provided function evaluates to true
for all
elements. This is a short-circuiting operation.val count : 'a t -> f:('a -> bool) -> int
val sum : (module Commutative_group.S with type t = 'sum) ->
'a t -> f:('a -> 'sum) -> 'sum
f i
for i in the containerval find : 'a t -> f:('a -> bool) -> 'a option
option
the first element for which f
evaluates to true.val find_map : 'a t -> f:('a -> 'b option) -> 'b option
f
that returns Some
, and returns None
if there
is no such element.val to_list : 'a t -> 'a list
val to_array : 'a t -> 'a array
val min_elt : 'a t -> cmp:('a -> 'a -> int) -> 'a option
cmp
function, or None
if the collection is empty. In case of a tie, the first
element encountered while traversing the collection is returned. The implementation
uses fold
so it has the same complexity as fold
.val max_elt : 'a t -> cmp:('a -> 'a -> int) -> 'a option