[mlpack-git] [mlpack/mlpack] Universal B tree implementation (#746)

[lozhnikov]

> +namespace mlpack {
> +
> +namespace bound {
> +
> +namespace addr {
> +
> +/**
> + * Calculate the address of a point. Be careful, the point and the address
> + * variables should be equal-sized and the type of the address should correspond
> + * to the type of the vector.
> + *
> + * @param address The resulting address.
> + * @param point The point that is being translated to the address.
> + */
> +template<typename AddressType, typename VecType>
> +void PointToAddress(AddressType& address, const VecType& point)

yeah, it's correct. In one dimensional case this transform preserves the ordering (lower addresses correspond lower points). The function looks like `DiscreteHilbertValue::CalculateValue()`. I introduced that since it is faster than recursive calculation (indeed, `RecursiveHilbertValue` was slower than `DiscreteHilbertValue`).

-- 
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/mlpack/mlpack/pull/746/files/f17843fc8e8ef2b1c4b04d572c521575f20a1f3c#r76265982
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160825/2502dfbc/attachment.html>