SSJ  3.2.1
Stochastic Simulation in Java
 All Classes Namespaces Functions Variables Pages
Classes
Package umontreal.ssj.util.sort

This package contains classes for sorting, in particular to sort multi-dimensional points. More...

Classes

class  BatchSort< T extends MultiDimComparable<?super T > >
 This class implements a MultiDimSortComparable that performs a batch sort on multivariate arrays. More...
 
class  BatchSortPow2
 This is a subclass of BatchSort for which the batch numbers \(n_j\) are always powers of 2. More...
 
class  DoubleArrayComparator
 An implementation of Comparator which compares two double arrays by comparing their i-th element, where i is given in the constructor. More...
 
class  HilbertCurveBatchSort< T extends MultiDimComparable<?super T > >
 This sort is similar to BatchSortPow2, except that after applying the batch sort, the objects are given labels that map them to the \(d\)-dimensional unit hypercube \([0,1)^d\) as explained below, and then re-ordered by following a Hilbert curve as in the HilbertCurveSort. More...
 
class  HilbertCurveMap
 This class implements the mapping of a Hilbert curve in the \(d\)-dimensional unit hypercube \([0,1)^d\). More...
 
class  HilbertCurveSort
 This class implements a MultiDimSort01<T extends MultiDim01> that can sort an array of points in the \(d\)-dimensional unit hypercube \([0,1)^d\), by following a Hilbert curve, and using (at most) the first \(m\) bits of each point. More...
 
interface  MultiDim01
 This interface represents a point or array of \(d\) dimensions in a unit hypercube \([0, 1)^d\). More...
 
interface  MultiDimComparable< T >
 This interface is an extension (or variant) of the Comparable interface in Java. More...
 
class  MultiDimComparator< T extends MultiDimComparable<?super T > >
 This class is useful if one wishes to perform an ordinary one-dimensional sort on MultiDimComparable<T> objects based on a single coordinate \(j\), which is specified in the constructor. More...
 
interface  MultiDimSort01< T extends MultiDim01 >
 This interface extends MultiDimSort<T> to implement multivariate sorting algorithms that sort points of \(d\) dimensions in the unit hypercube \([0, 1)^d\). More...
 
interface  MultiDimSort< T >
 This interface is meant to be implemented by certain multivariate sorting algorithms that sort objects based on different fields (or dimensions). More...
 
interface  MultiDimSortComparable< T extends MultiDimComparable<?super T > >
 This interface extends MultiDimSort<T> to implement multivariate sorting algorithms that sort objects that are pairwise comparable. More...
 
class  OneDimSort< T extends MultiDimComparable<?super T > >
 This class implements a MultiDimSortComparable that simply sorts the objects according to a given sorting coordinate \(j \ge0\) specified in the constructor. More...
 
class  SplitSort< T extends MultiDimComparable<?super T > >
 Implements a MultiDimSortComparable that performs a split sort on a MultiDimComparable<T> array based on its first \(d\) dimensions. More...
 

Detailed Description

This package contains classes for sorting, in particular to sort multi-dimensional points.