using System;
using System.Collections.Generic;
using Cpp2IlInjected;

namespace Pathfinding
{
	// Token: 0x020000B5 RID: 181
	[Token(Token = "0x200006A")]
	public class PointKDTree
	{
		// Token: 0x060006B9 RID: 1721 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005B1")]
		[Address(RVA = "0x2521D20", Offset = "0x2520B20", VA = "0x182521D20")]
		public PointKDTree()
		{
		}

		// Token: 0x060006BA RID: 1722 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005B2")]
		[Address(RVA = "0x251FF90", Offset = "0x251ED90", VA = "0x18251FF90")]
		public void Add(GraphNode node)
		{
		}

		// Token: 0x060006BB RID: 1723 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005B3")]
		[Address(RVA = "0x2521920", Offset = "0x2520720", VA = "0x182521920")]
		public void Rebuild(GraphNode[] nodes, int start, int end)
		{
		}

		// Token: 0x060006BC RID: 1724 RVA: 0x00002050 File Offset: 0x00000250
		[Token(Token = "0x60005B4")]
		[Address(RVA = "0x25217A0", Offset = "0x25205A0", VA = "0x1825217A0")]
		private GraphNode[] GetOrCreateList()
		{
			return null;
		}

		// Token: 0x060006BD RID: 1725 RVA: 0x000052C4 File Offset: 0x000034C4
		[Token(Token = "0x60005B5")]
		[Address(RVA = "0x2521B00", Offset = "0x2520900", VA = "0x182521B00")]
		private int Size(int index)
		{
			return 0;
		}

		// Token: 0x060006BE RID: 1726 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005B6")]
		[Address(RVA = "0x2520970", Offset = "0x251F770", VA = "0x182520970")]
		private void CollectAndClear(int index, List<GraphNode> buffer)
		{
		}

		// Token: 0x060006BF RID: 1727 RVA: 0x000052DC File Offset: 0x000034DC
		[Token(Token = "0x60005B7")]
		[Address(RVA = "0x2521810", Offset = "0x2520610", VA = "0x182521810")]
		private static int MaxAllowedSize(int numNodes, int depth)
		{
			return 0;
		}

		// Token: 0x060006C0 RID: 1728 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005B8")]
		[Address(RVA = "0x2521890", Offset = "0x2520690", VA = "0x182521890")]
		private void Rebalance(int index)
		{
		}

		// Token: 0x060006C1 RID: 1729 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005B9")]
		[Address(RVA = "0x2520AF0", Offset = "0x251F8F0", VA = "0x182520AF0")]
		private void EnsureSize(int index)
		{
		}

		// Token: 0x060006C2 RID: 1730 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005BA")]
		[Address(RVA = "0x2520340", Offset = "0x251F140", VA = "0x182520340")]
		private void Build(int index, List<GraphNode> nodes, int start, int end)
		{
		}

		// Token: 0x060006C3 RID: 1731 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005BB")]
		[Address(RVA = "0x251FFC0", Offset = "0x251EDC0", VA = "0x18251FFC0")]
		private void Add(GraphNode point, int index, int depth = 0)
		{
		}

		// Token: 0x060006C4 RID: 1732 RVA: 0x00002050 File Offset: 0x00000250
		[Token(Token = "0x60005BC")]
		[Address(RVA = "0x2521740", Offset = "0x2520540", VA = "0x182521740")]
		public GraphNode GetNearest(Int3 point, NNConstraint constraint)
		{
			return null;
		}

		// Token: 0x060006C5 RID: 1733 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005BD")]
		[Address(RVA = "0x25214A0", Offset = "0x25202A0", VA = "0x1825214A0")]
		private void GetNearestInternal(int index, Int3 point, NNConstraint constraint, ref GraphNode best, ref long bestSqrDist)
		{
		}

		// Token: 0x060006C6 RID: 1734 RVA: 0x00002050 File Offset: 0x00000250
		[Token(Token = "0x60005BE")]
		[Address(RVA = "0x2521430", Offset = "0x2520230", VA = "0x182521430")]
		public GraphNode GetNearestConnection(Int3 point, NNConstraint constraint, long maximumSqrConnectionLength)
		{
			return null;
		}

		// Token: 0x060006C7 RID: 1735 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005BF")]
		[Address(RVA = "0x2520E60", Offset = "0x251FC60", VA = "0x182520E60")]
		private void GetNearestConnectionInternal(int index, Int3 point, NNConstraint constraint, ref GraphNode best, ref long bestSqrDist, long distanceThresholdOffset)
		{
		}

		// Token: 0x060006C8 RID: 1736 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005C0")]
		[Address(RVA = "0x2520E20", Offset = "0x251FC20", VA = "0x182520E20")]
		public void GetInRange(Int3 point, long sqrRadius, List<GraphNode> buffer)
		{
		}

		// Token: 0x060006C9 RID: 1737 RVA: 0x00002082 File Offset: 0x00000282
		[Token(Token = "0x60005C1")]
		[Address(RVA = "0x2520BB0", Offset = "0x251F9B0", VA = "0x182520BB0")]
		private void GetInRangeInternal(int index, Int3 point, long sqrRadius, List<GraphNode> buffer)
		{
		}

		// Token: 0x0400046D RID: 1133
		[Token(Token = "0x4000349")]
		public const int LeafSize = 10;

		// Token: 0x0400046E RID: 1134
		[Token(Token = "0x400034A")]
		public const int LeafArraySize = 21;

		// Token: 0x0400046F RID: 1135
		[FieldOffset(Offset = "0x10")]
		[Token(Token = "0x400034B")]
		private PointKDTree.Node[] tree;

		// Token: 0x04000470 RID: 1136
		[FieldOffset(Offset = "0x18")]
		[Token(Token = "0x400034C")]
		private int numNodes;

		// Token: 0x04000471 RID: 1137
		[FieldOffset(Offset = "0x20")]
		[Token(Token = "0x400034D")]
		private readonly List<GraphNode> largeList;

		// Token: 0x04000472 RID: 1138
		[FieldOffset(Offset = "0x28")]
		[Token(Token = "0x400034E")]
		private readonly Stack<GraphNode[]> arrayCache;

		// Token: 0x04000473 RID: 1139
		[Token(Token = "0x400034F")]
		private static readonly IComparer<GraphNode>[] comparers;

		// Token: 0x020000B6 RID: 182
		[Token(Token = "0x200011F")]
		private struct Node
		{
			// Token: 0x04000474 RID: 1140
			[FieldOffset(Offset = "0x0")]
			[Token(Token = "0x400069C")]
			public GraphNode[] data;

			// Token: 0x04000475 RID: 1141
			[FieldOffset(Offset = "0x8")]
			[Token(Token = "0x400069D")]
			public int split;

			// Token: 0x04000476 RID: 1142
			[FieldOffset(Offset = "0xC")]
			[Token(Token = "0x400069E")]
			public ushort count;

			// Token: 0x04000477 RID: 1143
			[FieldOffset(Offset = "0xE")]
			[Token(Token = "0x400069F")]
			public byte splitAxis;
		}

		// Token: 0x020000B7 RID: 183
		[Token(Token = "0x2000120")]
		private class CompareX : IComparer<GraphNode>
		{
			// Token: 0x060006CB RID: 1739 RVA: 0x000052F4 File Offset: 0x000034F4
			[Token(Token = "0x6000A45")]
			[Address(RVA = "0x2514E20", Offset = "0x2513C20", VA = "0x182514E20", Slot = "4")]
			public int Compare(GraphNode lhs, GraphNode rhs)
			{
				return 0;
			}

			// Token: 0x060006CC RID: 1740 RVA: 0x00002082 File Offset: 0x00000282
			[Token(Token = "0x6000A46")]
			[Address(RVA = "0x3F5100", Offset = "0x3F3F00", VA = "0x1803F5100")]
			public CompareX()
			{
			}
		}

		// Token: 0x020000B8 RID: 184
		[Token(Token = "0x2000121")]
		private class CompareY : IComparer<GraphNode>
		{
			// Token: 0x060006CD RID: 1741 RVA: 0x0000530C File Offset: 0x0000350C
			[Token(Token = "0x6000A47")]
			[Address(RVA = "0x2514E50", Offset = "0x2513C50", VA = "0x182514E50", Slot = "4")]
			public int Compare(GraphNode lhs, GraphNode rhs)
			{
				return 0;
			}

			// Token: 0x060006CE RID: 1742 RVA: 0x00002082 File Offset: 0x00000282
			[Token(Token = "0x6000A48")]
			[Address(RVA = "0x3F5100", Offset = "0x3F3F00", VA = "0x1803F5100")]
			public CompareY()
			{
			}
		}

		// Token: 0x020000B9 RID: 185
		[Token(Token = "0x2000122")]
		private class CompareZ : IComparer<GraphNode>
		{
			// Token: 0x060006CF RID: 1743 RVA: 0x00005324 File Offset: 0x00003524
			[Token(Token = "0x6000A49")]
			[Address(RVA = "0x2514E80", Offset = "0x2513C80", VA = "0x182514E80", Slot = "4")]
			public int Compare(GraphNode lhs, GraphNode rhs)
			{
				return 0;
			}

			// Token: 0x060006D0 RID: 1744 RVA: 0x00002082 File Offset: 0x00000282
			[Token(Token = "0x6000A4A")]
			[Address(RVA = "0x3F5100", Offset = "0x3F3F00", VA = "0x1803F5100")]
			public CompareZ()
			{
			}
		}
	}
}