- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 38 for borate (0.19 sec)
-
android/guava-tests/test/com/google/common/primitives/LongsTest.java
input = Arrays.copyOf(input, input.length); Longs.rotate(input, distance); assertThat(input).isEqualTo(expectedOutput); } private static void testRotate( long[] input, int distance, int fromIndex, int toIndex, long[] expectedOutput) { input = Arrays.copyOf(input, input.length); Longs.rotate(input, distance, fromIndex, toIndex); assertThat(input).isEqualTo(expectedOutput);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 30K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.java
* + i) mod array.length}. This is equivalent to {@code Collections.rotate(Bytes.asList(array), * distance)}, but is somewhat faster. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(byte[] array, int distance) { rotate(array, distance, 0, array.length); } /**
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/src/com/google/common/primitives/Floats.java
* + i) mod array.length}. This is equivalent to {@code Collections.rotate(Floats.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(float[] array, int distance) { rotate(array, distance, 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) -
guava-tests/test/com/google/common/primitives/BytesTest.java
input = Arrays.copyOf(input, input.length); Bytes.rotate(input, distance); assertThat(input).isEqualTo(expectedOutput); } private static void testRotate( byte[] input, int distance, int fromIndex, int toIndex, byte[] expectedOutput) { input = Arrays.copyOf(input, input.length); Bytes.rotate(input, distance, fromIndex, toIndex); assertThat(input).isEqualTo(expectedOutput);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 16.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/IteratorTester.java
* variety of sequences of the {@link Iterator#next}, {@link Iterator#hasNext} and {@link * Iterator#remove} operations. This utility takes the brute-force approach of trying <i>all</i> * possible sequences of these operations, up to a given number of steps. So, if the caller * specifies to use <i>n</i> steps, a total of <i>3^n</i> tests are actually performed. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 4.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ImmutableLongArrayTest.java
ImmutableLongArray.builder(-1); fail(); } catch (IllegalArgumentException expected) { } } /** * If there's a bug in builder growth, we wouldn't know how to expose it. So, brute force the hell * out of it for a while and see what happens. */ public void testBuilder_bruteForce() { for (int i = 0; i < reduceIterationsIfGwt(100); i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 19K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java
ImmutableDoubleArray.builder(-1); fail(); } catch (IllegalArgumentException expected) { } } /** * If there's a bug in builder growth, we wouldn't know how to expose it. So, brute force the hell * out of it for a while and see what happens. */ public void testBuilder_bruteForce() { for (int i = 0; i < reduceIterationsIfGwt(100); i++) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.java
* + i) mod array.length}. This is equivalent to {@code Collections.rotate(Chars.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(char[] array, int distance) { rotate(array, distance, 0, array.length); } /**
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
* + i) mod array.length}. This is equivalent to {@code Collections.rotate(Bytes.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(double[] array, int distance) { rotate(array, distance, 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
* + i) mod array.length}. This is equivalent to {@code Collections.rotate(Ints.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(int[] array, int distance) { rotate(array, distance, 0, array.length); } /**
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)