Reallocating arrays to expand the tree would be hard without significant
changes to the current code. The node indices are stored in a
fixed-length binary heap, and reference data are in a single numpy
array. It would be much easier to re-implement the Ball Tree using
dynamically allocated
Am 13.05.2012 17:28, schrieb Jacob VanderPlas:
> It can't be done with the current functionality. When I rewrote the
> code last year, we decided picklability of the object and avoiding
> dynamic memory management was more important than being able to use it
> online. Currently, all data is store
It can't be done with the current functionality. When I rewrote the
code last year, we decided picklability of the object and avoiding
dynamic memory management was more important than being able to use it
online. Currently, all data is stored in pre-allocated arrays.
To use the Ball Tree inli
Hi everybody.
I was wondering if there was an online version of the ball-tree.
I want to query an increasingly big set of points.
Is there a method for doing that and is this somehow possible with the
functionality we already have?
Cheers,
Andy
