package baby

  1. Overview
  2. Docs

Module BabySource

This library offers two flavors of binary search trees as well as building blocks that allow advanced users to construct their own custom flavors.

For height-balanced binary search trees, ready for use, please see Baby.H.Set.Make.

For weight-balanced binary search trees, ready for use, please see Baby.W.Set.Make.

Sourcemodule type OrderedType = sig ... end

The signature Baby.OrderedType describes a type equipped with a total ordering function.

The signature Baby.BASE_SET describes the interface that is offered by the base layer (the balancing code) to the upper layer (the set library).

Sourcemodule type BASE_SET = sig ... end

The signature Baby.BASE_MAP describes the interface that is offered by the base layer (the balancing code) to the upper layer (the map library).

Sourcemodule type BASE_MAP = sig ... end
Sourcemodule type SET = sig ... end

The signature Baby.SET describes an abstract data type of sets, equipped with a wide array of efficient operations.

Sourcemodule type MAP = sig ... end

The signature Baby.MAP describes an abstract data type of maps, equipped with a wide array of efficient operations.

Sourcemodule type SET_MAP = sig ... end

The signature Baby.SET_MAP describes abstract data types of sets and maps. They are described in two forms:

Sourcemodule H : SET_MAP

The module Baby.H provides ready-made height-balanced binary search trees.

Sourcemodule W : SET_MAP

The module Baby.W provides ready-made weight-balanced binary search trees.

The functor Baby.Custom constructs balanced binary search trees based on a user-supplied balancing scheme.