Data structures founded on sorted vectors.
This module implements some useful data structures, e.g. sets and maps, on the foundation of a general abstraction of a vector initialized with totally ordered values in sorted order.
module Vector : sig ... endThis module contains the signature of a random-access vector containing data accessible at constant order cost for any index. Distinguished instances of the signature include char type values in string type vectors and int type values in int array vectors.
module Table : sig ... endThis module contains the signature of a search table comprising a vector of data sorted in multiplicative binary search order and an ancillary vector of adjustments for searching the final rank of the tree. Distinguished instances are provided for table searchable by char, int and string values.
module Set : sig ... endThis module contains the signature of an immutable set constructed from a binary search table of containing elements of the set. Distinguished instances are provided for tables of char and int type values.
module Map : sig ... endThis module contains the signature of an immutable map constructed from a binary search table of containing key elements of the map and an co-domain array of the co-domain elements. Distinguished instances are provided for maps from char and int type values.