- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 248 for Wright (0.18 sec)
-
guava-tests/test/com/google/common/cache/TestingWeighers.java
return new ConstantWeigher(constant); } /** Returns a {@link Weigher} that uses the integer key as the weight. */ static Weigher<Integer, Object> intKeyWeigher() { return new IntKeyWeigher(); } /** Returns a {@link Weigher} that uses the integer value as the weight. */ static Weigher<Object, Integer> intValueWeigher() { return new IntValueWeigher(); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 1.9K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/TestsForMapsInJavaUtil.java
} private static final class NullFriendlyComparator<T> implements Comparator<T>, Serializable { @Override public int compare(T left, T right) { return String.valueOf(left).compareTo(String.valueOf(right)); } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.6K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/util/concurrent/testing/AbstractListenableFutureTest.java
// Test that listeners added both before and after the value is available // get called correctly. for (int i = 0; i < 20; i++) { // Right in the middle start up a thread to close the latch. if (i == 10) { new Thread(() -> latch.countDown()).start(); } future.addListener(listenerLatch::countDown, exec); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 18:30:30 GMT 2023 - 6K 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) -
guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
sort( insertionOrder, new Comparator<V>() { @Override public int compare(V left, V right) { // The indexes are small enough for the subtraction trick to be safe. return indexOfEntryWithValue(left) - indexOfEntryWithValue(right); } int indexOfEntryWithValue(V value) { for (int i = 0; i < orderedEntries.size(); i++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java
/* * If another handleException() caller created the set, we need to use that copy in case yet * other callers have added to it. * * This read is guaranteed to get us the right value because we only set this once (here). * * requireNonNull is safe because either our compareAndSet succeeded or it failed because * another thread did it for us. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* prefer the simplest interface that satisfies your use case. See the <a * href="https://github.com/google/guava/wiki/GraphsExplained#choosing-the-right-graph-type"> * "Choosing the right graph type"</a> section of the Guava User Guide for more details. * * <h3>Capabilities</h3> * * <p>{@code ValueGraph} supports the following use cases (<a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
guava-tests/test/com/google/common/reflect/TypeTokenTest.java
Iterable<? extends TypeToken<?>> types) { int i = 0; for (TypeToken<?> left : types) { int j = 0; for (TypeToken<?> right : types) { if (left.isSupertypeOf(right)) { assertTrue(left + " should be after " + right, i >= j); } j++; } i++; } }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 88.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
successor(pred(), succ()); if (left == null) { return right; } else if (right == null) { return left; } else if (left.height >= right.height) { AvlNode<E> newTop = pred(); // newTop is the maximum node in my left subtree newTop.left = left.removeMax(newTop); newTop.right = right; newTop.distinctElements = distinctElements - 1;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
android/guava/src/com/google/common/io/ReaderInputStream.java
return bigger; } /** Handle the case of underflow caused by needing more input characters. */ private void readMoreChars() throws IOException { // Possibilities: // 1) array has space available on right-hand side (between limit and capacity) // 2) array has space available on left-hand side (before position) // 3) array has no space available //
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 28 20:13:02 GMT 2023 - 9.3K bytes - Viewed (0)