using System;

namespace KDTree
{
	// Token: 0x02000006 RID: 6
	public class KDTree<T> : KDNode<T>
	{
		// Token: 0x06000026 RID: 38 RVA: 0x00002F60 File Offset: 0x00001160
		public KDTree(int iDimensions)
			: base(iDimensions, 24)
		{
		}

		// Token: 0x06000027 RID: 39 RVA: 0x00002F6E File Offset: 0x0000116E
		public KDTree(int iDimensions, int iBucketCapacity)
			: base(iDimensions, iBucketCapacity)
		{
		}

		// Token: 0x06000028 RID: 40 RVA: 0x00002F7C File Offset: 0x0000117C
		public NearestNeighbour<T> NearestNeighbors(double[] tSearchPoint, int iMaxReturned, double fDistance = -1.0)
		{
			DistanceFunctions distanceFunctions = new SquareEuclideanDistanceFunction();
			return this.NearestNeighbors(tSearchPoint, distanceFunctions, iMaxReturned, fDistance);
		}

		// Token: 0x06000029 RID: 41 RVA: 0x00002FA0 File Offset: 0x000011A0
		public NearestNeighbour<T> NearestNeighbors(double[] tSearchPoint, DistanceFunctions kDistanceFunction, int iMaxReturned, double fDistance)
		{
			return new NearestNeighbour<T>(this, tSearchPoint, kDistanceFunction, iMaxReturned, fDistance);
		}
	}
}