- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 62 for Kasper (2.17 sec)
-
android/guava-tests/test/com/google/common/collect/PeekingIteratorTest.java
super(master.size() + 3, MODIFIABLE, master, IteratorTester.KnownOrder.KNOWN_ORDER); this.master = master; } @Override protected Iterator<T> newTargetIterator() { // make copy from master to verify later targetList = Lists.newArrayList(master); Iterator<T> iterator = targetList.iterator(); return Iterators.peekingIterator(iterator); } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 9K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Function.java
* Otherwise, at least reduce <i>explicit</i> dependencies on this type by using lambda expressions * or method references instead of classes, leaving your code easier to migrate in the future. * * <p>To use an existing function (say, named {@code function}) in a context where the <i>other * type</i> of function is expected, use the method reference {@code function::apply}. A future
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 01:41:50 GMT 2024 - 3.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
private final ElementOrder<E> edgeOrder; final MapIteratorCache<N, NetworkConnections<N, E>> nodeConnections; // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory. final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Booleans.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(Booleans.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(boolean[] array, int 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/math/DoubleMath.java
* #log2(double, RoundingMode)} is faster. */ public static double log2(double x) { return log(x) / LN_2; // surprisingly within 1 ulp according to tests } /** * Returns the base 2 logarithm of a double value, rounded with the specified rounding mode to an * {@code int}. * * <p>Regardless of the rounding mode, this is faster than {@code (int) log2(x)}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/FuturesGetChecked.java
* Static final fields are presumed to be fastest, based on our experience with * UnsignedBytesBenchmark. TODO(cpovirk): benchmark this */ /* * A CopyOnWriteArraySet<WeakReference> is faster than a newSetFromMap of a MapMaker map with * weakKeys() and concurrencyLevel(1), even up to at least 12 cached exception types. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 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. * * @since 32.0.0 */ public static void rotate(short[] array, int 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
* 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. * * @since 32.0.0 */ public static void rotate(long[] array, int 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/reflect/Invokable.java
import org.checkerframework.checker.nullness.qual.Nullable; /** * Wrapper around either a {@link Method} or a {@link Constructor}. Convenience API is provided to * make common reflective operation easier to deal with, such as {@link #isPublic}, {@link * #getParameters} etc. * * <p>In addition to convenience methods, {@link TypeToken#method} and {@link TypeToken#constructor}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 18.6K bytes - Viewed (0) -
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 Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 08 17:31:55 GMT 2024 - 33K bytes - Viewed (0)