public class IntBigArrays extends Object
In particular, the ensureCapacity(), grow(),
trim() and setLength() methods allow to handle
big arrays much like array lists.
Note that BinIO and TextIO
contain several methods make it possible to load and save big arrays of primitive types as sequences
of elements in DataInput format (i.e., not as objects) or as sequences of lines of text.
BigArrays| Modifier and Type | Field and Description |
|---|---|
static int[][] |
EMPTY_BIG_ARRAY
A static, final, empty big array.
|
static Hash.Strategy |
HASH_STRATEGY
A type-specific content-based hash strategy for big arrays.
|
static long |
ONEOVERPHI
The inverse of the golden ratio times 216.
|
| Modifier and Type | Method and Description |
|---|---|
static void |
add(int[][] array,
long index,
int incr)
Adds the specified increment the element of the given big array of specified index.
|
static long |
binarySearch(int[][] a,
int key)
Searches a big array for the specified value using
the binary search algorithm.
|
static long |
binarySearch(int[][] a,
int key,
IntComparator c)
Searches a big array for the specified value using
the binary search algorithm and a specified comparator.
|
static long |
binarySearch(int[][] a,
long from,
long to,
int key)
Searches a range of the specified big array for the specified value using
the binary search algorithm.
|
static long |
binarySearch(int[][] a,
long from,
long to,
int key,
IntComparator c)
Searches a range of the specified big array for the specified value using
the binary search algorithm and a specified comparator.
|
static int[][] |
copy(int[][] array)
Returns a copy of a big array.
|
static void |
copy(int[][] srcArray,
long srcPos,
int[][] destArray,
long destPos,
long length)
Copies a big array from the specified source big array, beginning at the specified position, to the specified position of the destination big array.
|
static int[][] |
copy(int[][] array,
long offset,
long length)
Returns a copy of a portion of a big array.
|
static void |
copyFromBig(int[][] srcArray,
long srcPos,
int[] destArray,
int destPos,
int length)
Copies a big array from the specified source big array, beginning at the specified position, to the specified position of the destination array.
|
static void |
copyToBig(int[] srcArray,
int srcPos,
int[][] destArray,
long destPos,
long length)
Copies an array from the specified source array, beginning at the specified position, to the specified position of the destination big array.
|
static void |
decr(int[][] array,
long index)
Decrements the element of the given big array of specified index.
|
static int[][] |
ensureCapacity(int[][] array,
long length)
Ensures that a big array can contain the given number of entries.
|
static int[][] |
ensureCapacity(int[][] array,
long length,
long preserve)
Ensures that a big array can contain the given number of entries, preserving just a part of the big array.
|
static void |
ensureFromTo(int[][] a,
long from,
long to)
Ensures that a range given by its first (inclusive) and last (exclusive) elements fits a big array.
|
static void |
ensureOffsetLength(int[][] a,
long offset,
long length)
Ensures that a range given by an offset and a length fits a big array.
|
static boolean |
equals(int[][] a1,
int[][] a2)
Returns true if the two big arrays are elementwise equal.
|
static void |
fill(int[][] array,
int value)
Fills the given big array with the given value.
|
static void |
fill(int[][] array,
long from,
long to,
int value)
Fills a portion of the given big array with the given value.
|
static int |
get(int[][] array,
long index)
Returns the element of the given big array of specified index.
|
static int[][] |
grow(int[][] array,
long length)
Grows the given big array to the maximum between the given length and
the current length divided by the golden ratio, provided that the given
length is larger than the current length.
|
static int[][] |
grow(int[][] array,
long length,
long preserve)
Grows the given big array to the maximum between the given length and
the current length divided by the golden ratio, provided that the given
length is larger than the current length, preserving just a part of the big array.
|
static void |
incr(int[][] array,
long index)
Increments the element of the given big array of specified index.
|
static long |
length(int[][] array)
Returns the length of the given big array.
|
static void |
mul(int[][] array,
long index,
int factor)
Multiplies by the specified factor the element of the given big array of specified index.
|
static int[][] |
newBigArray(long length)
Creates a new big array.
|
static void |
quickSort(int[][] x)
Sorts the specified big array according to the natural ascending order using quicksort.
|
static void |
quickSort(int[][] x,
IntComparator comp)
Sorts the specified big array according to the order induced by the specified
comparator using quicksort.
|
static void |
quickSort(int[][] x,
long from,
long to)
Sorts the specified range of elements according to the natural ascending order using quicksort.
|
static void |
quickSort(int[][] x,
long from,
long to,
IntComparator comp)
Sorts the specified range of elements according to the order induced by the specified
comparator using quicksort.
|
static void |
set(int[][] array,
long index,
int value)
Sets the element of the given big array of specified index.
|
static int[][] |
setLength(int[][] array,
long length)
Sets the length of the given big array.
|
static int[][] |
shuffle(int[][] a,
long from,
long to,
Random random)
Shuffles the specified big array fragment using the specified pseudorandom number generator.
|
static int[][] |
shuffle(int[][] a,
Random random)
Shuffles the specified big array using the specified pseudorandom number generator.
|
static void |
swap(int[][] array,
long first,
long second)
Swaps the element of the given big array of specified indices.
|
static String |
toString(int[][] a) |
static int[][] |
trim(int[][] array,
long length)
Trims the given big array to the given length.
|
static int[][] |
wrap(int[] array)
Turns a standard array into a big array.
|
public static final long ONEOVERPHI
public static final int[][] EMPTY_BIG_ARRAY
public static final Hash.Strategy HASH_STRATEGY
This hash strategy may be used in custom hash collections whenever keys are
big arrays, and they must be considered equal by content. This strategy
will handle null correctly, and it is serializable.
public static int get(int[][] array,
long index)
array - a big array.index - a position in the big array.public static void set(int[][] array,
long index,
int value)
array - a big array.index - a position in the big array.public static void swap(int[][] array,
long first,
long second)
array - a big array.first - a position in the big array.second - a position in the big array.public static void add(int[][] array,
long index,
int incr)
array - a big array.index - a position in the big array.incr - the incrementpublic static void mul(int[][] array,
long index,
int factor)
array - a big array.index - a position in the big array.factor - the factorpublic static void incr(int[][] array,
long index)
array - a big array.index - a position in the big array.public static void decr(int[][] array,
long index)
array - a big array.index - a position in the big array.public static long length(int[][] array)
array - a big array.public static void copy(int[][] srcArray,
long srcPos,
int[][] destArray,
long destPos,
long length)
srcArray - the source big array.srcPos - the starting position in the source big array.destArray - the destination big array.destPos - the starting position in the destination data.length - the number of elements to be copied.public static void copyFromBig(int[][] srcArray,
long srcPos,
int[] destArray,
int destPos,
int length)
srcArray - the source big array.srcPos - the starting position in the source big array.destArray - the destination array.destPos - the starting position in the destination data.length - the number of elements to be copied.public static void copyToBig(int[] srcArray,
int srcPos,
int[][] destArray,
long destPos,
long length)
srcArray - the source array.srcPos - the starting position in the source array.destArray - the destination big array.destPos - the starting position in the destination data.length - the number of elements to be copied.public static int[][] newBigArray(long length)
length - the length of the new big array.public static int[][] wrap(int[] array)
Note that the returned big array might contain as a segment the original array.
array - an array.array.public static int[][] ensureCapacity(int[][] array,
long length)
If you cannot foresee whether this big array will need again to be
enlarged, you should probably use grow() instead.
Warning: the returned array might use part of the segments of the original array, which must be considered read-only after calling this method.
array - a big array.length - the new minimum length for this big array.array, if it contains length entries or more; otherwise,
a big array with length entries whose first length(array)
entries are the same as those of array.public static int[][] ensureCapacity(int[][] array,
long length,
long preserve)
Warning: the returned array might use part of the segments of the original array, which must be considered read-only after calling this method.
array - a big array.length - the new minimum length for this big array.preserve - the number of elements of the big array that must be preserved in case a new allocation is necessary.array, if it can contain length entries or more; otherwise,
a big array with length entries whose first preserve
entries are the same as those of array.public static int[][] grow(int[][] array,
long length)
Dividing by the golden ratio (φ) approximately increases the big array
length by 1.618. If you want complete control on the big array growth, you
should probably use ensureCapacity() instead.
Warning: the returned array might use part of the segments of the original array, which must be considered read-only after calling this method.
array - a big array.length - the new minimum length for this big array.array, if it can contain length
entries; otherwise, a big array with
max(length,length(array)/φ) entries whose first
length(array) entries are the same as those of array.public static int[][] grow(int[][] array,
long length,
long preserve)
Dividing by the golden ratio (φ) approximately increases the big array
length by 1.618. If you want complete control on the big array growth, you
should probably use ensureCapacity() instead.
Warning: the returned array might use part of the segments of the original array, which must be considered read-only after calling this method.
array - a big array.length - the new minimum length for this big array.preserve - the number of elements of the big array that must be preserved in case a new allocation is necessary.array, if it can contain length
entries; otherwise, a big array with
max(length,length(array)/φ) entries whose first
preserve entries are the same as those of array.public static int[][] trim(int[][] array,
long length)
Warning: the returned array might use part of the segments of the original array, which must be considered read-only after calling this method.
array - a big array.length - the new maximum length for the big array.array, if it contains length
entries or less; otherwise, a big array with
length entries whose entries are the same as
the first length entries of array.public static int[][] setLength(int[][] array,
long length)
Warning: the returned array might use part of the segments of the original array, which must be considered read-only after calling this method.
array - a big array.length - the new length for the big array.array, if it contains exactly length
entries; otherwise, if it contains more than
length entries, a big array with length entries
whose entries are the same as the first length entries of
array; otherwise, a big array with length entries
whose first length(array) entries are the same as those of
array.public static int[][] copy(int[][] array,
long offset,
long length)
array - a big array.offset - the first element to copy.length - the number of elements to copy.length elements of array starting at offset.public static int[][] copy(int[][] array)
array - a big array.array.public static void fill(int[][] array,
int value)
This method uses a backward loop. It is significantly faster than the corresponding
method in Arrays.
array - a big array.value - the new value for all elements of the big array.public static void fill(int[][] array,
long from,
long to,
int 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 Arrays.
array - a big array.from - the starting index of the portion to fill.to - the end index of the portion to fill.value - the new value for all elements of the specified portion of the big array.public static boolean equals(int[][] a1,
int[][] a2)
This method uses a backward loop. It is significantly faster than the corresponding
method in Arrays.
a1 - a big array.a2 - another big array.public static String toString(int[][] a)
public static void ensureFromTo(int[][] a,
long from,
long to)
This method may be used whenever a big array range check is needed.
a - a big array.from - a start index (inclusive).to - an end index (inclusive).IllegalArgumentException - if from is greater than to.ArrayIndexOutOfBoundsException - if from or to are greater than the big array length or negative.public static void ensureOffsetLength(int[][] a,
long offset,
long length)
This method may be used whenever a big array range check is needed.
a - a big array.offset - a start index.length - a length (the number of elements in the range).IllegalArgumentException - if length is negative.ArrayIndexOutOfBoundsException - if offset is negative or offset+length is greater than the big array length.public static void quickSort(int[][] x,
long from,
long to,
IntComparator comp)
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.
x - the big array to be sorted.from - the index of the first element (inclusive) to be sorted.to - the index of the last element (exclusive) to be sorted.comp - the comparator to determine the sorting order.public static void quickSort(int[][] x,
IntComparator comp)
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.
x - the big array to be sorted.comp - the comparator to determine the sorting order.public static void quickSort(int[][] x,
long from,
long to)
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.
x - the big array to be sorted.from - the index of the first element (inclusive) to be sorted.to - the index of the last element (exclusive) to be sorted.public static void quickSort(int[][] x)
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.
x - the big array to be sorted.public static long binarySearch(int[][] a,
long from,
long to,
int key)
a - the big array to be searched.from - the index of the first element (inclusive) to be searched.to - the index of the last element (exclusive) to be searched.key - the value to be searched for.Arrayspublic static long binarySearch(int[][] a,
int key)
a - the big array to be searched.key - the value to be searched for.Arrayspublic static long binarySearch(int[][] a,
long from,
long to,
int key,
IntComparator c)
a - the big array to be searched.from - the index of the first element (inclusive) to be searched.to - the index of the last element (exclusive) to be searched.key - the value to be searched for.c - a comparator.Arrayspublic static long binarySearch(int[][] a,
int key,
IntComparator c)
a - the big array to be searched.key - the value to be searched for.c - a comparator.Arrayspublic static int[][] shuffle(int[][] a,
long from,
long to,
Random random)
a - the big array to be shuffled.from - the index of the first element (inclusive) to be shuffled.to - the index of the last element (exclusive) to be shuffled.random - a pseudorandom number generator (please use a XorShift* generator).a.Copyright © 2013. All Rights Reserved.