Uses of Interface
ProGAL.dataStructures.SortTool

Packages that use SortTool

ProGAL.dataStructures
ProGAL.geom3d.complex.delaunayComplex	A Delaunay complex for a set of d-dimensional points is a tesselation of the points such that no point is inside the circumscribing hypersphere of the d-simplices (for the 3D case: Tetrahedra).

Uses of SortTool in ProGAL.dataStructures

Classes in ProGAL.dataStructures that implement SortTool

class	SortToolDouble
class	SortToolInteger
class	SortToolLineSegment2dAroundCommonPoint
class	SortToolLineSegment2dByLength
class	SortToolPoint2dAroundOrigo
class	SortToolPoint2dAroundPoint
class	SortToolPoint2dDistance
class	SortToolPoint2dXY
class	SortToolString

Methods in ProGAL.dataStructures with parameters of type SortTool

java.lang.Object	Set.binarySearch(SortTool tool, java.lang.Object object)
int	Set.partition(SortTool tool, int left, int right)
void	Sorter.Sort(Set set, SortTool tool)
void	SorterQuick.Sort(Set set, SortTool tool, boolean descending)
abstract void	Sorter.Sort(Set set, SortTool tool, boolean descending)

Constructors in ProGAL.dataStructures with parameters of type SortTool

Heap(int capacity, SortTool tool)

Heap(Set<java.lang.Object> set, SortTool tool)

Uses of SortTool in ProGAL.geom3d.complex.delaunayComplex

Classes in ProGAL.geom3d.complex.delaunayComplex that implement SortTool

class

DelaunayComplexRotation.HeapItemComp