
static final class HilOut.HilFeature extends Object implements Comparable<HilOut.HilFeature>
| Modifier and Type | Field and Description | 
|---|---|
| long[] | hilbertHilbert representation
 
 TODO: use byte[] to save some memory, but slower? | 
| DBID | idObject ID | 
| double | lboundLower bound of object | 
| int | levelObject level | 
| Heap<DoubleDistanceDBIDPair> | nnHeap with the nearest known neighbors | 
| HashSetModifiableDBIDs | nn_keysSet representation of the nearest neighbors for faster lookups | 
| double | sum_nnCurrent weight (sum of nn distances) | 
| double | uboundUpper bound for object | 
| Constructor and Description | 
|---|
| HilOut.HilFeature(DBID id,
                 Heap<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 Heap<DoubleDistanceDBIDPair> nn
public HashSetModifiableDBIDs nn_keys
public double sum_nn
public HilOut.HilFeature(DBID id, Heap<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