weka.core.neighboursearch

Class CoverTree.MyHeap

java.lang.Object

weka.core.neighboursearch.CoverTree.MyHeap

All Implemented Interfaces:

RevisionHandler

Enclosing class:

CoverTree

protected class CoverTree.MyHeap
extends java.lang.Object
implements RevisionHandler

A class for a heap to store the nearest k neighbours to an instance. The heap also takes care of cases where multiple neighbours are the same distance away. i.e. the minimum size of the heap is k.

Constructor Summary

Constructors

Constructor and Description
MyHeap(int maxSize) constructor.

Method Summary

Modifier and Type	Method and Description
protected void	downheap() performs downheap operation for the heap to maintian its properties.
CoverTree.MyHeapElement	get() returns the first element and removes it from the heap.
CoverTree.MyHeapElement	getKthNearest() returns the kth nearest element or null if none there.
java.lang.String	getRevision() Returns the revision string.
int	noOfKthNearest() returns the number of k nearest.
CoverTree.MyHeapElement	peek() peeks at the first element.
void	put(double d) adds the distance value to the heap.
void	putBySubstitute(double d) Puts an element by substituting it in place of the top most element.
void	putKthNearest(double d) Stores kth nearest elements (if there are more than one).
int	size() returns the size of the heap.
int	totalSize() returns the total size.
protected void	upheap() performs upheap operation for the heap to maintian its properties.

Methods inherited from class java.lang.Object

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

Constructor Detail

MyHeap

public MyHeap(int maxSize)

constructor.

Parameters:

maxSize - the maximum size of the heap

Method Detail

size

public int size()

returns the size of the heap.

Returns:

the size

peek

public CoverTree.MyHeapElement peek()

peeks at the first element.

Returns:

the first element

get

public CoverTree.MyHeapElement get()
                            throws java.lang.Exception

returns the first element and removes it from the heap.

Returns:

the first element

Throws:

java.lang.Exception - if no elements in heap

put

public void put(double d)
         throws java.lang.Exception

adds the distance value to the heap.

Parameters:

d - the distance value

Throws:

java.lang.Exception - if the heap gets too large

putBySubstitute

public void putBySubstitute(double d)
                     throws java.lang.Exception

Puts an element by substituting it in place of the top most element.

Parameters:

d - The distance value.

Throws:

java.lang.Exception - If distance is smaller than that of the head element.

noOfKthNearest

public int noOfKthNearest()

returns the number of k nearest.

Returns:

the number of k nearest

See Also:

m_KthNearestSize

putKthNearest

public void putKthNearest(double d)

Stores kth nearest elements (if there are more than one).

Parameters:

d - the distance

getKthNearest

public CoverTree.MyHeapElement getKthNearest()

returns the kth nearest element or null if none there.

Returns:

the kth nearest element

upheap

protected void upheap()

performs upheap operation for the heap to maintian its properties.

downheap

protected void downheap()

performs downheap operation for the heap to maintian its properties.

totalSize

public int totalSize()

returns the total size.

Returns:

the total size

getRevision

public java.lang.String getRevision()

Returns the revision string.

Specified by:

getRevision in interface RevisionHandler

Returns:

the revision