Module Cf_disjoint_interval

Data structures founded on vectors of sorted disjoint intervals.

Overview

This module implements set and map data structures using multiplicative binary search data structures where keys correspond to table elements that comprise disjoint intervals. Distinguished instances are provided for sets and maps where elements are disjoint intervals of char and int types. These are useful for fast cache-friendly instances of ASCII and Unicode character sets and maps.

Types and Signatures
type 'a t = private
  1. | T of {
    1. a : 'a;
    2. b : 'a;
    }

A private type representing a disjoint interval.

module Core : sig ... end

Modules with core functions for use with disjoint intervals.

module Set : sig ... end

Modules of distinguished set implementations.

module Map : sig ... end

Modules of distinguished map implementations.