- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 515 for distance (0.27 sec)
-
android/guava/src/com/google/common/primitives/Booleans.java
/** * Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Booleans.asList(array), * distance)}, but is somewhat faster. * * <p>The provided "distance" may be negative, which will rotate left. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 19.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/DiscreteDomain.java
} /** * Returns, conceptually, "origin + distance", or equivalently, the result of calling {@link * #next} on {@code origin} {@code distance} times. */ C offset(C origin, long distance) { C current = origin; checkNonnegative(distance, "distance"); for (long i = 0; i < distance; i++) { current = next(current); if (current == null) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Shorts.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 25.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
* Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Longs.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left.
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/collect/DiscreteDomain.java
} /** * Returns, conceptually, "origin + distance", or equivalently, the result of calling {@link * #next} on {@code origin} {@code distance} times. */ C offset(C origin, long distance) { C current = origin; checkNonnegative(distance, "distance"); for (long i = 0; i < distance; i++) { current = next(current); if (current == null) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ContiguousSetTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 19.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ContiguousSetTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 19.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/FloatsTest.java
} private static void testRotate(float[] input, int distance, float[] expectedOutput) { input = Arrays.copyOf(input, input.length); Floats.rotate(input, distance); assertThat(input).isEqualTo(expectedOutput); } private static void testRotate( float[] input, int distance, int fromIndex, int toIndex, float[] expectedOutput) { input = Arrays.copyOf(input, input.length);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 29.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/IntsTest.java
} private static void testRotate(int[] input, int distance, int[] expectedOutput) { input = Arrays.copyOf(input, input.length); Ints.rotate(input, distance); assertThat(input).isEqualTo(expectedOutput); } private static void testRotate( int[] input, int distance, int fromIndex, int toIndex, int[] expectedOutput) { input = Arrays.copyOf(input, input.length);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 28.4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.java
/** * Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + 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
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)