| .. | .. |
|---|
| 285 | 285 | * @throws IllegalArgumentException if <I>n</I> is negative or |
|---|
| 286 | 286 | * exceeds tree size |
|---|
| 287 | 287 | */ |
|---|
| 288 | | - public List<T> nearest(double[] key, int n, Checker<T> checker) |
|---|
| 288 | + public List<T> nearest(double[] key, int n, CheckerInterface<T> checker) |
|---|
| 289 | 289 | throws KeySizeException, IllegalArgumentException |
|---|
| 290 | 290 | { |
|---|
| 291 | 291 | |
|---|
| .. | .. |
|---|
| 360 | 360 | } |
|---|
| 361 | 361 | |
|---|
| 362 | 362 | private NearestNeighborList<KDNode<T>> getnbrs(double[] key, int n, |
|---|
| 363 | | - Checker<T> checker) throws KeySizeException |
|---|
| 363 | + CheckerInterface<T> checker) throws KeySizeException |
|---|
| 364 | 364 | { |
|---|
| 365 | 365 | |
|---|
| 366 | 366 | if (key.length != m_K) |
|---|
