- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 62 for rotation (0.24 sec)
-
android/guava/src/com/google/common/primitives/Booleans.java
for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) { boolean tmp = array[i]; array[i] = array[j]; array[j] = tmp; } } /** * 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
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) -
android/guava/src/com/google/common/primitives/Shorts.java
for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) { short tmp = array[i]; array[i] = array[j]; array[j] = tmp; } } /** * 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
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
for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) { long tmp = array[i]; array[i] = array[j]; array[j] = tmp; } } /** * 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
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/Bytes.java
for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) { byte tmp = array[i]; array[i] = array[j]; array[j] = tmp; } } /** * 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
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/Chars.java
for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) { char tmp = array[i]; array[i] = array[j]; array[j] = tmp; } } /** * 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
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
for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) { double tmp = array[i]; array[i] = array[j]; array[j] = tmp; } } /** * 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
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
// There are several well-known algorithms for rotating part of an array (or, equivalently, // exchanging two blocks of memory). This classic text by Gries and Mills mentions several: // https://ecommons.cornell.edu/bitstream/handle/1813/6292/81-452.pdf. // (1) "Reversal", the one we have here. // (2) "Dolphin". If we're rotating an array a of size n by a distance of d, then element a[0]
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) -
android/guava/src/com/google/common/primitives/Floats.java
for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) { float tmp = array[i]; array[i] = array[j]; array[j] = tmp; } } /** * 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
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/collect/Range.java
* ({@code [ ]}) indicates that the range is closed on that side; a parenthesis ({@code ( )}) means * it is either open or unbounded. The construct {@code {x | statement}} is read "the set of all * <i>x</i> such that <i>statement</i>.") * * <blockquote> * * <table> * <caption>Range Types</caption> * <tr><th>Notation <th>Definition <th>Factory method
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 27.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableNetwork.java
*/ package com.google.common.graph; import com.google.common.annotations.Beta; import com.google.errorprone.annotations.CanIgnoreReturnValue; /** * A subinterface of {@link Network} which adds mutation methods. When mutation is not required, * users should prefer the {@link Network} interface. * * @author James Sexton * @author Joshua O'Madadhain * @param <N> Node parameter type * @param <E> Edge parameter type
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0)