package bst

You can search for identifiers within the package.

in-package search v0.2.0

bst
- Bst
  - Bisec_tree
    
    Config
    
    Make
    
    C
    
    P
    
    Point
  - MyArray

Legend:
Library
Module
Module type
Parameter
Class
Class type

val k : int

Bucket size. If there are n <= k points left, we put them in the same bucket. Else, we continue constructing the tree recursively. This should save storage space and accelerate queries. The best value for k is probably dataset and application dependent. k = 0 => the tree is not bucketized. k = 50 might be a good default value.

val q : quality

Vantage point finding heuristic quality.