Package org.apache.uima.internal.util
Class IntArrayUtils
- java.lang.Object
-
- org.apache.uima.internal.util.IntArrayUtils
-
public final class IntArrayUtils extends java.lang.Object
Utilities used by some of the IntX classes.
-
-
Field Summary
Fields Modifier and Type Field Description private static int
default_growth_factor
private static int
default_multiplication_limit
-
Constructor Summary
Constructors Constructor Description IntArrayUtils()
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static int
binarySearch(int[] array, int ele, int start, int end)
Binary search on a span of a sorted integer array.static boolean[]
ensure_size(boolean[] array, int req, int growth_factor, int multiplication_limit)
static char[]
ensure_size(char[] array, int req, int growth_factor, int multiplication_limit)
static int[]
ensure_size(int[] array, int req)
static int[]
ensure_size(int[] array, int req, int growth_factor, int multiplication_limit)
private static int[]
expand_size(int[] array, int req, int growth_factor, int multiplication_limit)
static int
find(int x, int[] a)
Find an int in an (unsorted) array.
-
-
-
Field Detail
-
default_growth_factor
private static final int default_growth_factor
- See Also:
- Constant Field Values
-
default_multiplication_limit
private static final int default_multiplication_limit
- See Also:
- Constant Field Values
-
-
Method Detail
-
ensure_size
public static int[] ensure_size(int[] array, int req)
-
ensure_size
public static int[] ensure_size(int[] array, int req, int growth_factor, int multiplication_limit)
-
expand_size
private static int[] expand_size(int[] array, int req, int growth_factor, int multiplication_limit)
-
ensure_size
public static boolean[] ensure_size(boolean[] array, int req, int growth_factor, int multiplication_limit)
-
ensure_size
public static char[] ensure_size(char[] array, int req, int growth_factor, int multiplication_limit)
-
binarySearch
public static int binarySearch(int[] array, int ele, int start, int end)
Binary search on a span of a sorted integer array. If array is not sorted, results are unpredictable. If you want to search the whole array, use the version injava.util.Arrays
instead; it's probably faster.- Parameters:
array
- The input array.ele
- The int we're looking for.start
- Start looking at this position, where0 ≤= start ≤= end ≤= array.length
.end
- Look up to this point (non-inclusive).- Returns:
- The position of
ele
, if found;-insertPos-1
, if not.insertPos
is the position whereele
would be inserted. Note that the return value is>= start
iffele
was found; seejava.util.Arrays
.
-
find
public static int find(int x, int[] a)
Find an int in an (unsorted) array.- Parameters:
x
- The int to find.a
- The array.- Returns:
- The position (first occurence) where
x
was found;-1
if not found.
-
-