@ -19,7 +19,7 @@ The number of neighbours to return. A 0 will return all points in order of dista
ARGUMENT:: radius
The threshold of acceptable distance for a point to be returned. A 0 will bypass this function, returning numNeighbours points.
ARGUMENT:: lookupDataSet
An optional link::Classes/FluidDataSet:: from which data points will be returned for realtime queries. This does not need to be the same DataSet that the tree was fitted against, but does need to have matching labels. Using this mechanism, we have a way to, e.g. associate labels with segments of playback buffers, without needing pass strings around the server. warning::This parameter can not be safely changed after the instance of FluidKDTree has been created::
An optional link::Classes/FluidDataSet:: from which data points will be returned for realtime queries. This does not need to be the same DataSet that the tree was fitted against, but does need to have matching labels. Using this mechanism, we have a way to, e.g. associate labels with segments of playback buffers, without needing pass strings around the server. warning::This parameter can not be changed after the instance of FluidKDTree has been created::
INSTANCEMETHODS::
@ -51,11 +51,10 @@ code::
// Make a DataSet of random 2D points
s.boot;
s.reboot;
(
fork{
~ds = FluidDataSet.new(s,\kdtree_help_rand2d);
~dsL = FluidDataSet.new(s,\kdtree_help_indices);// for use later in KR query
//here we populate with numbers that are in effect the indicies, but it could be anything numerical that will be returned on the server-side and would be usable on that side
(
~dsL = FluidDataSet.new(s,\kdtree_help_indices);
fork{
d = Dictionary.with(
*[\cols -> 1,\data -> Dictionary.newFrom(
@ -145,8 +133,19 @@ fork{
}
)
// instantiate a tree with a lookup dataset. Note that this 'association' has to be done at instantiation.