- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 33 for Kasper (0.18 sec)
-
android/guava/src/com/google/common/math/IntMath.java
* * @author Louis Wasserman * @since 11.0 */ @GwtCompatible(emulated = true) @ElementTypesAreNonnullByDefault public final class IntMath { // NOTE: Whenever both tests are cheap and functional, it's faster to use &, | instead of &&, || @VisibleForTesting static final int MAX_SIGNED_POWER_OF_TWO = 1 << (Integer.SIZE - 2); /** * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.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(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) {
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
* 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(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) {
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/primitives/UnsignedBytes.java
return LexicographicalComparatorHolder.PureJavaComparator.INSTANCE; } /** * Provides a lexicographical comparator implementation; either a Java implementation or a faster * implementation based on {@link Unsafe}. * * <p>Uses reflection to gracefully fall back to the Java implementation if {@code Unsafe} isn't * available. */ @VisibleForTesting
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) -
android/guava/src/com/google/common/collect/Collections2.java
* element in the underlying collection and determine which elements satisfy the filter. When a * live view is <i>not</i> needed, it may be faster to copy {@code Iterables.filter(unfiltered, * predicate)} and use the copy. * * <p><b>Warning:</b> {@code predicate} must be <i>consistent with equals</i>, as documented at
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/ClassSanityTester.java
} } } for (Invokable<?, ?> factory : factories) { factory.setAccessible(true); } // Sorts methods/constructors with the least number of parameters first since it's likely easier // to fill dummy parameter values for them. Ties are broken by name then by the string form of // the parameter list. return BY_NUMBER_OF_PARAMETERS .compound(BY_METHOD_NAME)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 08 17:31:55 GMT 2024 - 33K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
* invokeAny} which are pending serial execution, even the subset of the tasks that have not yet * started execution. It is unclear from the {@code ExecutorService} specification if these should * be included, and it's much easier to implement the interpretation that they not be. Finally, a * call to {@code shutdown} or {@code shutdownNow} may result in concurrent calls to {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 41.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Doubles.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(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) {
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/Chars.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(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) {
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/collect/TreeBasedTable.java
* iterators that don't support {@code remove()}. Otherwise, all optional operations are supported. * Null row keys, columns keys, and values are not supported. * * <p>Lookups by row key are often faster than lookups by column key, because the data is stored in * a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still runs
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 11.4K bytes - Viewed (0)