Data Structures

Classes
class	AHeap< T >
class	APriorityQueue< T >
class	BinaryHeap< T >
	Binary heap, using an array implementation. More...
struct	DistanceSortingIndex
	A common data structure, used to identify the references again after sorting by distance (the element identified by the index) More...
struct	NativeSortedList< T, U >.Enumerator
struct	HalfEdge
	A useful edge data structure, that can be used to build polygons, maps, diagrams etc. More...
struct	NativeAVLTree< T, U >
	Implementation of an AVL Tree to be used in Unity's Job System. More...
struct	NativeGraph
	A directional graph represenation using an adjacency list for use with the Unity Job System. Each vertex can store a pointer (int). It is up to the user to connect vertices and data. More...
struct	NativePriorityQueue< T, U >
	Native Array implementation of a priority queue (based on a binary heap). More...
struct	NativeRBTree< T, U >
	Implementation of a Red-Black Tree to be used in Unity's Job System. More...
struct	NativeSortedList< T, U >
	A list that always keeps itself sorted based on a provided comparer (skip list) More...
struct	NativeSortedList< T, U >.PathNode
struct	Position2D
	A 2D Point that can be used within generic spatial data structures like KD-Trees etc. More...
struct	Position3D
	A 3D Point that can be used within generic spatial data structures like KD-Trees etc. More...
struct	PositionWithIndex2D
	A 2D Point with index information that can be used within generic spatial data structures like KD-Trees etc. More...
struct	PositionWithIndex3D
	A 3D Point with index information that can be used within generic spatial data structures like KD-Trees etc. More...
class	PriorityQueue< T >
	Managed implementation of a priority queue (based on a binary heap) More...
struct	NativeSortedList< T, U >.SkipListNode
struct	NativeSortedList< T, U >.SkipListPointer
struct	NativeAVLTree< T, U >.TreeNode
struct	NativeRBTree< T, U >.TreeNode

Detailed Description