package containers

  1. Overview
  2. Docs
A modular, clean and powerful extension of the OCaml standard library

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (23)

Authors

  1. S
    Simon Cruanes

Maintainers

  1. S
    simon.cruanes.2007@m4x.org

Sources

v2.8.tar.gz
md5=03b80e963186e91ddac62ef645bf7fb2
sha512=c8f434808be540c16926bf03d89f394d33fc2d092f963a7b6d412481229e0a96290f1ad7c7d522415115d35426b7aa0b3fda4b991ddc321dad279d402c9a0c0b

doc/containers.data/CCMultiSet/Make/index.html

Module CCMultiSet.MakeSource

Parameters

Signature

Sourcetype elt = O.t
Sourcetype t
Sourceval empty : t
Sourceval is_empty : t -> bool
Sourceval mem : t -> elt -> bool
Sourceval count : t -> elt -> int
Sourceval singleton : elt -> t
Sourceval add : t -> elt -> t
Sourceval remove : t -> elt -> t
Sourceval add_mult : t -> elt -> int -> t

add_mult set x n adds n occurrences of x to set.

  • since 0.6
Sourceval remove_mult : t -> elt -> int -> t

remove_mult set x n removes at most n occurrences of x from set.

  • since 0.6
Sourceval remove_all : t -> elt -> t

remove_all set x removes all occurrences of x from set.

  • since 0.22
Sourceval update : t -> elt -> (int -> int) -> t

update set x f calls f n where n is the current multiplicity of x in set (0 to indicate its absence); the result of f n is the new multiplicity of x.

  • since 0.6
Sourceval min : t -> elt

Minimal element w.r.t the total ordering on elements.

Sourceval max : t -> elt

Maximal element w.r.t the total ordering on elements.

Sourceval union : t -> t -> t

union a b contains as many occurrences of an element x as count a x + count b x.

Sourceval meet : t -> t -> t

meet a b is a multiset such that count (meet a b) x = max (count a x) (count b x).

Sourceval intersection : t -> t -> t

intersection a b is a multiset such that count (intersection a b) x = min (count a x) (count b x).

Sourceval diff : t -> t -> t

MultiSet difference. count (diff a b) x = max (count a x - count b x) 0.

Sourceval contains : t -> t -> bool

contains a x = (count m x > 0).

Sourceval compare : t -> t -> int
Sourceval equal : t -> t -> bool
Sourceval cardinal : t -> int

Number of distinct elements.

Sourceval iter : t -> (int -> elt -> unit) -> unit
Sourceval fold : t -> 'b -> ('b -> int -> elt -> 'b) -> 'b
Sourceval of_list : elt list -> t
Sourceval to_list : t -> elt list
Sourceval to_seq : t -> elt sequence
Sourceval of_seq : elt sequence -> t
Sourceval of_list_mult : (elt * int) list -> t
  • since 0.19
Sourceval to_list_mult : t -> (elt * int) list
  • since 0.19
Sourceval to_seq_mult : t -> (elt * int) sequence
  • since 0.19
Sourceval of_seq_mult : (elt * int) sequence -> t
  • since 0.19