package bst

You can search for identifiers within the package.

in-package search v0.2.0

package bst

bst
- Bst
  - Bisec_tree
    
    Make
    
    P
    
    Point

Legend:
Library
Module
Module type
Parameter
Class
Class type

Functorial interface.

module type Point = sig ... end

type vp_heuristic =

| One_band
| Two_bands

Heuristics to find good vantage (reference) points. One_band is faster (at tree construction time), but the resulting tree should be less efficient for queries. Two_bands (recommended) is more expensive (at tree construction time) but queries should be faster. Heuristics inspired by "Near Neighbor Search in Large Metric Spaces"; Sergey Brin; November 20, 1995.

type direction =

| Left
| Right

To reach a point in the bst, you need to follow a path. A path is a list of directions.

type step =

| L of float
| R of float

Part of a point's address in the bst.

val string_of_addr : step list -> string

module Make (P : Point) : sig ... end