- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,133 for Murray (0.23 sec)
-
android/guava/src/com/google/common/primitives/Longs.java
checkArgument(array.length > 0); long min = array[0]; for (int i = 1; i < array.length; i++) { if (array[i] < min) { min = array[i]; } } return min; } /** * Returns the greatest value present in {@code array}. * * @param array a <i>nonempty</i> array of {@code long} values
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 28.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/SignedBytes.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 22 13:09:25 GMT 2021 - 7.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
* @since 23.1 */ public static void sort(long[] array, int fromIndex, int toIndex) { checkNotNull(array); checkPositionIndexes(fromIndex, toIndex, array.length); for (int i = fromIndex; i < toIndex; i++) { array[i] = flip(array[i]); } Arrays.sort(array, fromIndex, toIndex); for (int i = fromIndex; i < toIndex; i++) { array[i] = flip(array[i]); } } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 17.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.java
checkArgument(array.length > 0); char min = array[0]; for (int i = 1; i < array.length; i++) { if (array[i] < min) { min = array[i]; } } return min; } /** * Returns the greatest value present in {@code array}. * * @param array a <i>nonempty</i> array of {@code char} values
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Doubles.java
Arrays.sort(array, fromIndex, toIndex); reverse(array, fromIndex, toIndex); } /** * Reverses the elements of {@code array}. This is equivalent to {@code * Collections.reverse(Doubles.asList(array))}, but is likely to be more efficient. * * @since 23.1 */ public static void reverse(double[] array) { checkNotNull(array); reverse(array, 0, array.length); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 27.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
public static int min(int... array) { checkArgument(array.length > 0); int min = array[0]; for (int i = 1; i < array.length; i++) { if (array[i] < min) { min = array[i]; } } return min; } /** * Returns the greatest value present in {@code array}. * * @param array a <i>nonempty</i> array of {@code int} values
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
src/main/java/org/codelibs/core/collection/ArrayUtil.java
public static <T> List<T> toList(final Object array) { assertArgumentNotNull("array", array); assertArgument("array", array.getClass().isArray(), MessageFormatter.getSimpleMessage("ECL0104", array)); final int length = Array.getLength(array); final List<Object> list = newArrayList(length); for (int i = 0; i < length; i++) { list.add(Array.get(array, i)); }
Java - Registered: Fri May 03 20:58:11 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 42.6K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java
private static final int[] exponents = new int[ARRAY_SIZE]; private static final int[] factorialArguments = new int[ARRAY_SIZE]; private static final int[][] binomialArguments = new int[ARRAY_SIZE][2]; private static final long[] positive = new long[ARRAY_SIZE]; private static final long[] nonnegative = new long[ARRAY_SIZE]; private static final long[] longs = new long[ARRAY_SIZE]; @BeforeExperiment void setUp() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
swap(array, from, to); } return array[k]; } else { int midIndex = (from + to) >>> 1; // Choose the median of the elements at the from, to and mid indexes, // and rearrange so that array[from]<=array[from+1], and // array[to] => array[from + 1]. swap(array, midIndex, from + 1); if (array[from] > array[to]) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
swap(array, from, to); } return array[k]; } else { int midIndex = (from + to) >>> 1; // Choose the median of the elements at the from, to and mid indexes, // and rearrange so that array[from]<=array[from+1], and // array[to] => array[from + 1]. swap(array, midIndex, from + 1); if (array[from] > array[to]) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0)