- quickSort
Sorts the specified range of elements of two arrays according to the natural
lexicographical ascendi
- grow
Grows the given array to the maximum between the given length and the current
length increased by 50
- shuffle
Shuffles the specified array using the specified pseudorandom number generator.
- parallelQuickSort
Sorts the specified range of elements of two arrays according to the natural
lexicographical ascendi
- radixSortIndirect
Sorts the specified pair of arrays lexicographically using indirect radix sort.
The sorting algorit
- trim
Trims the given array to the given length.
- ensureCapacity
Ensures that an array can contain the given number of entries, preserving just a
part of the array.
- fill
Fills a portion of the given array with the given value.
- parallelRadixSortIndirect
Sorts the specified array using parallel indirect radix sort. The sorting
algorithm is a tuned radix
- binarySearch
Searches an array for the specified value using the binary search algorithm and
a specified comparat
- ensureFromTo
Ensures that a range given by its first (inclusive) and last (exclusive)
elements fits an array. Thi
- ensureOffsetLength
Ensures that a range given by an offset and a length fits an array. This method
may be used whenever