package baby

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

Baby: Fast Sets Based on Balanced Binary Search Trees
- Library baby
  - Baby
    
    OrderedType
    
    BASE_SET
    
    BASE_MAP
    
    SET
    
    Enum
    
    MAP
    
    Enum
    
    SET_MAP
    
    Set
    
    OrderedType
    
    S
    
    Make
    
    Enum
    
    Map
    
    OrderedType
    
    S
    
    Make
    
    Enum
    
    Make
    
    Set
    
    Enum
    
    Map
    
    Enum
    
    H
    
    Set
    
    OrderedType
    
    S
    
    Make
    
    Enum
    
    Map
    
    OrderedType
    
    S
    
    Make
    
    Enum
    
    Make
    
    Set
    
    Enum
    
    Map
    
    Enum
    
    W
    
    Set
    
    OrderedType
    
    S
    
    Make
    
    Enum
    
    Map
    
    OrderedType
    
    S
    
    Make
    
    Enum
    
    Make
    
    Set
    
    Enum
    
    Map
    
    Enum
    
    Custom
    
    Set
    
    OrderedType
    
    S
    
    Make
    
    Enum
    
    Map
    
    OrderedType
    
    S
    
    Make
    
    Enum
    
    Make
    
    Set
    
    Enum
    
    Map
    
    Enum
- Sources
  - baby
    
    ArrayExtra.ml
    
    Baby.ml
    
    H.ml
    
    HeightMap.ml
    
    HeightSet.ml
    
    Signatures.ml
    
    W.ml
    
    WeightMap.ml
    
    WeightSet.ml
    
    baby__.ml

Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module `Custom.Make`Source

Parameters

module E : OrderedType

Signature

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.