org.openimaj.knn.approximate

Class ShortNearestNeighboursKDTree.Factory

java.lang.Object

org.openimaj.knn.approximate.ShortNearestNeighboursKDTree.Factory

All Implemented Interfaces:

NearestNeighboursFactory<ShortNearestNeighboursKDTree,short[]>

Enclosing class:

ShortNearestNeighboursKDTree

public static final class ShortNearestNeighboursKDTree.Factory
extends Object
implements NearestNeighboursFactory<ShortNearestNeighboursKDTree,short[]>

NearestNeighboursFactory for producing ShortNearestNeighboursKDTrees.

Author:

Jonathon Hare (jsh2@ecs.soton.ac.uk)

Constructor Summary

Constructors

Constructor and Description
ShortNearestNeighboursKDTree.Factory() Construct the factory the default number of trees and checks.
ShortNearestNeighboursKDTree.Factory(int ntrees, int nchecks) Construct the factory the given number of trees and checks.

Method Summary

Methods

Modifier and Type	Method and Description
ShortNearestNeighboursKDTree	create(short[][] data) Create a NearestNeighbours object that works over the provided data.

Methods inherited from class java.lang.Object

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

Constructor Detail

ShortNearestNeighboursKDTree.Factory

public ShortNearestNeighboursKDTree.Factory()

Construct the factory the default number of trees and checks.

ShortNearestNeighboursKDTree.Factory

public ShortNearestNeighboursKDTree.Factory(int ntrees,
                                    int nchecks)

Construct the factory the given number of trees and checks.

Parameters:

ntrees - the number of trees

nchecks - the number of checks during search

Method Detail

create

public ShortNearestNeighboursKDTree create(short[][] data)

Description copied from interface: NearestNeighboursFactory

Create a NearestNeighbours object that works over the provided data.

Specified by:

create in interface NearestNeighboursFactory<ShortNearestNeighboursKDTree,short[]>

Parameters:

data - the data

Returns:

the NearestNeighbours object