fix(TKDTree): Keep the vectors Hidden flag in mind

Author: Torwent

Source/simba.container_kdtree.pas

@@ -400,41 +400,44 @@   TNearestItem = record
 
     Delta := This^.Split.Vector[Axis] - Vector[Axis];
 
-    if Length(Heap) < K then
-      DistSq := Self.SqDistance(This^.Split.Vector, Vector, High(UInt32)) // No limit if heap is not full
-    else
-      DistSq := Self.SqDistance(This^.Split.Vector, Vector, Heap[0].DistSq); // Limit is the furthest distance in the heap
-
-    if not((DistSq = 0) and NotEqual) then
+    if not This^.Hidden then
     begin
-      if Length(Heap) < K then
-      begin
-        // heap not full, add current node
-        SetLength(Heap, Length(Heap) + 1);
-        Heap[High(Heap)].Node := This;
-        Heap[High(Heap)].DistSq := DistSq;
-
-        // heapify upwards
-        i := High(Heap);
-        while (i > 0) and (Heap[(i - 1) div 2].DistSq < Heap[i].DistSq) do
-        begin
-          Temp := Heap[i];
-          Heap[i] := Heap[(i - 1) div 2];
-          Heap[(i - 1) div 2] := Temp;
-          i := (i - 1) div 2;
-        end;
-      end
-      else
-      begin
-        if DistSq < Heap[0].DistSq then
-        begin
-          // replace the furthest node with the current node
-          Heap[0].Node := This;
-          Heap[0].DistSq := DistSq;
-          // heapify downwards
-          Heapify(0);
-        end;
-      end;
+     if Length(Heap) < K then
+       DistSq := Self.SqDistance(This^.Split.Vector, Vector, High(UInt32)) // No limit if heap is not full
+     else
+       DistSq := Self.SqDistance(This^.Split.Vector, Vector, Heap[0].DistSq); // Limit is the furthest distance in the heap
+
+     if not((DistSq = 0) and NotEqual) then
+     begin
+       if Length(Heap) < K then
+       begin
+         // heap not full, add current node
+         SetLength(Heap, Length(Heap) + 1);
+         Heap[High(Heap)].Node := This;
+         Heap[High(Heap)].DistSq := DistSq;
+
+         // heapify upwards
+         i := High(Heap);
+         while (i > 0) and (Heap[(i - 1) div 2].DistSq < Heap[i].DistSq) do
+         begin
+           Temp := Heap[i];
+           Heap[i] := Heap[(i - 1) div 2];
+           Heap[(i - 1) div 2] := Temp;
+           i := (i - 1) div 2;
+         end;
+       end
+       else
+       begin
+         if DistSq < Heap[0].DistSq then
+         begin
+           // replace the furthest node with the current node
+           Heap[0].Node := This;
+           Heap[0].DistSq := DistSq;
+           // heapify downwards
+           Heapify(0);
+         end;
+       end;
+     end;
     end;
 
     if Delta > 0 then Test := This^.L else Test := This^.R;