| ►CAHeap< T > | |
| CBinaryHeap< T > | Binary heap, using an array implementation |
| CAlgoUtil | |
| ►CAPriorityQueue< T > | |
| CPriorityQueue< T > | Managed implementation of a priority queue (based on a binary heap) |
| CAttributeMap | |
| CBoundsExtension | |
| CCapsule | |
| CCardinalPlaneExtensions | |
| CColorExtension | |
| CCone | |
| CConstants | |
| CCylinder | |
| CDBSCAN | |
| CDelaunay2D | |
| CDelaunay2DJobs | |
| CDelaunay2DJobs.DelaunayTriangleData | |
| CDistanceSortingIndex | A common data structure, used to identify the references again after sorting by distance (the element identified by the index) |
| CMeshSlicingJobs.EdgeNeighborsEntry | |
| CLineIntersectionJobs.EventPoint | |
| CMapOverlayJobs.EventPoint | |
| CFloat2Extension | |
| CFloat3Extension | |
| CGeometricStructureVisualizationUtility | Utility class for creating meshes from internal geometric data structures |
| CGradientExtension | |
| CGraphFunctionIntersections | |
| CGraphVertex | |
| CHalfEdge | A useful edge data structure, that can be used to build polygons, maps, diagrams etc |
| CHullAlgorithmJobs | |
| CHullAlgorithms | |
| ►CIBalancedSearchTree< T > | |
| CNativeAVLTree< T, U > | Implementation of an AVL Tree to be used in Unity's Job System |
| CNativeRBTree< T, U > | Implementation of a Red-Black Tree to be used in Unity's Job System |
| ►CIBalancedSearchTreeNode< T > | |
| CNativeAVLTree< T, U >.TreeNode | |
| CNativeRBTree< T, U >.TreeNode | |
| ►CIBoundingArea | Interface for a bounding area in 2D space |
| ►CIBoundingCircle | A generic interface that structures should implement for use in Ball* Trees etc |
| CBallStarNode2D | |
| ►CIBoundingRect | A generic interface that structures should implement for use in R* Trees etc |
| CRStarNode2D | |
| ►CIBoundingVolume | Interface for a bounding volume in 3D space |
| ►CIBoundingBox | A generic interface that structures should implement for use in R* Trees etc |
| CRStarNode3D | |
| ►CIBoundingSphere | A generic interface that structures should implement for use in Ball* Trees etc |
| CBallStarNode3D | |
| ►CIComparer | |
| CDistanceSortingIndexComparer | |
| CHullAlgorithms.LexicographicPointComparer | |
| CIntersectionHit2D< T >.RayComparer | A sorter, for returning the collision shapes ordered by closeness to the origin to the raycast |
| CIntersectionHit3D< T >.RayComparer | A sorter, for returning the collision shapes ordered by closeness to the origin to the raycast |
| CLineIntersectionJobs.EventPointComparer | |
| CLineIntersectionJobs.SweepLineComparer | |
| CMapOverlayJobs.EventPointComparer | |
| CMapOverlayJobs.SweepLineComparer | |
| ►CIDisposable | |
| CDCEL | |
| CFaceRecord | |
| ►CIOctree< T > | Generic interface for different types of octrees (sparse, dense, etc.) to exchange data structures within Jobs |
| CNativeDenseOctree< T > | A spatial data structure for quick point queries suited for moving or concentrated positions in 3D space. The dense variant uses much, much more memory in 3D, but is slightly faster for insertions and removals than the sparse variant |
| CNativeSparseOctree< T > | |
| ►CIQuadtree< T > | Generic interface for different types of quadtrees (sparse, dense, etc.) to exchange data structures within Jobs |
| CNativeDenseQuadtree< T > | A spatial data structure for quick point queries suited for moving or concentrated positions in 2D space. The dense variant uses much more memory, but is slightly faster for insertions and removals than the sparse variant |
| CNativeSparseQuadtree< T > | A spatial data structure for quick point queries suited for moving or concentrated positions in 2D space. The sparse variant uses less memory, but is slightly slower for insertions and removals than the dense variant |
| CJobAllocations | A helper class for storing native memory allocations that happen for example inside a method call that creates jobs. The caller of the method is required to call Dispose() at an appropiate time (based on the Allocator Type) |
| CNative2DBallStarTree< T > | A spatial data structure for circles in 2D space. The leaves of the tree are holding up to maxChildren elements |
| CNative2DBallStarTree< T > | A spatial data structure for circles in 2D space. The leaves of the tree are holding up to maxChildren elements |
| CNative2DKDTree< T > | A spatial data structure for quick point queries - the input points can be in 3D space, but are sorted in 2D space (along a plane of your choosing) |
| CNative2DRStarTree< T > | A spatial data structure for rectangles in 2D space. The leaves of the tree are holding up to maxChildren elements |
| CNative2DRStarTree< T > | A spatial data structure for rectangles in 2D space. The leaves of the tree are holding up to maxChildren elements |
| CNative3DBallStarTree< T > | A spatial data structure for spheres in 3D space. The leaves of the tree are holding up to maxChildren elements |
| CNative3DBallStarTree< T > | A spatial data structure for spheres in 3D space. The leaves of the tree are holding up to maxChildren elements |
| CNative3DKDTree< T > | A spatial data structure for quick point queries in 3D space. Note: Default sorting order is X, then Y, then Z |
| CNative3DRStarTree< T > | |
| CNative3DRStarTree< T > | |
| CNativeAVLTree< T, U > | Implementation of an AVL Tree to be used in Unity's Job System |
| CNativeDenseOctree< T > | A spatial data structure for quick point queries suited for moving or concentrated positions in 3D space. The dense variant uses much, much more memory in 3D, but is slightly faster for insertions and removals than the sparse variant |
| CNativeDenseQuadtree< T > | A spatial data structure for quick point queries suited for moving or concentrated positions in 2D space. The dense variant uses much more memory, but is slightly faster for insertions and removals than the sparse variant |
| CNativeGraph | 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 |
| CNativePolygon2D | A 2D polygon, that can be used within Unitys Job System. Supports holes, and is the basis for many advanced geometry algorithms |
| CNativePolygon2DSampler | A helper class to sample points, taking a polygon as the distribution source Internally, a "texture" is created to achieve this. Therefore the quality of the randomness depends on the choosen x- and y-Resolution. Lower values -> less memory but generated points are visibly in discrete spaces apart Higher values -> more memory but appears random |
| CNativePriorityQueue< T, U > | Native Array implementation of a priority queue (based on a binary heap) |
| CNativeRBTree< T, U > | Implementation of a Red-Black Tree to be used in Unity's Job System |
| CNativeSortedList< T, U > | A list that always keeps itself sorted based on a provided comparer (skip list) |
| CNativeSparseOctree< T > | |
| CNativeSparseQuadtree< T > | A spatial data structure for quick point queries suited for moving or concentrated positions in 2D space. The sparse variant uses less memory, but is slightly slower for insertions and removals than the dense variant |
| ►CIEnumerable | |
| CNativeSortedList< T, U > | A list that always keeps itself sorted based on a provided comparer (skip list) |
| ►CIEnumerator | |
| CNativeSortedList< T, U >.Enumerator | |
| ►CIEquatable | |
| CLineSegment2D | A simple struct representing a segment of a 2D Line. GPU: GGGShapes |
| CLineSegment3D | A simple struct representing a segment of a 3D line |
| CPosition2D | A 2D Point that can be used within generic spatial data structures like KD-Trees etc |
| CPosition3D | A 3D Point that can be used within generic spatial data structures like KD-Trees etc |
| CPositionWithIndex2D | A 2D Point with index information that can be used within generic spatial data structures like KD-Trees etc |
| CPositionWithIndex3D | A 3D Point with index information that can be used within generic spatial data structures like KD-Trees etc |
| ►CIGraphFunction | |
| CParabola | Parameters of a parabola function |
| ►CIIdentifiable | |
| CPositionWithIndex2D | A 2D Point with index information that can be used within generic spatial data structures like KD-Trees etc |
| CPositionWithIndex3D | A 3D Point with index information that can be used within generic spatial data structures like KD-Trees etc |
| ►CIJob | |
| CDBSCAN.DBSCAN2DJob | |
| CDelaunay2DJobs.DelaunayTriangulationJob | |
| CDelaunay2DJobs.FindLexicographicLargestJob | |
| CDelaunay2DJobs.SwapBackJob | |
| CHullAlgorithmJobs.AklToussaintBoundaryJob | |
| CHullAlgorithmJobs.AklToussaintFilterJob | |
| CHullAlgorithmJobs.BoundingBoxJob | |
| CHullAlgorithmJobs.BoundingRectangleJob | |
| CHullAlgorithmJobs.ConcaveHullJob | |
| CHullAlgorithmJobs.ConvexHullIndicesJob | |
| CHullAlgorithmJobs.ConvexHullJob | |
| CHullAlgorithmJobs.MinimumEnclosingDiskJob | |
| CHullAlgorithmJobs.MinimumEnclosingSphereJob | |
| CLineIntersectionJobs.FindLineIntersectionsSweep | |
| CLineIntersectionJobs.FindLineSegmentIntersectionsCombinatorial | |
| CMapOverlayJobs.MapOverlayDCELSegmentsJob | |
| CMapOverlayJobs.MapOverlayMergeJob | |
| CMapOverlayJobs.MapOverlaySweepJob | |
| CMeshSlicingJobs.CombinePolygonsJob | |
| CMeshSlicingJobs.CreateEdgeNeighborMapJob | |
| CMeshSlicingJobs.CreatePolygonsFromLoopsJob | |
| CMeshSlicingJobs.CreateShellsJob | |
| CMeshSlicingJobs.DisposePolygonsJob | |
| CMeshSlicingJobs.FindLoopsJob | |
| CNative2DBallStarTree< T >.GetCirclesInPolygonJob | |
| CNative2DBallStarTree< T >.GetCirclesInRadiusJob | |
| CNative2DBallStarTree< T >.GetCirclesInRectangleJob | |
| CNative2DBallStarTree< T >.GetNearestNeighborsJob | |
| CNative2DBallStarTree< T >.GetOverlappingCirclesInRadiusJob | |
| CNative2DBallStarTree< T >.GetOverlappingCirclesInRectangleJob | |
| CNative2DBallStarTree< T >.OptimizeJob | |
| CNative2DBallStarTree< T >.RaycastJob | |
| CNative2DBallStarTree< T >.RemoveJob | |
| CNative2DBallStarTree< T >.UpdateJob | |
| CNative2DRStarTree< T >.GetNearestNeighborsJob | |
| CNative2DRStarTree< T >.GetOverlappingRectanglesInRadiusJob | |
| CNative2DRStarTree< T >.GetOverlappingRectanglesInRectangleJob | |
| CNative2DRStarTree< T >.GetRectanglesInPolygonJob | |
| CNative2DRStarTree< T >.GetRectanglesInRadiusJob | |
| CNative2DRStarTree< T >.GetRectanglesInRectangleJob | |
| CNative2DRStarTree< T >.OptimizeJob | |
| CNative2DRStarTree< T >.RaycastJob | |
| CNative2DRStarTree< T >.RemoveJob | |
| CNative2DRStarTree< T >.UpdateJob | |
| CNative3DBallStarTree< T >.FrustumJob | |
| CNative3DBallStarTree< T >.GetNearestNeighborsJob | |
| CNative3DBallStarTree< T >.GetOverlappingSpheresInBoundsJob | |
| CNative3DBallStarTree< T >.GetOverlappingSpheresInRadiusJob | |
| CNative3DBallStarTree< T >.GetSpheresInBoundsJob | |
| CNative3DBallStarTree< T >.GetSpheresInRadiusJob | |
| CNative3DBallStarTree< T >.OptimizeJob | |
| CNative3DBallStarTree< T >.RaycastJob | |
| CNative3DBallStarTree< T >.RemoveJob | |
| CNative3DBallStarTree< T >.SphereCastJob | |
| CNative3DBallStarTree< T >.UpdateJob | |
| CNative3DRStarTree< T >.FrustumJob | |
| CNative3DRStarTree< T >.GetBoundsInBoundsJob | |
| CNative3DRStarTree< T >.GetBoundsInRadiusJob | |
| CNative3DRStarTree< T >.GetNearestNeighborsJob | |
| CNative3DRStarTree< T >.GetOverlappingBoundsInBoundsJob | |
| CNative3DRStarTree< T >.GetOverlappingBoundsInRadiusJob | |
| CNative3DRStarTree< T >.OptimizeJob | |
| CNative3DRStarTree< T >.RaycastJob | |
| CNative3DRStarTree< T >.RemoveJob | |
| CNative3DRStarTree< T >.UpdateJob | |
| CNativeParallelMultiHashMapJobs.ClearParallelMultiHashMapJob< T, U > | |
| CNativeParallelMultiHashMapJobs.CopyParallelMultiHashMapJob< T, U > | When a native parallel multi hash map is resized, the order is sometimes mingled up for some items. I suspect, this is because of hash collisions and actually depends on GetHashCode() from your T-Type (UnsafeParallelHashMap -> ReallocateHashMap, Line 197, as of writing this comment, if you want to take a look at it yourself). The larger your hash map, the more collisions, so my theory... But I could be wrong! |
| CPolygon2DPointLocationJobs.NativePolygon2DPointLocationJob | |
| CPolygon2DTriangulationJobs.EarClippingTriangulationJob | |
| CPolygon2DTriangulationJobs.FanTriangulationJob | |
| CPolygon2DTriangulationJobs.MonotoneDecompositionJob | |
| CPolygon2DTriangulationJobs.YMonotoneTriangulationJob | |
| CPositionFilterJobs.Position2DRadiusFilterJob | |
| CPositionFilterJobs.Position3DRadiusFilterJob | |
| CSpecialQueryJobs.AllRadiusQuery2DJob | |
| CSpecialQueryJobs.AllRadiusQuery3DJob | |
| CSpecialQueryJobs.AllRectangleQueryJob | |
| CSpecialQueryJobs.CreateRadiusEventQueue2DJob | |
| CSpecialQueryJobs.CreateRadiusEventQueue3DJob | |
| CSpecialQueryJobs.CreateRectangleEventQueueJob | |
| CSpecialQueryJobs.PrepareParallelQueryJob | |
| CSpecialQueryJobs.SortPresortedEventQueue2DJob | |
| CSpecialQueryJobs.SortPresortedEventQueue3DJob | |
| CVoronoi2DJobs.Voronoi2DFromDelaunayJob | |
| CVoronoi2DJobs.Voronoi2DToPolygonsJob | |
| ►CIJobParallelFor | |
| CLineIntersectionJobs.FindLSPlaneIntersectionsCombinatorialParallel | |
| CLineIntersectionJobs.FindLineSegmentIntersectionsCombinatorialParallel | |
| CLineIntersectionJobs.PrepareLineSegmentsSweep | |
| CNative2DBallStarTree< T >.GetCirclesInRadiiJob | |
| CNative2DBallStarTree< T >.GetCirclesInRectanglesJob | |
| CNative2DBallStarTree< T >.GetOverlappingCirclesInRadiiJob | |
| CNative2DBallStarTree< T >.GetOverlappingCirclesInRectanglesJob | |
| CNative2DRStarTree< T >.GetOverlappingRectanglesInRadiiJob | |
| CNative2DRStarTree< T >.GetOverlappingRectanglesInRectanglesJob | |
| CNative2DRStarTree< T >.GetRectanglesInRadiiJob | |
| CNative2DRStarTree< T >.GetRectanglesInRectanglesJob | |
| CNative3DBallStarTree< T >.GetOverlappingSpheresInMultipleBoundsJob | |
| CNative3DBallStarTree< T >.GetOverlappingSpheresInRadiiJob | |
| CNative3DBallStarTree< T >.GetSpheresInMultipleBoundsJob | |
| CNative3DBallStarTree< T >.GetSpheresInRadiiJob | |
| CNative3DRStarTree< T >.GetBoundsInMultipleBoundsJob | |
| CNative3DRStarTree< T >.GetBoundsInRadiiJob | |
| CNative3DRStarTree< T >.GetOverlappingBoundsInMultipleBoundsJob | |
| CNative3DRStarTree< T >.GetOverlappingBoundsInRadiiJob | |
| CPolygon2DPointLocationJobs.NativePolygon2DPointLocationJobParallel | |
| CSpecialQueryJobs.AllRadiusParallelQuery2DJob | |
| CSpecialQueryJobs.AllRadiusParallelQuery3DJob | |
| CSpecialQueryJobs.AllRectangleParallelQueryJob | |
| CSpecialQueryJobs.SortPresortedEventQueue2DParallelJob | |
| CSpecialQueryJobs.SortPresortedEventQueue3DParallelJob | |
| CSpecialQueryJobs.UpdatePresortedRadiusEventQueue2DJob | |
| CSpecialQueryJobs.UpdatePresortedRadiusEventQueue3DJob | |
| CSpecialQueryJobs.UpdatePresortedRectEventQueueJob | |
| CVoronoi2DJobs.Voronoi2DLookupTableJob | |
| CIntersectionHit2D< T > | The return type of raycasts within spatial data structures like Ball* Trees etc. It holds the hit points and a copy to the collision shape |
| CIntersectionHit3D< T > | The return type of raycasts within spatial data structures like Ball* Trees etc. It holds the hit points and a copy to the collision shape |
| CIntersectionMeshUtil | A utility for creating meshes from intersections between shapes |
| ►CIPosition2D | |
| CPosition2D | A 2D Point that can be used within generic spatial data structures like KD-Trees etc |
| CPositionWithIndex2D | A 2D Point with index information that can be used within generic spatial data structures like KD-Trees etc |
| ►CIPosition3D | |
| CPosition3D | A 3D Point that can be used within generic spatial data structures like KD-Trees etc |
| CPositionWithIndex3D | A 3D Point with index information that can be used within generic spatial data structures like KD-Trees etc |
| ►CISavable | |
| ►CIBinaryPersistable | |
| CNativePolygon2D | A 2D polygon, that can be used within Unitys Job System. Supports holes, and is the basis for many advanced geometry algorithms |
| CLine2D | |
| CLine3D | |
| CLineIntersection | |
| CLineIntersectionJobs | |
| CLineRendererExtensions | |
| CMeshSlicingJobs.LoopEntry | |
| CMapOverlayJobs.LS2D | |
| CMapOverlay | |
| CMapOverlayJobs | |
| CMathUtil | |
| CMathUtilDOTS | |
| CMatrix3x3 | 3x3 matrix used in this asset for manipulating position, rotation and scale of 2D Vectors i.e. as a 2D Transformation Matrix |
| CMeshSlicing | |
| CMeshSlicingJobs | |
| CMeshUtil | |
| CMeshUVUtil | |
| CNativeArrayExtensions | |
| CNativeListExtension | |
| CNativeParallelHashMapExtension | |
| CNativeParallelHashSetExtension | |
| CNativeParallelMultiHashMapJobs | |
| CNativeReferenceExtension | |
| CNativeSearchExtension | |
| CNativeSelection | |
| CNativeSorting | |
| CNativeTriangle2D | |
| CNativeTriangle3D | |
| CObjUtil | |
| COctreeNode | |
| CPolygon2DGeneration | |
| CPolygon2DPointLocation | |
| CPolygon2DPointLocationJobs | |
| CPolygon2DTriangulation | |
| CPolygon2DTriangulationJobs | |
| CPositionFilterJobs | |
| CQuadtreeNode | |
| CRandomUtil | |
| CRectExtensions | |
| CLineIntersectionJobs.SegmentTreeCode | |
| CMapOverlayJobs.SegmentTreeCode | |
| CSpecialQueryJobs.ShapeEventPoint2D | |
| CSpecialQueryJobs.ShapeEventPoint3D | |
| CShapeIntersection | |
| CShapeLocation | |
| CShapeOverlap | |
| CSpecialQuery | |
| CSpecialQueryJobs | |
| CStatisticsUtil | |
| CTetrahedron | |
| CTorus | |
| CUnsafeListExtension | |
| CVector2Extension | |
| CVector3Extension | |
| CVectorUtil | |
| CVoronoi2D | |
| CVoronoi2DJobs | |
1.12.0