
static final class HilOut.HilFeature extends Object implements Comparable<HilOut.HilFeature>
| Modifier and Type | Field and Description | 
|---|---|
long[] | 
hilbert
Hilbert representation
 
 TODO: use byte[] to save some memory, but slower? 
 | 
DBID | 
id
Object ID 
 | 
double | 
lbound
Lower bound of object 
 | 
int | 
level
Object level 
 | 
ObjectHeap<DoubleDistanceDBIDPair> | 
nn
Heap with the nearest known neighbors 
 | 
HashSetModifiableDBIDs | 
nn_keys
Set representation of the nearest neighbors for faster lookups 
 | 
double | 
sum_nn
Current weight (sum of nn distances) 
 | 
double | 
ubound
Upper bound for object 
 | 
| Constructor and Description | 
|---|
HilOut.HilFeature(DBID id,
                 ObjectHeap<DoubleDistanceDBIDPair> nn)
Constructor. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
int | 
compareTo(HilOut.HilFeature o)  | 
protected void | 
insert(DBID id,
      double dt,
      int k)
insert function inserts a nearest neighbor into a features nn list and
 its distance 
 | 
public DBID id
public long[] hilbert
public int level
public double ubound
public double lbound
public ObjectHeap<DoubleDistanceDBIDPair> nn
public HashSetModifiableDBIDs nn_keys
public double sum_nn
public HilOut.HilFeature(DBID id, ObjectHeap<DoubleDistanceDBIDPair> nn)
id - Object IDnn - Heap for neighborspublic int compareTo(HilOut.HilFeature o)
compareTo in interface Comparable<HilOut.HilFeature>protected void insert(DBID id, double dt, int k)
id - DBID of the nearest neighbordt - distance or the neighbor to the features positionk - K