src.it.unimi.dsi.fastutil.floats.FloatArrays Maven / Gradle / Ivy
/* Generic definitions */
/* Assertions (useful to generate conditional code) */
/* Current type and class (and size, if applicable) */
/* Value methods */
/* Interfaces (keys) */
/* Interfaces (values) */
/* Abstract implementations (keys) */
/* Abstract implementations (values) */
/* Static containers (keys) */
/* Static containers (values) */
/* Implementations */
/* Synchronized wrappers */
/* Unmodifiable wrappers */
/* Other wrappers */
/* Methods (keys) */
/* Methods (values) */
/* Methods (keys/values) */
/* Methods that have special names depending on keys (but the special names depend on values) */
/* Equality */
/* Object/Reference-only definitions (keys) */
/* Primitive-type-only definitions (keys) */
/* Object/Reference-only definitions (values) */
/*
* Copyright (C) 2002-2013 Sebastiano Vigna
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*
*
* For the sorting and binary search code:
*
* Copyright (C) 1999 CERN - European Organization for Nuclear Research.
*
* Permission to use, copy, modify, distribute and sell this software and
* its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and that
* both that copyright notice and this permission notice appear in
* supporting documentation. CERN makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without expressed or implied warranty.
*/
package it.unimi.dsi.fastutil.floats;
import it.unimi.dsi.fastutil.Arrays;
import it.unimi.dsi.fastutil.Hash;
import java.util.Random;
/** A class providing static methods and objects that do useful things with type-specific arrays.
*
* In particular, the ensureCapacity(), grow(),
* trim() and setLength() methods allow to handle
* arrays much like array lists. This can be very useful when efficiency (or
* syntactic simplicity) reasons make array lists unsuitable.
*
*
Note that {@link it.unimi.dsi.fastutil.io.BinIO} and {@link it.unimi.dsi.fastutil.io.TextIO}
* contain several methods make it possible to load and save arrays of primitive types as sequences
* of elements in {@link java.io.DataInput} format (i.e., not as objects) or as sequences of lines of text.
*
* @see java.util.Arrays
*/
public class FloatArrays {
private FloatArrays() {}
/** A static, final, empty array. */
public final static float[] EMPTY_ARRAY = {};
/** Ensures that an array can contain the given number of entries.
*
*
If you cannot foresee whether this array will need again to be
* enlarged, you should probably use grow() instead.
*
* @param array an array.
* @param length the new minimum length for this array.
* @return array, if it contains length entries or more; otherwise,
* an array with length entries whose first array.length
* entries are the same as those of array.
*/
public static float[] ensureCapacity( final float[] array, final int length ) {
if ( length > array.length ) {
final float t[] =
new float[ length ];
System.arraycopy( array, 0, t, 0, array.length );
return t;
}
return array;
}
/** Ensures that an array can contain the given number of entries, preserving just a part of the array.
*
* @param array an array.
* @param length the new minimum length for this array.
* @param preserve the number of elements of the array that must be preserved in case a new allocation is necessary.
* @return array, if it can contain length entries or more; otherwise,
* an array with length entries whose first preserve
* entries are the same as those of array.
*/
public static float[] ensureCapacity( final float[] array, final int length, final int preserve ) {
if ( length > array.length ) {
final float t[] =
new float[ length ];
System.arraycopy( array, 0, t, 0, preserve );
return t;
}
return array;
}
/** Grows the given array to the maximum between the given length and
* the current length multiplied by two, provided that the given
* length is larger than the current length.
*
*
If you want complete control on the array growth, you
* should probably use ensureCapacity() instead.
*
* @param array an array.
* @param length the new minimum length for this array.
* @return array, if it can contain length
* entries; otherwise, an array with
* max(length,array.length/φ) entries whose first
* array.length entries are the same as those of array.
* */
public static float[] grow( final float[] array, final int length ) {
if ( length > array.length ) {
final int newLength = (int)Math.min( Math.max( 2L * array.length, length ), Arrays.MAX_ARRAY_SIZE );
final float t[] =
new float[ newLength ];
System.arraycopy( array, 0, t, 0, array.length );
return t;
}
return array;
}
/** Grows the given array to the maximum between the given length and
* the current length multiplied by two, provided that the given
* length is larger than the current length, preserving just a part of the array.
*
*
If you want complete control on the array growth, you
* should probably use ensureCapacity() instead.
*
* @param array an array.
* @param length the new minimum length for this array.
* @param preserve the number of elements of the array that must be preserved in case a new allocation is necessary.
* @return array, if it can contain length
* entries; otherwise, an array with
* max(length,array.length/φ) entries whose first
* preserve entries are the same as those of array.
* */
public static float[] grow( final float[] array, final int length, final int preserve ) {
if ( length > array.length ) {
final int newLength = (int)Math.min( Math.max( 2L * array.length, length ), Arrays.MAX_ARRAY_SIZE );
final float t[] =
new float[ newLength ];
System.arraycopy( array, 0, t, 0, preserve );
return t;
}
return array;
}
/** Trims the given array to the given length.
*
* @param array an array.
* @param length the new maximum length for the array.
* @return array, if it contains length
* entries or less; otherwise, an array with
* length entries whose entries are the same as
* the first length entries of array.
*
*/
public static float[] trim( final float[] array, final int length ) {
if ( length >= array.length ) return array;
final float t[] =
length == 0 ? EMPTY_ARRAY : new float[ length ];
System.arraycopy( array, 0, t, 0, length );
return t;
}
/** Sets the length of the given array.
*
* @param array an array.
* @param length the new length for the array.
* @return array, if it contains exactly length
* entries; otherwise, if it contains more than
* length entries, an array with length entries
* whose entries are the same as the first length entries of
* array; otherwise, an array with length entries
* whose first array.length entries are the same as those of
* array.
*
*/
public static float[] setLength( final float[] array, final int length ) {
if ( length == array.length ) return array;
if ( length < array.length ) return trim( array, length );
return ensureCapacity( array, length );
}
/** Returns a copy of a portion of an array.
*
* @param array an array.
* @param offset the first element to copy.
* @param length the number of elements to copy.
* @return a new array containing length elements of array starting at offset.
*/
public static float[] copy( final float[] array, final int offset, final int length ) {
ensureOffsetLength( array, offset, length );
final float[] a =
length == 0 ? EMPTY_ARRAY : new float[ length ];
System.arraycopy( array, offset, a, 0, length );
return a;
}
/** Returns a copy of an array.
*
* @param array an array.
* @return a copy of array.
*/
public static float[] copy( final float[] array ) {
return array.clone();
}
/** Fills the given array with the given value.
*
*
This method uses a backward loop. It is significantly faster than the corresponding
* method in {@link java.util.Arrays}.
*
* @param array an array.
* @param value the new value for all elements of the array.
*/
public static void fill( final float[] array, final float value ) {
int i = array.length;
while( i-- != 0 ) array[ i ] = value;
}
/** Fills a portion of the given array with the given value.
*
*
If possible (i.e., from is 0) this method uses a
* backward loop. In this case, it is significantly faster than the
* corresponding method in {@link java.util.Arrays}.
*
* @param array an array.
* @param from the starting index of the portion to fill (inclusive).
* @param to the end index of the portion to fill (exclusive).
* @param value the new value for all elements of the specified portion of the array.
*/
public static void fill( final float[] array, final int from, int to, final float value ) {
ensureFromTo( array, from, to );
if ( from == 0 ) while( to-- != 0 ) array[ to ] = value;
else for( int i = from; i < to; i++ ) array[ i ] = value;
}
/** Returns true if the two arrays are elementwise equal.
*
* @param a1 an array.
* @param a2 another array.
* @return true if the two arrays are of the same length, and their elements are equal.
* @deprecated Please use the corresponding {@link java.util.Arrays} method, which is intrinsified in recent JVMs.
*/
@Deprecated
public static boolean equals( final float[] a1, final float a2[] ) {
int i = a1.length;
if ( i != a2.length ) return false;
while( i-- != 0 ) if (! ( (a1[ i ]) == (a2[ i ]) ) ) return false;
return true;
}
/** Ensures that a range given by its first (inclusive) and last (exclusive) elements fits an array.
*
*
This method may be used whenever an array range check is needed.
*
* @param a an array.
* @param from a start index (inclusive).
* @param to an end index (exclusive).
* @throws IllegalArgumentException if from is greater than to.
* @throws ArrayIndexOutOfBoundsException if from or to are greater than the array length or negative.
*/
public static void ensureFromTo( final float[] a, final int from, final int to ) {
Arrays.ensureFromTo( a.length, from, to );
}
/** Ensures that a range given by an offset and a length fits an array.
*
*
This method may be used whenever an array range check is needed.
*
* @param a an array.
* @param offset a start index.
* @param length a length (the number of elements in the range).
* @throws IllegalArgumentException if length is negative.
* @throws ArrayIndexOutOfBoundsException if offset is negative or offset+length is greater than the array length.
*/
public static void ensureOffsetLength( final float[] a, final int offset, final int length ) {
Arrays.ensureOffsetLength( a.length, offset, length );
}
private static final int SMALL = 7;
private static final int MEDIUM = 50;
private static void swap( final float x[], final int a, final int b ) {
final float t = x[ a ];
x[ a ] = x[ b ];
x[ b ] = t;
}
private static void vecSwap( final float[] x, int a, int b, final int n ) {
for( int i = 0; i < n; i++, a++, b++ ) swap( x, a, b );
}
private static int med3( final float x[], final int a, final int b, final int c, FloatComparator comp ) {
int ab = comp.compare( x[ a ], x[ b ] );
int ac = comp.compare( x[ a ], x[ c ] );
int bc = comp.compare( x[ b ], x[ c ] );
return ( ab < 0 ?
( bc < 0 ? b : ac < 0 ? c : a ) :
( bc > 0 ? b : ac > 0 ? c : a ) );
}
private static void selectionSort( final float[] a, final int from, final int to, final FloatComparator comp ) {
for( int i = from; i < to - 1; i++ ) {
int m = i;
for( int j = i + 1; j < to; j++ ) if ( comp.compare( a[ j ], a[ m ] ) < 0 ) m = j;
if ( m != i ) {
final float u = a[ i ];
a[ i ] = a[ m ];
a[ m ] = u;
}
}
}
private static void insertionSort( final float[] a, final int from, final int to, final FloatComparator comp ) {
for ( int i = from; ++i < to; ) {
float t = a[ i ];
int j = i;
for ( float u = a[ j - 1 ]; comp.compare( t, u ) < 0; u = a[ --j - 1 ] ) {
a[ j ] = u;
if ( from == j - 1 ) {
--j;
break;
}
}
a[ j ] = t;
}
}
@SuppressWarnings("unchecked")
private static void selectionSort( final float[] a, final int from, final int to ) {
for( int i = from; i < to - 1; i++ ) {
int m = i;
for( int j = i + 1; j < to; j++ ) if ( ( Float.compare((a[ j ]),(a[ m ])) < 0 ) ) m = j;
if ( m != i ) {
final float u = a[ i ];
a[ i ] = a[ m ];
a[ m ] = u;
}
}
}
@SuppressWarnings("unchecked")
private static void insertionSort( final float[] a, final int from, final int to ) {
for ( int i = from; ++i < to; ) {
float t = a[ i ];
int j = i;
for ( float u = a[ j - 1 ]; ( Float.compare((t),(u)) < 0 ); u = a[ --j - 1 ] ) {
a[ j ] = u;
if ( from == j - 1 ) {
--j;
break;
}
}
a[ j ] = t;
}
}
/** Sorts the specified range of elements according to the order induced by the specified
* comparator using quicksort.
*
*
The sorting algorithm is a tuned quicksort adapted from Jon L. Bentley and M. Douglas
* McIlroy, “Engineering a Sort Function”, Software: Practice and Experience, 23(11), pages
* 1249−1265, 1993.
*
* @param x the array to be sorted.
* @param from the index of the first element (inclusive) to be sorted.
* @param to the index of the last element (exclusive) to be sorted.
* @param comp the comparator to determine the sorting order.
*
*/
public static void quickSort( final float[] x, final int from, final int to, final FloatComparator comp ) {
final int len = to - from;
// Selection sort on smallest arrays
if ( len < SMALL ) {
selectionSort( x, from, to, comp );
return;
}
// Choose a partition element, v
int m = from + len / 2; // Small arrays, middle element
if ( len > SMALL ) {
int l = from;
int n = to - 1;
if ( len > MEDIUM ) { // Big arrays, pseudomedian of 9
int s = len / 8;
l = med3( x, l, l + s, l + 2 * s, comp );
m = med3( x, m - s, m, m + s, comp );
n = med3( x, n - 2 * s, n - s, n, comp );
}
m = med3( x, l, m, n, comp ); // Mid-size, med of 3
}
final float v = x[ m ];
// Establish Invariant: v* (v)* v*
int a = from, b = a, c = to - 1, d = c;
while(true) {
int comparison;
while ( b <= c && ( comparison = comp.compare( x[ b ], v ) ) <= 0 ) {
if ( comparison == 0 ) swap( x, a++, b );
b++;
}
while (c >= b && ( comparison = comp.compare( x[ c ], v ) ) >=0 ) {
if ( comparison == 0 ) swap( x, c, d-- );
c--;
}
if ( b > c ) break;
swap( x, b++, c-- );
}
// Swap partition elements back to middle
int s, n = to;
s = Math.min( a - from, b - a );
vecSwap( x, from, b - s, s );
s = Math.min( d - c, n - d - 1 );
vecSwap( x, b, n - s, s );
// Recursively sort non-partition-elements
if ( ( s = b - a ) > 1 ) quickSort( x, from, from + s, comp );
if ( ( s = d - c ) > 1 ) quickSort( x, n - s, n, comp );
}
/** Sorts an array according to the order induced by the specified
* comparator using quicksort.
*
* The sorting algorithm is a tuned quicksort adapted from Jon L. Bentley and M. Douglas
* McIlroy, “Engineering a Sort Function”, Software: Practice and Experience, 23(11), pages
* 1249−1265, 1993.
*
* @param x the array to be sorted.
* @param comp the comparator to determine the sorting order.
*
*/
public static void quickSort( final float[] x, final FloatComparator comp ) {
quickSort( x, 0, x.length, comp );
}
@SuppressWarnings("unchecked")
private static int med3( final float x[], final int a, final int b, final int c ) {
int ab = ( Float.compare((x[ a ]),(x[ b ])) );
int ac = ( Float.compare((x[ a ]),(x[ c ])) );
int bc = ( Float.compare((x[ b ]),(x[ c ])) );
return ( ab < 0 ?
( bc < 0 ? b : ac < 0 ? c : a ) :
( bc > 0 ? b : ac > 0 ? c : a ) );
}
/** Sorts the specified range of elements according to the natural ascending order using quicksort.
*
*
The sorting algorithm is a tuned quicksort adapted from Jon L. Bentley and M. Douglas
* McIlroy, “Engineering a Sort Function”, Software: Practice and Experience, 23(11), pages
* 1249−1265, 1993.
*
* @param x the array to be sorted.
* @param from the index of the first element (inclusive) to be sorted.
* @param to the index of the last element (exclusive) to be sorted.
* @deprecated Use the corresponding {@code sort()} method in {@link java.util.Arrays}.
*/
@SuppressWarnings("unchecked")
@Deprecated
public static void quickSort( final float[] x, final int from, final int to ) {
final int len = to - from;
// Selection sort on smallest arrays
if ( len < SMALL ) {
selectionSort( x, from, to );
return;
}
// Choose a partition element, v
int m = from + len / 2; // Small arrays, middle element
if ( len > SMALL ) {
int l = from;
int n = to - 1;
if ( len > MEDIUM ) { // Big arrays, pseudomedian of 9
int s = len / 8;
l = med3( x, l, l + s, l + 2 * s );
m = med3( x, m - s, m, m + s );
n = med3( x, n - 2 * s, n - s, n );
}
m = med3( x, l, m, n ); // Mid-size, med of 3
}
final float v = x[ m ];
// Establish Invariant: v* (v)* v*
int a = from, b = a, c = to - 1, d = c;
while(true) {
int comparison;
while ( b <= c && ( comparison = ( Float.compare((x[ b ]),(v)) ) ) <= 0 ) {
if ( comparison == 0 ) swap( x, a++, b );
b++;
}
while (c >= b && ( comparison = ( Float.compare((x[ c ]),(v)) ) ) >=0 ) {
if ( comparison == 0 ) swap( x, c, d-- );
c--;
}
if ( b > c ) break;
swap( x, b++, c-- );
}
// Swap partition elements back to middle
int s, n = to;
s = Math.min( a - from, b - a );
vecSwap( x, from, b - s, s );
s = Math.min( d - c, n - d - 1 );
vecSwap( x, b, n - s, s );
// Recursively sort non-partition-elements
if ( ( s = b - a ) > 1 ) quickSort( x, from, from + s );
if ( ( s = d - c ) > 1 ) quickSort( x, n - s, n );
}
/** Sorts an array according to the natural ascending order using quicksort.
*
* The sorting algorithm is a tuned quicksort adapted from Jon L. Bentley and M. Douglas
* McIlroy, “Engineering a Sort Function”, Software: Practice and Experience, 23(11), pages
* 1249−1265, 1993.
*
* @param x the array to be sorted.
*
* @deprecated Use the corresponding {@code sort()} method in {@link java.util.Arrays}.
*/
@Deprecated
public static void quickSort( final float[] x ) {
quickSort( x, 0, x.length );
}
/** Sorts the specified range of elements according to the natural ascending order using mergesort, using a given support array.
*
*
This sort is guaranteed to be stable: equal elements will not be reordered as a result
* of the sort. Moreover, no support arrays will be allocated.
* @param a the array to be sorted.
* @param from the index of the first element (inclusive) to be sorted.
* @param to the index of the last element (exclusive) to be sorted.
* @param supp a support array containing at least to elements.
*/
@SuppressWarnings("unchecked")
public static void mergeSort( final float a[], final int from, final int to, final float supp[] ) {
int len = to - from;
// Insertion sort on smallest arrays
if ( len < SMALL ) {
insertionSort( a, from, to );
return;
}
// Recursively sort halves of a into supp
final int mid = ( from + to ) >>> 1;
mergeSort( supp, from, mid, a );
mergeSort( supp, mid, to, a );
// If list is already sorted, just copy from supp to a. This is an
// optimization that results in faster sorts for nearly ordered lists.
if ( ( Float.compare((supp[ mid - 1 ]),(supp[ mid ])) <= 0 ) ) {
System.arraycopy( supp, from, a, from, len );
return;
}
// Merge sorted halves (now in supp) into a
for( int i = from, p = from, q = mid; i < to; i++ ) {
if ( q >= to || p < mid && ( Float.compare((supp[ p ]),(supp[ q ])) <= 0 ) ) a[ i ] = supp[ p++ ];
else a[ i ] = supp[ q++ ];
}
}
/** Sorts the specified range of elements according to the natural ascending order using mergesort.
*
*
This sort is guaranteed to be stable: equal elements will not be reordered as a result
* of the sort. An array as large as a will be allocated by this method.
* @param a the array to be sorted.
* @param from the index of the first element (inclusive) to be sorted.
* @param to the index of the last element (exclusive) to be sorted.
*/
public static void mergeSort( final float a[], final int from, final int to ) {
mergeSort( a, from, to, a.clone() );
}
/** Sorts an array according to the natural ascending order using mergesort.
*
*
This sort is guaranteed to be stable: equal elements will not be reordered as a result
* of the sort. An array as large as a will be allocated by this method.
* @param a the array to be sorted.
*/
public static void mergeSort( final float a[] ) {
mergeSort( a, 0, a.length );
}
/** Sorts the specified range of elements according to the order induced by the specified
* comparator using mergesort, using a given support array.
*
*
This sort is guaranteed to be stable: equal elements will not be reordered as a result
* of the sort. Moreover, no support arrays will be allocated.
* @param a the array to be sorted.
* @param from the index of the first element (inclusive) to be sorted.
* @param to the index of the last element (exclusive) to be sorted.
* @param comp the comparator to determine the sorting order.
* @param supp a support array containing at least to elements.
*/
@SuppressWarnings("unchecked")
public static void mergeSort( final float a[], final int from, final int to, FloatComparator comp, final float supp[] ) {
int len = to - from;
// Insertion sort on smallest arrays
if ( len < SMALL ) {
insertionSort( a, from, to, comp );
return;
}
// Recursively sort halves of a into supp
final int mid = ( from + to ) >>> 1;
mergeSort( supp, from, mid, comp, a );
mergeSort( supp, mid, to, comp, a );
// If list is already sorted, just copy from supp to a. This is an
// optimization that results in faster sorts for nearly ordered lists.
if ( comp.compare( supp[ mid - 1 ], supp[ mid ] ) <= 0 ) {
System.arraycopy( supp, from, a, from, len );
return;
}
// Merge sorted halves (now in supp) into a
for( int i = from, p = from, q = mid; i < to; i++ ) {
if ( q >= to || p < mid && comp.compare( supp[ p ], supp[ q ] ) <= 0 ) a[ i ] = supp[ p++ ];
else a[ i ] = supp[ q++ ];
}
}
/** Sorts the specified range of elements according to the order induced by the specified
* comparator using mergesort.
*
*
This sort is guaranteed to be stable: equal elements will not be reordered as a result
* of the sort. An array as large as a will be allocated by this method.
*
* @param a the array to be sorted.
* @param from the index of the first element (inclusive) to be sorted.
* @param to the index of the last element (exclusive) to be sorted.
* @param comp the comparator to determine the sorting order.
*/
public static void mergeSort( final float a[], final int from, final int to, FloatComparator comp ) {
mergeSort( a, from, to, comp, a.clone() );
}
/** Sorts an array according to the order induced by the specified
* comparator using mergesort.
*
*
This sort is guaranteed to be stable: equal elements will not be reordered as a result
* of the sort. An array as large as a will be allocated by this method.
* @param a the array to be sorted.
* @param comp the comparator to determine the sorting order.
*/
public static void mergeSort( final float a[], FloatComparator comp ) {
mergeSort( a, 0, a.length, comp );
}
/**
* Searches a range of the specified array for the specified value using
* the binary search algorithm. The range must be sorted prior to making this call.
* If it is not sorted, the results are undefined. If the range contains multiple elements with
* the specified value, there is no guarantee which one will be found.
*
* @param a the array to be searched.
* @param from the index of the first element (inclusive) to be searched.
* @param to the index of the last element (exclusive) to be searched.
* @param key the value to be searched for.
* @return index of the search key, if it is contained in the array;
* otherwise, (-(insertion point) - 1). The insertion
* point is defined as the the point at which the value would
* be inserted into the array: the index of the first
* element greater than the key, or the length of the array, if all
* elements in the array are less than the specified key. Note
* that this guarantees that the return value will be >= 0 if
* and only if the key is found.
* @see java.util.Arrays
*/
@SuppressWarnings({"unchecked","rawtypes"})
public static int binarySearch( final float[] a, int from, int to, final float key ) {
float midVal;
to--;
while (from <= to) {
final int mid = (from + to) >>> 1;
midVal = a[ mid ];
if (midVal < key) from = mid + 1;
else if (midVal > key) to = mid - 1;
else return mid;
}
return -( from + 1 );
}
/**
* Searches an array for the specified value using
* the binary search algorithm. The range must be sorted prior to making this call.
* If it is not sorted, the results are undefined. If the range contains multiple elements with
* the specified value, there is no guarantee which one will be found.
*
* @param a the array to be searched.
* @param key the value to be searched for.
* @return index of the search key, if it is contained in the array;
* otherwise, (-(insertion point) - 1). The insertion
* point is defined as the the point at which the value would
* be inserted into the array: the index of the first
* element greater than the key, or the length of the array, if all
* elements in the array are less than the specified key. Note
* that this guarantees that the return value will be >= 0 if
* and only if the key is found.
* @see java.util.Arrays
*/
public static int binarySearch( final float[] a, final float key ) {
return binarySearch( a, 0, a.length, key );
}
/**
* Searches a range of the specified array for the specified value using
* the binary search algorithm and a specified comparator. The range must be sorted following the comparator prior to making this call.
* If it is not sorted, the results are undefined. If the range contains multiple elements with
* the specified value, there is no guarantee which one will be found.
*
* @param a the array to be searched.
* @param from the index of the first element (inclusive) to be searched.
* @param to the index of the last element (exclusive) to be searched.
* @param key the value to be searched for.
* @param c a comparator.
* @return index of the search key, if it is contained in the array;
* otherwise, (-(insertion point) - 1). The insertion
* point is defined as the the point at which the value would
* be inserted into the array: the index of the first
* element greater than the key, or the length of the array, if all
* elements in the array are less than the specified key. Note
* that this guarantees that the return value will be >= 0 if
* and only if the key is found.
* @see java.util.Arrays
*/
public static int binarySearch( final float[] a, int from, int to, final float key, final FloatComparator c ) {
float midVal;
to--;
while (from <= to) {
final int mid = (from + to) >>> 1;
midVal = a[ mid ];
final int cmp = c.compare( midVal, key );
if ( cmp < 0 ) from = mid + 1;
else if (cmp > 0) to = mid - 1;
else return mid; // key found
}
return -( from + 1 );
}
/**
* Searches an array for the specified value using
* the binary search algorithm and a specified comparator. The range must be sorted following the comparator prior to making this call.
* If it is not sorted, the results are undefined. If the range contains multiple elements with
* the specified value, there is no guarantee which one will be found.
*
* @param a the array to be searched.
* @param key the value to be searched for.
* @param c a comparator.
* @return index of the search key, if it is contained in the array;
* otherwise, (-(insertion point) - 1). The insertion
* point is defined as the the point at which the value would
* be inserted into the array: the index of the first
* element greater than the key, or the length of the array, if all
* elements in the array are less than the specified key. Note
* that this guarantees that the return value will be >= 0 if
* and only if the key is found.
* @see java.util.Arrays
*/
public static int binarySearch( final float[] a, final float key, final FloatComparator c ) {
return binarySearch( a, 0, a.length, key, c );
}
/** The size of a digit used during radix sort (must be a power of 2). */
private static final int DIGIT_BITS = 8;
/** The mask to extract a digit of {@link #DIGIT_BITS} bits. */
private static final int DIGIT_MASK = ( 1 << DIGIT_BITS ) - 1;
/** The number of digits per element. */
private static final int DIGITS_PER_ELEMENT = Float.SIZE / DIGIT_BITS;
/** This method fixes negative numbers so that the combination exponent/significand is lexicographically sorted. */
private static final long fixFloat( final float f ) {
final long i = Float.floatToIntBits( f );
return i >= 0 ? i : i ^ 0x7FFFFFFF;
}
/** Sorts the specified array using radix sort.
*
*
The sorting algorithm is a tuned radix sort adapted from Peter M. McIlroy, Keith Bostic and M. Douglas
* McIlroy, “Engineering radix sort”, Computing Systems, 6(1), pages 5−27 (1993),
* and further improved using the digit-oracle idea described by
* Juha Kärkkäinen and Tommi Rantala in “Engineering radix sort for strings”,
* String Processing and Information Retrieval, 15th International Symposium, volume 5280 of
* Lecture Notes in Computer Science, pages 3−14, Springer (2008).
*
*
This implementation is significantly faster than quicksort
* already at small sizes (say, more than 10000 elements), but it can only
* sort in ascending order.
* It will allocate a support array of bytes with the same number of elements as the array to be sorted.
*
* @param a the array to be sorted.
*/
public static void radixSort( final float[] a ) {
radixSort( a, 0, a.length );
}
/** Sorts the specified array using radix sort.
*
*
The sorting algorithm is a tuned radix sort adapted from Peter M. McIlroy, Keith Bostic and M. Douglas
* McIlroy, “Engineering radix sort”, Computing Systems, 6(1), pages 5−27 (1993),
* and further improved using the digit-oracle idea described by
* Juha Kärkkäinen and Tommi Rantala in “Engineering radix sort for strings”,
* String Processing and Information Retrieval, 15th International Symposium, volume 5280 of
* Lecture Notes in Computer Science, pages 3−14, Springer (2008).
*
*
This implementation is significantly faster than quicksort
* already at small sizes (say, more than 10000 elements), but it can only
* sort in ascending order.
* It will allocate a support array of bytes with the same number of elements as the array to be sorted.
*
* @param a the array to be sorted.
* @param from the index of the first element (inclusive) to be sorted.
* @param to the index of the last element (exclusive) to be sorted.
*/
public static void radixSort( final float[] a, final int from, final int to ) {
final int maxLevel = DIGITS_PER_ELEMENT - 1;
final int stackSize = ( ( 1 << DIGIT_BITS ) - 1 ) * ( DIGITS_PER_ELEMENT - 1 ) + 1;
final int[] offsetStack = new int[ stackSize ];
int offsetPos = 0;
final int[] lengthStack = new int[ stackSize ];
int lengthPos = 0;
final int[] levelStack = new int[ stackSize ];
int levelPos = 0;
offsetStack[ offsetPos++ ] = from;
lengthStack[ lengthPos++ ] = to - from;
levelStack[ levelPos++ ] = 0;
final int[] count = new int[ 1 << DIGIT_BITS ];
final int[] pos = new int[ 1 << DIGIT_BITS ];
final byte[] digit = new byte[ to - from ];
while( offsetPos > 0 ) {
final int first = offsetStack[ --offsetPos ];
final int length = lengthStack[ --lengthPos ];
final int level = levelStack[ --levelPos ];
final int signMask = level % DIGITS_PER_ELEMENT == 0 ? 1 << DIGIT_BITS - 1 : 0;
if ( length < MEDIUM ) {
selectionSort( a, first, first + length );
continue;
}
final int shift = ( DIGITS_PER_ELEMENT - 1 - level % DIGITS_PER_ELEMENT ) * DIGIT_BITS; // This is the shift that extract the right byte from a key
// Count keys.
for( int i = length; i-- != 0; ) digit[ i ] = (byte)( ( ( fixFloat(a[ first + i ]) >>> shift ) & DIGIT_MASK ) ^ signMask );
for( int i = length; i-- != 0; ) count[ digit[ i ] & 0xFF ]++;
// Compute cumulative distribution and push non-singleton keys on stack.
int lastUsed = -1;
for( int i = 0, p = 0; i < 1 << DIGIT_BITS; i++ ) {
if ( count[ i ] != 0 ) {
lastUsed = i;
if ( level < maxLevel && count[ i ] > 1 ){
//System.err.println( " Pushing " + new StackEntry( first + pos[ i - 1 ], first + pos[ i ], level + 1 ) );
offsetStack[ offsetPos++ ] = p + first;
lengthStack[ lengthPos++ ] = count[ i ];
levelStack[ levelPos++ ] = level + 1;
}
}
pos[ i ] = ( p += count[ i ] );
}
// When all slots are OK, the last slot is necessarily OK.
final int end = length - count[ lastUsed ];
count[ lastUsed ] = 0;
// i moves through the start of each block
for( int i = 0, c = -1, d; i < end; i += count[ c ], count[ c ] = 0 ) {
float t = a[ i + first ];
c = digit[ i ] & 0xFF;
while( ( d = --pos[ c ] ) > i ) {
final float z = t;
final int zz = c;
t = a[ d + first ];
c = digit[ d ] & 0xFF;
a[ d + first ] = z;
digit[ d ] = (byte)zz;
}
a[ i + first ] = t;
}
}
}
private static void insertionSortIndirect( final int[] perm, final float[] a, final int from, final int to ) {
for ( int i = from; ++i < to; ) {
int t = perm[ i ];
int j = i;
for ( int u = perm[ j - 1 ]; ( Float.compare((a[ t ]),(a[ u ])) < 0 ); u = perm[ --j - 1 ] ) {
perm[ j ] = u;
if ( from == j - 1 ) {
--j;
break;
}
}
perm[ j ] = t;
}
}
/** Sorts the specified array using indirect radix sort.
*
*
The sorting algorithm is a tuned radix sort adapted from Peter M. McIlroy, Keith Bostic and M. Douglas
* McIlroy, “Engineering radix sort”, Computing Systems, 6(1), pages 5−27 (1993),
* and further improved using the digit-oracle idea described by
* Juha Kärkkäinen and Tommi Rantala in “Engineering radix sort for strings”,
* String Processing and Information Retrieval, 15th International Symposium, volume 5280 of
* Lecture Notes in Computer Science, pages 3−14, Springer (2008).
*
*
This method implement an indirect sort. The elements of perm (which must
* be exactly the numbers in the interval [0..perm.length)) will be permuted so that
* a[ perm[ i ] ] <= a[ perm[ i + 1 ] ].
*
*
This implementation is significantly faster than quicksort (unstable) or mergesort (stable)
* already at small sizes (say, more than 10000 elements), but it can only
* sort in ascending order.
* It will allocate a support array of bytes with the same number of elements as the array to be sorted,
* and, in the stable case, a further support array as large as perm (note that the stable
* version is slightly faster).
*
* @param perm a permutation array indexing a.
* @param a the array to be sorted.
* @param stable whether the sorting algorithm should be stable.
*/
public static void radixSortIndirect( final int[] perm, final float[] a, final boolean stable ) {
radixSortIndirect( perm, a, 0, perm.length, stable );
}
/** Sorts the specified array using indirect radix sort.
*
*
The sorting algorithm is a tuned radix sort adapted from Peter M. McIlroy, Keith Bostic and M. Douglas
* McIlroy, “Engineering radix sort”, Computing Systems, 6(1), pages 5−27 (1993),
* and further improved using the digit-oracle idea described by
* Juha Kärkkäinen and Tommi Rantala in “Engineering radix sort for strings”,
* String Processing and Information Retrieval, 15th International Symposium, volume 5280 of
* Lecture Notes in Computer Science, pages 3−14, Springer (2008).
*
*
This method implement an indirect sort. The elements of perm (which must
* be exactly the numbers in the interval [0..perm.length)) will be permuted so that
* a[ perm[ i ] ] <= a[ perm[ i + 1 ] ].
*
*
This implementation is significantly faster than quicksort (unstable) or mergesort (stable)
* already at small sizes (say, more than 10000 elements), but it can only
* sort in ascending order.
* It will allocate a support array of bytes with the same number of elements as the array to be sorted,
* and, in the stable case, a further support array as large as perm (note that the stable
* version is slightly faster).
*
* @param perm a permutation array indexing a.
* @param a the array to be sorted.
* @param from the index of the first element of perm (inclusive) to be permuted.
* @param to the index of the last element of perm (exclusive) to be permuted.
* @param stable whether the sorting algorithm should be stable.
*/
public static void radixSortIndirect( final int[] perm, final float[] a, final int from, final int to, final boolean stable ) {
final int maxLevel = DIGITS_PER_ELEMENT - 1;
final int stackSize = ( ( 1 << DIGIT_BITS ) - 1 ) * ( DIGITS_PER_ELEMENT - 1 ) + 1;
final int[] offsetStack = new int[ stackSize ];
int offsetPos = 0;
final int[] lengthStack = new int[ stackSize ];
int lengthPos = 0;
final int[] levelStack = new int[ stackSize ];
int levelPos = 0;
offsetStack[ offsetPos++ ] = from;
lengthStack[ lengthPos++ ] = to - from;
levelStack[ levelPos++ ] = 0;
final int[] count = new int[ 1 << DIGIT_BITS ];
final int[] pos = stable ? null : new int[ 1 << DIGIT_BITS ];
final int[] support = stable ? new int[ perm.length ] : null;
final byte[] digit = new byte[ to - from ];
while( offsetPos > 0 ) {
final int first = offsetStack[ --offsetPos ];
final int length = lengthStack[ --lengthPos ];
final int level = levelStack[ --levelPos ];
final int signMask = level % DIGITS_PER_ELEMENT == 0 ? 1 << DIGIT_BITS - 1 : 0;
if ( length < MEDIUM ) {
insertionSortIndirect( perm, a, first, first + length );
continue;
}
final int shift = ( DIGITS_PER_ELEMENT - 1 - level % DIGITS_PER_ELEMENT ) * DIGIT_BITS; // This is the shift that extract the right byte from a key
// Count keys.
for( int i = length; i-- != 0; ) digit[ i ] = (byte)( ( ( fixFloat(a[ perm[ first + i ] ]) >>> shift ) & DIGIT_MASK ) ^ signMask );
for( int i = length; i-- != 0; ) count[ digit[ i ] & 0xFF ]++;
// Compute cumulative distribution and push non-singleton keys on stack.
int lastUsed = -1;
for( int i = 0, p = 0; i < 1 << DIGIT_BITS; i++ ) {
if ( count[ i ] != 0 ) {
lastUsed = i;
if ( level < maxLevel && count[ i ] > 1 ){
offsetStack[ offsetPos++ ] = p + first;
lengthStack[ lengthPos++ ] = count[ i ];
levelStack[ levelPos++ ] = level + 1;
}
}
if ( stable ) count[ i ] = p += count[ i ];
else pos[ i ] = ( p += count[ i ] );
}
if ( stable ) {
for( int i = length; i-- != 0; ) support[ --count[ digit[ i ] & 0xFF ] ] = perm[ first + i ];
System.arraycopy( support, 0, perm, first, length );
it.unimi.dsi.fastutil.ints.IntArrays.fill( count, 0 );
}
else {
// When all slots are OK, the last slot is necessarily OK.
final int end = length - count[ lastUsed ];
count[ lastUsed ] = 0;
// i moves through the start of each block
for( int i = 0, c = -1, d; i < end; i += count[ c ], count[ c ] = 0 ) {
int t = perm[ i + first ];
c = digit[ i ] & 0xFF;
while( ( d = --pos[ c ] ) > i ) {
final int z = t;
final int zz = c;
t = perm[ d + first ];
c = digit[ d ] & 0xFF;
perm[ d + first ] = z;
digit[ d ] = (byte)zz;
}
perm[ i + first ] = t;
}
}
}
}
private static void selectionSort( final float[] a, final float[] b, final int from, final int to ) {
for( int i = from; i < to - 1; i++ ) {
int m = i;
for( int j = i + 1; j < to; j++ )
if ( a[ j ] < a[ m ] || a[ j ] == a[ m ] && b[ j ] < b[ m ] ) m = j;
if ( m != i ) {
float t = a[ i ];
a[ i ] = a[ m ];
a[ m ] = t;
t = b[ i ];
b[ i ] = b[ m ];
b[ m ] = t;
}
}
}
/** Sorts the specified pair of arrays lexicographically using radix sort.
*
The sorting algorithm is a tuned radix sort adapted from Peter M. McIlroy, Keith Bostic and M. Douglas
* McIlroy, “Engineering radix sort”, Computing Systems, 6(1), pages 5−27 (1993),
* and further improved using the digit-oracle idea described by
* Juha Kärkkäinen and Tommi Rantala in “Engineering radix sort for strings”,
* String Processing and Information Retrieval, 15th International Symposium, volume 5280 of
* Lecture Notes in Computer Science, pages 3−14, Springer (2008).
*
*
This method implements a lexicographical sorting of the arguments. Pairs of elements
* in the same position in the two provided arrays will be considered a single key, and permuted
* accordingly. In the end, either a[ i ] < a[ i + 1 ] or a[ i ] == a[ i + 1 ] and b[ i ] <= b[ i + 1 ].
*
*
This implementation is significantly faster than quicksort
* already at small sizes (say, more than 10000 elements), but it can only
* sort in ascending order. It will allocate a support array of bytes with the same number of elements as the arrays to be sorted.
*
* @param a the first array to be sorted.
* @param b the second array to be sorted.
*/
public static void radixSort( final float[] a, final float[] b ) {
radixSort( a, b, 0, a.length );
}
/** Sorts the specified pair of arrays lexicographically using radix sort.
*
*
The sorting algorithm is a tuned radix sort adapted from Peter M. McIlroy, Keith Bostic and M. Douglas
* McIlroy, “Engineering radix sort”, Computing Systems, 6(1), pages 5−27 (1993),
* and further improved using the digit-oracle idea described by
* Juha Kärkkäinen and Tommi Rantala in “Engineering radix sort for strings”,
* String Processing and Information Retrieval, 15th International Symposium, volume 5280 of
* Lecture Notes in Computer Science, pages 3−14, Springer (2008).
*
*
This method implements a lexicographical sorting of the arguments. Pairs of elements
* in the same position in the two provided arrays will be considered a single key, and permuted
* accordingly. In the end, either a[ i ] < a[ i + 1 ] or a[ i ] == a[ i + 1 ] and b[ i ] <= b[ i + 1 ].
*
*
This implementation is significantly faster than quicksort
* already at small sizes (say, more than 10000 elements), but it can only
* sort in ascending order. It will allocate a support array of bytes with the same number of elements as the arrays to be sorted.
*
* @param a the first array to be sorted.
* @param b the second array to be sorted.
* @param from the index of the first element (inclusive) to be sorted.
* @param to the index of the last element (exclusive) to be sorted.
*/
public static void radixSort( final float[] a, final float[] b, final int from, final int to ) {
final int layers = 2;
if ( a.length != b.length ) throw new IllegalArgumentException( "Array size mismatch." );
final int maxLevel = DIGITS_PER_ELEMENT * layers - 1;
final int stackSize = ( ( 1 << DIGIT_BITS ) - 1 ) * ( layers * DIGITS_PER_ELEMENT - 1 ) + 1;
final int[] offsetStack = new int[ stackSize ];
int offsetPos = 0;
final int[] lengthStack = new int[ stackSize ];
int lengthPos = 0;
final int[] levelStack = new int[ stackSize ];
int levelPos = 0;
offsetStack[ offsetPos++ ] = from;
lengthStack[ lengthPos++ ] = to - from;
levelStack[ levelPos++ ] = 0;
final int[] count = new int[ 1 << DIGIT_BITS ];
final int[] pos = new int[ 1 << DIGIT_BITS ];
final byte[] digit = new byte[ to - from ];
while( offsetPos > 0 ) {
final int first = offsetStack[ --offsetPos ];
final int length = lengthStack[ --lengthPos ];
final int level = levelStack[ --levelPos ];
final int signMask = level % DIGITS_PER_ELEMENT == 0 ? 1 << DIGIT_BITS - 1 : 0;
if ( length < MEDIUM ) {
selectionSort( a, b, first, first + length );
continue;
}
final float[] k = level < DIGITS_PER_ELEMENT ? a : b; // This is the key array
final int shift = ( DIGITS_PER_ELEMENT - 1 - level % DIGITS_PER_ELEMENT ) * DIGIT_BITS; // This is the shift that extract the right byte from a key
// Count keys.
for( int i = length; i-- != 0; ) digit[ i ] = (byte)( ( ( fixFloat(k[ first + i ]) >>> shift ) & DIGIT_MASK ) ^ signMask );
for( int i = length; i-- != 0; ) count[ digit[ i ] & 0xFF ]++;
// Compute cumulative distribution and push non-singleton keys on stack.
int lastUsed = -1;
for( int i = 0, p = 0; i < 1 << DIGIT_BITS; i++ ) {
if ( count[ i ] != 0 ) {
lastUsed = i;
if ( level < maxLevel && count[ i ] > 1 ){
offsetStack[ offsetPos++ ] = p + first;
lengthStack[ lengthPos++ ] = count[ i ];
levelStack[ levelPos++ ] = level + 1;
}
}
pos[ i ] = ( p += count[ i ] );
}
// When all slots are OK, the last slot is necessarily OK.
final int end = length - count[ lastUsed ];
count[ lastUsed ] = 0;
// i moves through the start of each block
for( int i = 0, c = -1, d; i < end; i += count[ c ], count[ c ] = 0 ) {
float t = a[ i + first ];
float u = b[ i + first ];
c = digit[ i ] & 0xFF;
while( ( d = --pos[ c ] ) > i ) {
float z = t;
final int zz = c;
t = a[ d + first ];
a[ d + first ] = z;
z = u;
u = b[ d + first ];
b[ d + first ] = z;
c = digit[ d ] & 0xFF;
digit[ d ] = (byte)zz;
}
a[ i + first ] = t;
b[ i + first ] = u;
}
}
}
private static void insertionSortIndirect( final int[] perm, final float[] a, final float[] b, final int from, final int to ) {
for ( int i = from; ++i < to; ) {
int t = perm[ i ];
int j = i;
for ( int u = perm[ j - 1 ]; ( Float.compare((a[ t ]),(a[ u ])) < 0 ) || ( Float.compare((a[ t ]),(a[ u ])) == 0 ) && ( Float.compare((b[ t ]),(b[ u ])) < 0 ); u = perm[ --j - 1 ] ) {
perm[ j ] = u;
if ( from == j - 1 ) {
--j;
break;
}
}
perm[ j ] = t;
}
}
/** Sorts the specified pair of arrays lexicographically using indirect radix sort.
*
*
The sorting algorithm is a tuned radix sort adapted from Peter M. McIlroy, Keith Bostic and M. Douglas
* McIlroy, “Engineering radix sort”, Computing Systems, 6(1), pages 5−27 (1993),
* and further improved using the digit-oracle idea described by
* Juha Kärkkäinen and Tommi Rantala in “Engineering radix sort for strings”,
* String Processing and Information Retrieval, 15th International Symposium, volume 5280 of
* Lecture Notes in Computer Science, pages 3−14, Springer (2008).
*
*
This method implement an indirect sort. The elements of perm (which must
* be exactly the numbers in the interval [0..perm.length)) will be permuted so that
* a[ perm[ i ] ] <= a[ perm[ i + 1 ] ].
*
*
This implementation is significantly faster than quicksort (unstable) or mergesort (stable)
* already at small sizes (say, more than 10000 elements), but it can only
* sort in ascending order.
* It will allocate a support array of bytes with the same number of elements as the array to be sorted,
* and, in the stable case, a further support array as large as perm (note that the stable
* version is slightly faster).
*
* @param perm a permutation array indexing a.
* @param a the array to be sorted.
* @param b the second array to be sorted.
* @param stable whether the sorting algorithm should be stable.
*/
public static void radixSortIndirect( final int[] perm, final float[] a, final float[] b, final boolean stable ) {
radixSortIndirect( perm, a, b, 0, perm.length, stable );
}
/** Sorts the specified pair of arrays lexicographically using indirect radix sort.
*
*
The sorting algorithm is a tuned radix sort adapted from Peter M. McIlroy, Keith Bostic and M. Douglas
* McIlroy, “Engineering radix sort”, Computing Systems, 6(1), pages 5−27 (1993),
* and further improved using the digit-oracle idea described by
* Juha Kärkkäinen and Tommi Rantala in “Engineering radix sort for strings”,
* String Processing and Information Retrieval, 15th International Symposium, volume 5280 of
* Lecture Notes in Computer Science, pages 3−14, Springer (2008).
*
*
This method implement an indirect sort. The elements of perm (which must
* be exactly the numbers in the interval [0..perm.length)) will be permuted so that
* a[ perm[ i ] ] <= a[ perm[ i + 1 ] ].
*
*
This implementation is significantly faster than quicksort (unstable) or mergesort (stable)
* already at small sizes (say, more than 10000 elements), but it can only
* sort in ascending order.
* It will allocate a support array of bytes with the same number of elements as the array to be sorted,
* and, in the stable case, a further support array as large as perm (note that the stable
* version is slightly faster).
*
* @param perm a permutation array indexing a.
* @param a the array to be sorted.
* @param b the second array to be sorted.
* @param from the index of the first element of perm (inclusive) to be permuted.
* @param to the index of the last element of perm (exclusive) to be permuted.
* @param stable whether the sorting algorithm should be stable.
*/
public static void radixSortIndirect( final int[] perm, final float[] a, final float[] b, final int from, final int to, final boolean stable ) {
final int layers = 2;
if ( a.length != b.length ) throw new IllegalArgumentException( "Array size mismatch." );
final int maxLevel = DIGITS_PER_ELEMENT * layers - 1;
final int stackSize = ( ( 1 << DIGIT_BITS ) - 1 ) * ( layers * DIGITS_PER_ELEMENT - 1 ) + 1;
final int[] offsetStack = new int[ stackSize ];
int offsetPos = 0;
final int[] lengthStack = new int[ stackSize ];
int lengthPos = 0;
final int[] levelStack = new int[ stackSize ];
int levelPos = 0;
offsetStack[ offsetPos++ ] = from;
lengthStack[ lengthPos++ ] = to - from;
levelStack[ levelPos++ ] = 0;
final int[] count = new int[ 1 << DIGIT_BITS ];
final int[] pos = stable ? null : new int[ 1 << DIGIT_BITS ];
final int[] support = stable ? new int[ perm.length ] : null;
final byte[] digit = new byte[ to - from ];
while( offsetPos > 0 ) {
final int first = offsetStack[ --offsetPos ];
final int length = lengthStack[ --lengthPos ];
final int level = levelStack[ --levelPos ];
final int signMask = level % DIGITS_PER_ELEMENT == 0 ? 1 << DIGIT_BITS - 1 : 0;
if ( length < MEDIUM ) {
insertionSortIndirect( perm, a, b, first, first + length );
continue;
}
final float[] k = level < DIGITS_PER_ELEMENT ? a : b; // This is the key array
final int shift = ( DIGITS_PER_ELEMENT - 1 - level % DIGITS_PER_ELEMENT ) * DIGIT_BITS; // This is the shift that extract the right byte from a key
// Count keys.
for( int i = length; i-- != 0; ) digit[ i ] = (byte)( ( ( fixFloat(k[ perm[ first + i ] ]) >>> shift ) & DIGIT_MASK ) ^ signMask );
for( int i = length; i-- != 0; ) count[ digit[ i ] & 0xFF ]++;
// Compute cumulative distribution and push non-singleton keys on stack.
int lastUsed = -1;
for( int i = 0, p = 0; i < 1 << DIGIT_BITS; i++ ) {
if ( count[ i ] != 0 ) {
lastUsed = i;
if ( level < maxLevel && count[ i ] > 1 ){
offsetStack[ offsetPos++ ] = p + first;
lengthStack[ lengthPos++ ] = count[ i ];
levelStack[ levelPos++ ] = level + 1;
}
}
if ( stable ) count[ i ] = p += count[ i ];
else pos[ i ] = ( p += count[ i ] );
}
if ( stable ) {
for( int i = length; i-- != 0; ) support[ --count[ digit[ i ] & 0xFF ] ] = perm[ first + i ];
System.arraycopy( support, 0, perm, first, length );
it.unimi.dsi.fastutil.ints.IntArrays.fill( count, 0 );
}
else {
// When all slots are OK, the last slot is necessarily OK.
final int end = length - count[ lastUsed ];
count[ lastUsed ] = 0;
// i moves through the start of each block
for( int i = 0, c = -1, d; i < end; i += count[ c ], count[ c ] = 0 ) {
int t = perm[ i + first ];
c = digit[ i ] & 0xFF;
while( ( d = --pos[ c ] ) > i ) {
final int z = t;
final int zz = c;
t = perm[ d + first ];
c = digit[ d ] & 0xFF;
perm[ d + first ] = z;
digit[ d ] = (byte)zz;
}
perm[ i + first ] = t;
}
}
}
}
private static void selectionSort( final float[][] a, final int from, final int to, final int level ) {
final int layers = a.length;
final int firstLayer = level / DIGITS_PER_ELEMENT;
for( int i = from; i < to - 1; i++ ) {
int m = i;
for( int j = i + 1; j < to; j++ ) {
for( int p = firstLayer; p < layers; p++ ) {
if ( a[ p ][ j ] < a[ p ][ m ] ) {
m = j;
break;
}
else if ( a[ p ][ j ] > a[ p ][ m ] ) break;
}
}
if ( m != i ) {
for( int p = layers; p-- != 0; ) {
final float u = a[ p ][ i ];
a[ p ][ i ] = a[ p ][ m ];
a[ p ][ m ] = u;
}
}
}
}
/** Sorts the specified array of arrays lexicographically using radix sort.
*
*
The sorting algorithm is a tuned radix sort adapted from Peter M. McIlroy, Keith Bostic and M. Douglas
* McIlroy, “Engineering radix sort”, Computing Systems, 6(1), pages 5−27 (1993),
* and further improved using the digit-oracle idea described by
* Juha Kärkkäinen and Tommi Rantala in “Engineering radix sort for strings”,
* String Processing and Information Retrieval, 15th International Symposium, volume 5280 of
* Lecture Notes in Computer Science, pages 3−14, Springer (2008).
*
*
This method implements a lexicographical sorting of the provided arrays. Tuples of elements
* in the same position will be considered a single key, and permuted
* accordingly.
*
*
This implementation is significantly faster than quicksort
* already at small sizes (say, more than 10000 elements), but it can only
* sort in ascending order. It will allocate a support array of bytes with the same number of elements as the arrays to be sorted.
*
* @param a an array containing arrays of equal length to be sorted lexicographically in parallel.
*/
public static void radixSort( final float[][] a ) {
radixSort( a, 0, a[ 0 ].length );
}
/** Sorts the specified array of arrays lexicographically using radix sort.
*
*
The sorting algorithm is a tuned radix sort adapted from Peter M. McIlroy, Keith Bostic and M. Douglas
* McIlroy, “Engineering radix sort”, Computing Systems, 6(1), pages 5−27 (1993),
* and further improved using the digit-oracle idea described by
* Juha Kärkkäinen and Tommi Rantala in “Engineering radix sort for strings”,
* String Processing and Information Retrieval, 15th International Symposium, volume 5280 of
* Lecture Notes in Computer Science, pages 3−14, Springer (2008).
*
*
This method implements a lexicographical sorting of the provided arrays. Tuples of elements
* in the same position will be considered a single key, and permuted
* accordingly.
*
*
This implementation is significantly faster than quicksort
* already at small sizes (say, more than 10000 elements), but it can only
* sort in ascending order. It will allocate a support array of bytes with the same number of elements as the arrays to be sorted.
*
* @param a an array containing arrays of equal length to be sorted lexicographically in parallel.
* @param from the index of the first element (inclusive) to be sorted.
* @param to the index of the last element (exclusive) to be sorted.
*/
public static void radixSort( final float[][] a, final int from, final int to ) {
final int layers = a.length;
final int maxLevel = DIGITS_PER_ELEMENT * layers - 1;
for( int p = layers, l = a[ 0 ].length; p-- != 0; ) if ( a[ p ].length != l ) throw new IllegalArgumentException( "The array of index " + p + " has not the same length of the array of index 0." );
final int stackSize = ( ( 1 << DIGIT_BITS ) - 1 ) * ( layers * DIGITS_PER_ELEMENT - 1 ) + 1;
final int[] offsetStack = new int[ stackSize ];
int offsetPos = 0;
final int[] lengthStack = new int[ stackSize ];
int lengthPos = 0;
final int[] levelStack = new int[ stackSize ];
int levelPos = 0;
offsetStack[ offsetPos++ ] = from;
lengthStack[ lengthPos++ ] = to - from;
levelStack[ levelPos++ ] = 0;
final int[] count = new int[ 1 << DIGIT_BITS ];
final int[] pos = new int[ 1 << DIGIT_BITS ];
final byte[] digit = new byte[ to - from ];
final float[] t = new float[ layers ];
while( offsetPos > 0 ) {
final int first = offsetStack[ --offsetPos ];
final int length = lengthStack[ --lengthPos ];
final int level = levelStack[ --levelPos ];
final int signMask = level % DIGITS_PER_ELEMENT == 0 ? 1 << DIGIT_BITS - 1 : 0;
if ( length < MEDIUM ) {
selectionSort( a, first, first + length, level );
continue;
}
final float[] k = a[ level / DIGITS_PER_ELEMENT ]; // This is the key array
final int shift = ( DIGITS_PER_ELEMENT - 1 - level % DIGITS_PER_ELEMENT ) * DIGIT_BITS; // This is the shift that extract the right byte from a key
// Count keys.
for( int i = length; i-- != 0; ) digit[ i ] = (byte)( ( fixFloat(k[ first + i ]) >>> shift & DIGIT_MASK ) ^ signMask );
for( int i = length; i-- != 0; ) count[ digit[ i ] & 0xFF ]++;
// Compute cumulative distribution and push non-singleton keys on stack.
int lastUsed = -1;
for( int i = 0, p = 0; i < 1 << DIGIT_BITS; i++ ) {
if ( count[ i ] != 0 ) {
lastUsed = i;
if ( level < maxLevel && count[ i ] > 1 ){
offsetStack[ offsetPos++ ] = p + first;
lengthStack[ lengthPos++ ] = count[ i ];
levelStack[ levelPos++ ] = level + 1;
}
}
pos[ i ] = ( p += count[ i ] );
}
// When all slots are OK, the last slot is necessarily OK.
final int end = length - count[ lastUsed ];
count[ lastUsed ] = 0;
// i moves through the start of each block
for( int i = 0, c = -1, d; i < end; i += count[ c ], count[ c ] = 0 ) {
for( int p = layers; p-- != 0; ) t[ p ] = a[ p ][ i + first ];
c = digit[ i ] & 0xFF;
while( ( d = --pos[ c ] ) > i ) {
for( int p = layers; p-- != 0; ) {
final float u = t[ p ];
t[ p ] = a[ p ][ d + first ];
a[ p ][ d + first ] = u;
}
final int zz = c;
c = digit[ d ] & 0xFF;
digit[ d ] = (byte)zz;
}
for( int p = layers; p-- != 0; ) a[ p ][ i + first ] = t[ p ];
}
}
}
/** Shuffles the specified array fragment using the specified pseudorandom number generator.
*
* @param a the array to be shuffled.
* @param from the index of the first element (inclusive) to be shuffled.
* @param to the index of the last element (exclusive) to be shuffled.
* @param random a pseudorandom number generator (please use a XorShift* generator).
* @return a.
*/
public static float[] shuffle( final float[] a, final int from, final int to, final Random random ) {
for( int i = to - from; i-- != 0; ) {
final int p = random.nextInt( i + 1 );
final float t = a[ from + i ];
a[ from + i ] = a[ from + p ];
a[ from + p ] = t;
}
return a;
}
/** Shuffles the specified array using the specified pseudorandom number generator.
*
* @param a the array to be shuffled.
* @param random a pseudorandom number generator (please use a XorShift* generator).
* @return a.
*/
public static float[] shuffle( final float[] a, final Random random ) {
for( int i = a.length; i-- != 0; ) {
final int p = random.nextInt( i + 1 );
final float t = a[ i ];
a[ i ] = a[ p ];
a[ p ] = t;
}
return a;
}
/** Reverses the order of the elements in the specified array.
*
* @param a the array to be reversed.
* @return a.
*/
public static float[] reverse( final float[] a ) {
final int length = a.length;
for( int i = length / 2; i-- != 0; ) {
final float t = a[ length - i - 1 ];
a[ length - i - 1 ] = a[ i ];
a[ i ] = t;
}
return a;
}
/** A type-specific content-based hash strategy for arrays. */
private static final class ArrayHashStrategy implements Hash.Strategy, java.io.Serializable {
private static final long serialVersionUID = -7046029254386353129L;
public int hashCode( final float[] o ) {
return java.util.Arrays.hashCode( o );
}
public boolean equals( final float[] a, final float[] b ) {
return java.util.Arrays.equals( a, b );
}
}
/** A type-specific content-based hash strategy for arrays.
*
* This hash strategy may be used in custom hash collections whenever keys are
* arrays, and they must be considered equal by content. This strategy
* will handle null correctly, and it is serializable.
*/
public final static Hash.Strategy HASH_STRATEGY = new ArrayHashStrategy();
}