SSJ  3.3.1
Stochastic Simulation in Java
List of all members
MultiDimSortComparable< T extends MultiDimComparable<? super T > Interface Template Reference

This interface extends MultiDimSort<T> to implement multivariate sorting algorithms that sort objects that are pairwise comparable. More...

Inheritance diagram for MultiDimSortComparable< T extends MultiDimComparable<? super T >:
[legend]
Collaboration diagram for MultiDimSortComparable< T extends MultiDimComparable<? super T >:
[legend]

Additional Inherited Members

- Public Member Functions inherited from MultiDimSort< T >
void sort (T[] a, int iMin, int iMax)
 Sorts the subarray of a made of the elements with indices from iMin to iMax-1. More...
 
void sort (T[] a)
 Sorts the entire array a. More...
 
void sort (double[][] a, int iMin, int iMax)
 Sorts the subarray of a made of the elements with indices from iMin to iMax-1, using the natural order for real numbers for each coordinate. More...
 
void sort (double[][] a)
 Same as above, but sorts the entire array. More...
 
int dimension ()
 Returns the number of dimensions used in the sort. More...
 

Detailed Description

This interface extends MultiDimSort<T> to implement multivariate sorting algorithms that sort objects that are pairwise comparable.

These objects have \(d\) sorting fields (or coordinates) and must implement the interface MultiDimComparable, which is used to sort them on any given coordinate, numbered from 0 to \(d-1\).

The ordering is induced by the method umontreal.ssj.util.MultiDimComparable.compareTo, and the number of the largest coordinate used by the sort must not exceed \(d-1\), where the dimension \(d\) refers to the value returned by umontreal.ssj.util.MultiDimComparable.dimension. One can sort only a subset of the objects, or all of them.


The documentation for this interface was generated from the following file: