Package elki.index.tree.spatial.kd

Class MinimalisticMemoryKDTree.PrioritySearchBranch

java.lang.Object

elki.index.tree.spatial.kd.MinimalisticMemoryKDTree.PrioritySearchBranch

All Implemented Interfaces:

java.lang.Comparable<MinimalisticMemoryKDTree.PrioritySearchBranch>

Enclosing class:

MinimalisticMemoryKDTree<O extends NumberVector>

private static class MinimalisticMemoryKDTree.PrioritySearchBranch
extends java.lang.Object
implements java.lang.Comparable<MinimalisticMemoryKDTree.PrioritySearchBranch>

Search position for priority search.

Author:

Erich Schubert

Field Summary

Fields

Modifier and Type	Field	Description
(package private) int	axis	Next splitting axis
(package private) int	left	Interval begin
(package private) double	mindist	Minimum distance
(package private) int	right	Interval end

Constructor Summary

Constructors

Constructor	Description
PrioritySearchBranch(double mindist, int left, int right, int axis)	Constructor.

Method Summary

Modifier and Type	Method	Description
int	compareTo(MinimalisticMemoryKDTree.PrioritySearchBranch o)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

mindist

double mindist

Minimum distance

left

int left

Interval begin

right

int right

Interval end

axis

int axis

Next splitting axis

Constructor Detail

PrioritySearchBranch

public PrioritySearchBranch(double mindist,
                            int left,
                            int right,
                            int axis)

Constructor.

Parameters:

mindist - Minimum distance

left - Interval begin

right - Interval end (exclusive)

axis - Next axis

Method Detail

compareTo

public int compareTo(MinimalisticMemoryKDTree.PrioritySearchBranch o)

Specified by:

compareTo in interface java.lang.Comparable<MinimalisticMemoryKDTree.PrioritySearchBranch>