- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 26 for Groves (0.16 sec)
-
android/guava/src/com/google/common/collect/Multimap.java
* } * }</pre> * * ... produces output such as: * * <pre>{@code * Zachary: [Taylor] * John: [Adams, Adams, Tyler, Kennedy] // Remember, Quincy! * George: [Washington, Bush, Bush] * Grover: [Cleveland, Cleveland] // Two, non-consecutive terms, rep'ing NJ! * ... * }</pre> * * <h3>Views</h3> * * <p>Much of the power of the multimap API comes from the <i>view collections</i> it provides.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 15.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
* known-non-null type? But that particular problem might not arise here, since we're not * actually reading from the fields in any case in which they might be null (as proven by the * requireNonNull checks below). Plus, we're *already* lying here, since newHeader passes a null * key and value, which we pass to the superconstructor, even though the key and value type for
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
public void set(E e) { throwIfInvalid(IteratorFeature.SUPPORTS_SET); stackWithLastReturnedElementAtTop.pop(); stackWithLastReturnedElementAtTop.push(e); } /** * Moves the given element from its current position in {@link #nextElements} to the top of the * stack so that it is returned by the next call to {@link Iterator#next()}. If the element is
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
void removeEntryValueHashKnown(int entry, int valueHash) { removeEntry(entry, Hashing.smearedHash(keys[entry]), valueHash); } /** * Moves the entry previously positioned at {@code src} to {@code dest}. Assumes the entry * previously at {@code src} has already been removed from the data structures. */ private void moveEntryToIndex(int src, int dest) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/PairedStats.java
* fraction {@code sqrt(1/(R*R) - 1)} of the population standard deviation of {@code x}. This fit * does not normally minimize that error: to do that, you should swap the roles of {@code x} and * {@code y}. * * <h3>Non-finite values</h3> * * <p>If the dataset contains any non-finite values ({@link Double#POSITIVE_INFINITY}, {@link
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 12.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/StreamsTest.java
(a, b) -> { count.incrementAndGet(); assertThat(a.equals(String.valueOf(b))).isTrue(); }); assertThat(count.get()).isEqualTo(100000); // of course, this test doesn't prove that anything actually happened in parallel... } // TODO(kevinb): switch to importing Truth's assertThat(DoubleStream) if we get that added private static IterableSubject assertThatDoubleStream(DoubleStream stream) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 20K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
if (index == -1) { return false; } moveLastEntry(index, mask); size--; incrementModCount(); return true; } /** * Moves the last entry in the entry array into {@code dstIndex}, and nulls out its old position. */ void moveLastEntry(int dstIndex, int mask) { Object table = requireTable(); int[] entries = requireEntries();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
int leftChildIndex = getLeftChildIndex(index); if (leftChildIndex < 0) { return -1; } return findMin(getLeftChildIndex(leftChildIndex), 4); } /** * Moves an element one level up from a min level to a max level (or vice versa). Returns the * new position of the element. */ int crossOverUp(int index, E x) { if (index == 0) { queue[0] = x;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
verifyScenario(alteration.mutate(scenario), level + 1); } } } /** * An aggregation of an ordering with a list (of size > 1) that should prove to be in strictly * increasing order according to that ordering. */ private static class Scenario<T extends @Nullable Object> { final Ordering<T> ordering; final List<T> strictlyOrderedList;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/OrderingTest.java
verifyScenario(alteration.mutate(scenario), level + 1); } } } /** * An aggregation of an ordering with a list (of size > 1) that should prove to be in strictly * increasing order according to that ordering. */ private static class Scenario<T extends @Nullable Object> { final Ordering<T> ordering; final List<T> strictlyOrderedList;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0)