package baby

You can search for identifiers within the package.

in-package search v0.2.0

Fast sets based on balanced binary search trees

Install

md5=2f74310d5ed0396592c92982a9181f17

sha512=927eab8e31f05427b54732b80fe81431606a720979dbc6a67ed1bf42e3581a6d76580440bee0835fac8342e8b1407f685ee5ca6d1f78b5e0e576344525f4e525

module E : OrderedType

Sourcemodule Set : SET with type elt = E.t

Sourcemodule Map : MAP with type key = E.t

Sourceval domain : 'a Map.t -> Set.t

domain m returns the domain of the map m, that is, the set of all keys for which there is a binding in the map m.

Time complexity: $O(n)$ , where $n$ is the size of the map m.

Sourceval lift : (Map.key -> 'a) -> Set.t -> 'a Map.t

lift f s returns a map whose domain is the set s and where every key x in the set s is mapped to the value f x.

Time complexity: $O(n)$ , where $n$ is the size of the set s.

On This Page