Cuddly Raccoon

This is an efficient implementation of a covertree It's structure is controlled by 3 parameters, the most important of which is the scale_base. This should be between 1.2 and 2ish. A higher value will create more outliers. Outliers are not loaded into ram at startup, but a high value slows down creation of a tree significantly. Theoretically, this value doesn't matter to the big O time, but I wouldn't go above 2.

The cutoff value controls how many points a leaf is allowed to cover. A smaller value gives faster bottom level queries, but at the cost of higher memory useage. Do not expect a value of 100 will give 1/100 the memory useage of a value of 1. It'd be closer to 1/10 or 1/5th. This is because the number of c. This will increase the compute by a little bit (maybe 2x for a knn with a very high value).

The resolution is the minimum scale index, this again reduces memory footprint and increases the query time. Once a node's resolution dips below this value we stop and covert the remaining coverage into a leaf.

See the git readme for a description of the algo.