- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 1,087 for Lapray (0.17 sec)
-
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* array is that of the specified array. The returned array elements are in no particular order. * If the queue fits in the specified array, it is returned therein. Otherwise, a new array is * allocated with the runtime type of the specified array and the size of this queue. * * <p>If this queue fits in the specified array with room to spare (i.e., the array has more
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectArrays.java
T[] result = newArray(array, array.length + 1); result[0] = element; System.arraycopy(array, 0, result, 1, array.length); return result; } /** * Returns a new array that appends {@code element} to {@code array}. * * @param array the array of elements to prepend * @param element the element to append to the end
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 12 15:59:22 GMT 2023 - 9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.java
* i, i + target.length)} contains exactly the same elements as {@code target}. * * @param array the array to search for the sequence {@code target} * @param target the array to search for as a sub-sequence of {@code array} */ public static int indexOf(byte[] array, byte[] target) { checkNotNull(array, "array"); checkNotNull(target, "target");
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 14.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java
RoundingMode mode; private static final long[] positive = new long[ARRAY_SIZE]; private static final long[] nonzero = new long[ARRAY_SIZE]; private static final long[] longs = new long[ARRAY_SIZE]; @BeforeExperiment void setUp() { for (int i = 0; i < ARRAY_SIZE; i++) { positive[i] = randomPositiveBigInteger(Long.SIZE - 2).longValue();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0) -
src/test/java/org/codelibs/core/collection/ArrayUtilTest.java
assertThat(ArrayUtil.addAll(emptyArray, array), is(sameInstance(array))); assertThat(ArrayUtil.addAll(array, emptyArray), is(sameInstance(array))); } /** * @throws Exception */ @Test public void testAdd_int() throws Exception { final int[] array = new int[] { 1 }; final int[] newArray = ArrayUtil.add(array, 2); assertThat(newArray.length, is(2));
Java - Registered: Fri May 03 20:58:11 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
Arrays.sort(array, fromIndex, toIndex); reverse(array, fromIndex, toIndex); } /** * Reverses the elements of {@code array}. This is equivalent to {@code * Collections.reverse(Floats.asList(array))}, but is likely to be more efficient. * * @since 23.1 */ public static void reverse(float[] 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 - 25.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/LittleEndianByteArray.java
UNSAFE_LITTLE_ENDIAN { @Override public long getLongLittleEndian(byte[] array, int offset) { return theUnsafe.getLong(array, (long) offset + BYTE_ARRAY_BASE_OFFSET); } @Override public void putLongLittleEndian(byte[] array, int offset, long value) { theUnsafe.putLong(array, (long) offset + BYTE_ARRAY_BASE_OFFSET, value); } }, UNSAFE_BIG_ENDIAN { @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedInts.java
* in the array according to {@link #compare} * @throws IllegalArgumentException if {@code array} is empty */ public static int max(int... array) { checkArgument(array.length > 0); int max = flip(array[0]); for (int i = 1; i < array.length; i++) { int next = flip(array[i]); if (next > max) { max = next; } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 13.4K bytes - Viewed (0) -
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)