package containers

You can search for identifiers within the package.

in-package search v0.2.0

A modular, clean and powerful extension of the OCaml standard library

Install

Dune Dependency

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

Authors

S

Simon Cruanes

Maintainers

S

simon.cruanes.2007@m4x.org

Sources

v2.8.1.tar.gz

md5=d84e09c5d0abc501aa17cd502e31a038

sha512=8b832f4ada6035e80d81be0cfb7bdffb695ec67d465ed6097a144019e2b8a8f909095e78019c3da2d8181cc3cd730cd48f7519e87d3162442562103b7f36aabb

doc/containers.data/CCBijection/module-type-S/index.html

Module type `CCBijection.S`Source

Sourcetype t

Sourcetype left

Sourcetype right

Sourceval empty : t

Sourceval is_empty : t -> bool

Sourceval equal : t -> t -> bool

Sourceval compare : t -> t -> int

Sourceval add : left -> right -> t -> t

Add left and right correspondence to bijection such that left and right are unique in their respective sets and only correspond to each other.

Sourceval cardinal : t -> int

Number of bindings. O(n) time.

Sourceval mem : left -> right -> t -> bool

Check both sides for key membership.

Sourceval mem_left : left -> t -> bool

Check for membership of correspondence using left key.

Sourceval mem_right : right -> t -> bool

Check for membership of correspondence using right key.

Sourceval find_left : left -> t -> right

raises Not_found
if left is not found.

Sourceval find_right : right -> t -> left

raises Not_found
if right is not found.

Sourceval remove : left -> right -> t -> t

Remove the left, right binding if it exists. Return the same bijection otherwise.

Sourceval remove_left : left -> t -> t

Remove the binding with left key if it exists. Return the same bijection otherwise.

Sourceval remove_right : right -> t -> t

Remove the binding with right key if it exists. Return the same bijection otherwise.

Sourceval list_left : t -> (left * right) list

Return the bindings as a list of (left, right) values.

Sourceval list_right : t -> (right * left) list

Return the bindings as a list of (right, left) values.

Sourceval add_seq : (left * right) sequence -> t -> t

Sourceval of_seq : (left * right) sequence -> t

Sourceval to_seq : t -> (left * right) sequence

Sourceval add_list : (left * right) list -> t -> t

Sourceval of_list : (left * right) list -> t

Sourceval to_list : t -> (left * right) list