thanks for implementing this!

I am interested in using the LSH-Forest after reading the Bawa et al paper. The docs for the constructor look like:

l is the number of hash tables to use, m is the number of hash values to concatenate to form the key to the hash tables, w is the slot size for the family of LSH functions.

• The paper says to just set l large enough, e.g. 10.
• I think the m in the function sig is k from the paper or, specifically km (the maximum label length == maximum number of hashes. correct?
• I see that w is used to scale the hash-value. How does one choose this value? Is this what the Bawa paper defines as cl the number of colliding points that are then filtered to the closest k-nearest?

thanks,
-Brent

hello, this there any possible to save the buckets index for later usage, thanks