- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 1,132 for Murray (0.19 sec)
-
android/guava/src/com/google/common/util/concurrent/AtomicDoubleArray.java
* * @param length the length of the array */ public AtomicDoubleArray(int length) { this.longs = new AtomicLongArray(length); } /** * Creates a new {@code AtomicDoubleArray} with the same length as, and all elements copied from, * the given array. * * @param array the array to copy elements from * @throws NullPointerException if array is null */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
* @since 23.1 */ public static void sort(byte[] 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 22 17:40:56 GMT 2024 - 18.3K bytes - Viewed (0) -
manifests/charts/base/crds/crd-all.gen.yaml
type: array ports: description: Optional. items: type: string type: array type: object type: object type: array when:
Others - Registered: Wed Apr 24 22:53:08 GMT 2024 - Last Modified: Mon Apr 22 20:20:47 GMT 2024 - 606.1K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/StringsRepeatBenchmark.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Sep 17 20:24:24 GMT 2021 - 3.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java
private final int[] factorials = new int[ARRAY_SIZE]; private final int[][] binomials = new int[ARRAY_SIZE][2]; private final int[][] nonnegInt = new int[ARRAY_SIZE][2]; private final long[][] nonnegLong = new long[ARRAY_SIZE][2]; private final int[][] intsToAdd = new int[ARRAY_SIZE][2]; private final int[][] intsToMul = new int[ARRAY_SIZE][2]; private final long[][] longsToAdd = new long[ARRAY_SIZE][2];
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Atomics.java
* @return a new {@code AtomicReferenceArray} copied from the given array */ public static <E extends @Nullable Object> AtomicReferenceArray<E> newReferenceArray(E[] array) { return new AtomicReferenceArray<>(array); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sun Jun 20 10:45:35 GMT 2021 - 2.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/BooleansTest.java
assertThat(Booleans.concat(ARRAY_FALSE)).isEqualTo(ARRAY_FALSE); assertThat(Booleans.concat(ARRAY_FALSE)).isNotSameInstanceAs(ARRAY_FALSE); assertThat(Booleans.concat(EMPTY, ARRAY_FALSE, EMPTY)).isEqualTo(ARRAY_FALSE); assertThat(Booleans.concat(ARRAY_FALSE, ARRAY_FALSE, ARRAY_FALSE)) .isEqualTo(new boolean[] {false, false, false}); assertThat(Booleans.concat(ARRAY_FALSE, ARRAY_FALSE_TRUE))
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 15:43:29 GMT 2024 - 23.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/BooleansTest.java
assertThat(Booleans.concat(ARRAY_FALSE)).isEqualTo(ARRAY_FALSE); assertThat(Booleans.concat(ARRAY_FALSE)).isNotSameInstanceAs(ARRAY_FALSE); assertThat(Booleans.concat(EMPTY, ARRAY_FALSE, EMPTY)).isEqualTo(ARRAY_FALSE); assertThat(Booleans.concat(ARRAY_FALSE, ARRAY_FALSE, ARRAY_FALSE)) .isEqualTo(new boolean[] {false, false, false}); assertThat(Booleans.concat(ARRAY_FALSE, ARRAY_FALSE_TRUE))
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 15:43:29 GMT 2024 - 23.9K 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)