public static interface SciListUtil.ISciListUtilProvider
Modifier and Type | Method and Description |
---|---|
double |
calculateIsEvenlySpaced(byte[] array,
int startIndex,
int count,
double epsilon)
Checks whether data in array region is evenly spaced and calculated space between data if it true.
|
double |
calculateIsEvenlySpaced(double[] array,
int startIndex,
int count,
double epsilon)
Checks whether data in array region is evenly spaced and calculated space between data if it true.
|
double |
calculateIsEvenlySpaced(float[] array,
int startIndex,
int count,
double epsilon)
Checks whether data in array region is evenly spaced and calculated space between data if it true.
|
double |
calculateIsEvenlySpaced(int[] array,
int startIndex,
int count,
double epsilon)
Checks whether data in array region is evenly spaced and calculated space between data if it true.
|
double |
calculateIsEvenlySpaced(long[] array,
int startIndex,
int count,
double epsilon)
Checks whether data in array region is evenly spaced and calculated space between data if it true.
|
double |
calculateIsEvenlySpaced(short[] array,
int startIndex,
int count,
double epsilon)
Checks whether data in array region is evenly spaced and calculated space between data if it true.
|
int |
findIndex(byte[] array,
int startIndex,
int count,
boolean isSorted,
byte value,
SearchMode searchMode)
Finds the index of the item in the array according to desired
SearchMode . |
int |
findIndex(double[] array,
int startIndex,
int count,
boolean isSorted,
double value,
SearchMode searchMode)
Finds the index of the item in the array according to desired
SearchMode . |
int |
findIndex(float[] array,
int startIndex,
int count,
boolean isSorted,
float value,
SearchMode searchMode)
Finds the index of the item in the array according to desired
SearchMode . |
int |
findIndex(int[] array,
int startIndex,
int count,
boolean isSorted,
int value,
SearchMode searchMode)
Finds the index of the item in the array according to desired
SearchMode . |
int |
findIndex(long[] array,
int startIndex,
int count,
boolean isSorted,
long value,
SearchMode searchMode)
Finds the index of the item in the array according to desired
SearchMode . |
int |
findIndex(short[] array,
int startIndex,
int count,
boolean isSorted,
short value,
SearchMode searchMode)
Finds the index of the item in the array according to desired
SearchMode . |
void |
getValues(byte[] srcArray,
int baseIndex,
double[] destArray,
int[] indices,
int count)
Copies elements of srcArray at specified indices to destArray.
|
void |
getValues(byte[] srcArray,
int baseIndex,
double[] destArray,
int startIndex,
int count)
Copies batch elements of srcArray to destArray.
|
void |
getValues(double[] srcArray,
int baseIndex,
double[] destArray,
int[] indices,
int count)
Copies elements of srcArray at specified indices to destArray.
|
void |
getValues(double[] srcArray,
int baseIndex,
double[] destArray,
int startIndex,
int count)
Copies batch elements of srcArray to destArray.
|
void |
getValues(float[] srcArray,
int baseIndex,
double[] destArray,
int[] indices,
int count)
Copies elements of srcArray at specified indices to destArray.
|
void |
getValues(float[] srcArray,
int baseIndex,
double[] destArray,
int startIndex,
int count)
Copies batch elements of srcArray to destArray.
|
void |
getValues(int[] srcArray,
int baseIndex,
double[] destArray,
int[] indices,
int count)
Copies elements of srcArray at specified indices to destArray.
|
void |
getValues(int[] srcArray,
int baseIndex,
double[] destArray,
int startIndex,
int count)
Copies batch elements of srcArray to destArray.
|
void |
getValues(long[] srcArray,
int baseIndex,
double[] destArray,
int[] indices,
int count)
Copies elements of srcArray at specified indices to destArray.
|
void |
getValues(long[] srcArray,
int baseIndex,
double[] destArray,
int startIndex,
int count)
Copies batch elements of srcArray to destArray.
|
void |
getValues(short[] srcArray,
int baseIndex,
double[] destArray,
int[] indices,
int count)
Copies elements of srcArray at specified indices to destArray.
|
void |
getValues(short[] srcArray,
int baseIndex,
double[] destArray,
int startIndex,
int count)
Copies batch elements of srcArray to destArray.
|
boolean |
isSortedAscending(byte[] array,
int startIndex,
int count)
Checks whether array is sorted ascending in specified range.
|
boolean |
isSortedAscending(double[] array,
int startIndex,
int count)
Checks whether array is sorted ascending in specified range.
|
boolean |
isSortedAscending(float[] array,
int startIndex,
int count)
Checks whether array is sorted ascending in specified range.
|
boolean |
isSortedAscending(int[] array,
int startIndex,
int count)
Checks whether array is sorted ascending in specified range.
|
boolean |
isSortedAscending(long[] array,
int startIndex,
int count)
Checks whether array is sorted ascending in specified range.
|
boolean |
isSortedAscending(short[] array,
int startIndex,
int count)
Checks whether array is sorted ascending in specified range.
|
byte |
maximum(byte[] array,
int startIndex,
int endIndex)
Finds the maximum value of array in specified bounds.
|
double |
maximum(double[] array,
int startIndex,
int endIndex)
Finds the maximum value of array in specified bounds.
|
float |
maximum(float[] array,
int startIndex,
int endIndex)
Finds the maximum value of array in specified bounds.
|
int |
maximum(int[] array,
int startIndex,
int endIndex)
Finds the maximum value of array in specified bounds.
|
long |
maximum(long[] array,
int startIndex,
int endIndex)
Finds the maximum value of array in specified bounds.
|
short |
maximum(short[] array,
int startIndex,
int endIndex)
Finds the maximum value of array in specified bounds.
|
byte |
minimum(byte[] array,
int startIndex,
int endIndex)
Finds the minimum value of array in specified bounds.
|
double |
minimum(double[] array,
int startIndex,
int endIndex)
Finds the minimum value of array in specified bounds.
|
float |
minimum(float[] array,
int startIndex,
int endIndex)
Finds the minimum value of array in specified bounds.
|
int |
minimum(int[] array,
int startIndex,
int endIndex)
Finds the minimum value of array in specified bounds.
|
long |
minimum(long[] array,
int startIndex,
int endIndex)
Finds the minimum value of array in specified bounds.
|
short |
minimum(short[] array,
int startIndex,
int endIndex)
Finds the minimum value of array in specified bounds.
|
void |
minMax(byte[] array,
int startIndex,
int endIndex,
IRange<java.lang.Byte> range)
Finds the minimum and maximum of array in specified bounds.
|
void |
minMax(double[] array,
int startIndex,
int endIndex,
IRange<java.lang.Double> range)
Finds the minimum and maximum of array in specified bounds.
|
void |
minMax(float[] array,
int startIndex,
int endIndex,
IRange<java.lang.Float> range)
Finds the minimum and maximum of array in specified bounds.
|
void |
minMax(int[] array,
int startIndex,
int endIndex,
IRange<java.lang.Integer> range)
Finds the minimum and maximum of array in specified bounds.
|
void |
minMax(long[] array,
int startIndex,
int endIndex,
IRange<java.lang.Long> range)
Finds the minimum and maximum of array in specified bounds.
|
void |
minMax(short[] array,
int startIndex,
int endIndex,
IRange<java.lang.Short> range)
Finds the minimum and maximum of array in specified bounds.
|
void |
minMaxPositive(byte[] array,
int startIndex,
int endIndex,
IRange<java.lang.Byte> range)
Finds the positive minimum and maximum of array in specified bounds.
|
void |
minMaxPositive(double[] array,
int startIndex,
int endIndex,
IRange<java.lang.Double> range)
Finds the positive minimum and maximum of array in specified bounds.
|
void |
minMaxPositive(float[] array,
int startIndex,
int endIndex,
IRange<java.lang.Float> range)
Finds the positive minimum and maximum of array in specified bounds.
|
void |
minMaxPositive(int[] array,
int startIndex,
int endIndex,
IRange<java.lang.Integer> range)
Finds the positive minimum and maximum of array in specified bounds.
|
void |
minMaxPositive(long[] array,
int startIndex,
int endIndex,
IRange<java.lang.Long> range)
Finds the positive minimum and maximum of array in specified bounds.
|
void |
minMaxPositive(short[] array,
int startIndex,
int endIndex,
IRange<java.lang.Short> range)
Finds the positive minimum and maximum of array in specified bounds.
|
double maximum(double[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.double minimum(double[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.void minMax(double[] array, int startIndex, int endIndex, IRange<java.lang.Double> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void minMaxPositive(double[] array, int startIndex, int endIndex, IRange<java.lang.Double> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void getValues(double[] srcArray, int baseIndex, double[] destArray, int[] indices, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.indices
- The collection of indices to get items at.count
- The amount of values to copy.void getValues(double[] srcArray, int baseIndex, double[] destArray, int startIndex, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.startIndex
- The startIndex to start copy from.count
- The amount of values to copy.int findIndex(double[] array, int startIndex, int count, boolean isSorted, double value, SearchMode searchMode)
SearchMode
.array
- The array to search.startIndex
- The startIndex to start search from.count
- The amount of items to search in.isSorted
- If true will use fast binary search.value
- The value to search.searchMode
- The search mode options.boolean isSortedAscending(double[] array, int startIndex, int count)
array
- The array to check.startIndex
- The start index of sequences to check.count
- The amount of point in sequence to check.double calculateIsEvenlySpaced(double[] array, int startIndex, int count, double epsilon)
array
- The array to process.startIndex
- The start index index of sequence to process.count
- The size of data sequence to processs.epsilon
- The epsilon value.float maximum(float[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.float minimum(float[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.void minMax(float[] array, int startIndex, int endIndex, IRange<java.lang.Float> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void minMaxPositive(float[] array, int startIndex, int endIndex, IRange<java.lang.Float> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void getValues(float[] srcArray, int baseIndex, double[] destArray, int[] indices, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.indices
- The collection of indices to get items at.count
- The amount of values to copy.void getValues(float[] srcArray, int baseIndex, double[] destArray, int startIndex, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.startIndex
- The startIndex to start copy from.count
- The amount of values to copy.int findIndex(float[] array, int startIndex, int count, boolean isSorted, float value, SearchMode searchMode)
SearchMode
.array
- The array to search.startIndex
- The startIndex to start search from.count
- The amount of items to search in.isSorted
- If true will use fast binary search.value
- The value to search.searchMode
- The search mode options.boolean isSortedAscending(float[] array, int startIndex, int count)
array
- The array to check.startIndex
- The start index of sequences to check.count
- The amount of point in sequence to check.double calculateIsEvenlySpaced(float[] array, int startIndex, int count, double epsilon)
array
- The array to process.startIndex
- The start index index of sequence to process.count
- The size of data sequence to processs.epsilon
- The epsilon value.long maximum(long[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.long minimum(long[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.void minMax(long[] array, int startIndex, int endIndex, IRange<java.lang.Long> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void minMaxPositive(long[] array, int startIndex, int endIndex, IRange<java.lang.Long> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void getValues(long[] srcArray, int baseIndex, double[] destArray, int[] indices, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.indices
- The collection of indices to get items at.count
- The amount of values to copy.void getValues(long[] srcArray, int baseIndex, double[] destArray, int startIndex, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.startIndex
- The startIndex to start copy from.count
- The amount of values to copy.int findIndex(long[] array, int startIndex, int count, boolean isSorted, long value, SearchMode searchMode)
SearchMode
.array
- The array to search.startIndex
- The startIndex to start search from.count
- The amount of items to search in.isSorted
- If true will use fast binary search.value
- The value to search.searchMode
- The search mode options.boolean isSortedAscending(long[] array, int startIndex, int count)
array
- The array to check.startIndex
- The start index of sequences to check.count
- The amount of point in sequence to check.double calculateIsEvenlySpaced(long[] array, int startIndex, int count, double epsilon)
array
- The array to process.startIndex
- The start index index of sequence to process.count
- The size of data sequence to processs.epsilon
- The epsilon value.int maximum(int[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.int minimum(int[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.void minMax(int[] array, int startIndex, int endIndex, IRange<java.lang.Integer> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void minMaxPositive(int[] array, int startIndex, int endIndex, IRange<java.lang.Integer> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void getValues(int[] srcArray, int baseIndex, double[] destArray, int[] indices, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.indices
- The collection of indices to get items at.count
- The amount of values to copy.void getValues(int[] srcArray, int baseIndex, double[] destArray, int startIndex, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.startIndex
- The startIndex to start copy from.count
- The amount of values to copy.int findIndex(int[] array, int startIndex, int count, boolean isSorted, int value, SearchMode searchMode)
SearchMode
.array
- The array to search.startIndex
- The startIndex to start search from.count
- The amount of items to search in.isSorted
- If true will use fast binary search.value
- The value to search.searchMode
- The search mode options.boolean isSortedAscending(int[] array, int startIndex, int count)
array
- The array to check.startIndex
- The start index of sequences to check.count
- The amount of point in sequence to check.double calculateIsEvenlySpaced(int[] array, int startIndex, int count, double epsilon)
array
- The array to process.startIndex
- The start index index of sequence to process.count
- The size of data sequence to processs.epsilon
- The epsilon value.short maximum(short[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.short minimum(short[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.void minMax(short[] array, int startIndex, int endIndex, IRange<java.lang.Short> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void minMaxPositive(short[] array, int startIndex, int endIndex, IRange<java.lang.Short> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void getValues(short[] srcArray, int baseIndex, double[] destArray, int[] indices, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.indices
- The collection of indices to get items at.count
- The amount of values to copy.void getValues(short[] srcArray, int baseIndex, double[] destArray, int startIndex, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.startIndex
- The startIndex to start copy from.count
- The amount of values to copy.int findIndex(short[] array, int startIndex, int count, boolean isSorted, short value, SearchMode searchMode)
SearchMode
.array
- The array to search.startIndex
- The startIndex to start search from.count
- The amount of items to search in.isSorted
- If true will use fast binary search.value
- The value to search.searchMode
- The search mode options.boolean isSortedAscending(short[] array, int startIndex, int count)
array
- The array to check.startIndex
- The start index of sequences to check.count
- The amount of point in sequence to check.double calculateIsEvenlySpaced(short[] array, int startIndex, int count, double epsilon)
array
- The array to process.startIndex
- The start index index of sequence to process.count
- The size of data sequence to processs.epsilon
- The epsilon value.byte maximum(byte[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.byte minimum(byte[] array, int startIndex, int endIndex)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.void minMax(byte[] array, int startIndex, int endIndex, IRange<java.lang.Byte> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void minMaxPositive(byte[] array, int startIndex, int endIndex, IRange<java.lang.Byte> range)
array
- The array to search.startIndex
- The startIndex to start search from.endIndex
- The startIndex to end search at.range
- The range which holds the result of search.void getValues(byte[] srcArray, int baseIndex, double[] destArray, int[] indices, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.indices
- The collection of indices to get items at.count
- The amount of values to copy.void getValues(byte[] srcArray, int baseIndex, double[] destArray, int startIndex, int count)
srcArray
- The source array to copy from.baseIndex
- The baseIndex which is used in FifoBufferFactory
. Otherwise it's FifoBufferFactory.NORMALIZED_BASE_INDEX
.destArray
- The destination array to copy to.startIndex
- The startIndex to start copy from.count
- The amount of values to copy.int findIndex(byte[] array, int startIndex, int count, boolean isSorted, byte value, SearchMode searchMode)
SearchMode
.array
- The array to search.startIndex
- The startIndex to start search from.count
- The amount of items to search in.isSorted
- If true will use fast binary search.value
- The value to search.searchMode
- The search mode options.boolean isSortedAscending(byte[] array, int startIndex, int count)
array
- The array to check.startIndex
- The start index of sequences to check.count
- The amount of point in sequence to check.double calculateIsEvenlySpaced(byte[] array, int startIndex, int count, double epsilon)
array
- The array to process.startIndex
- The start index index of sequence to process.count
- The size of data sequence to processs.epsilon
- The epsilon value.