- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 54 for Eddine (0.19 sec)
-
android/guava/src/com/google/common/collect/Multimap.java
* * <p>Multimaps are commonly used in places where a {@code Map<K, Collection<V>>} would otherwise * have appeared. The differences include: * * <ul> * <li>There is no need to populate an empty collection before adding an entry with {@link #put * put}. * <li>{@code get} never returns {@code null}, only an empty collection. * <li>A key is contained in the multimap if and only if it maps to at least one value. Any
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-testlib/test/com/google/common/testing/EqualsTesterTest.java
} } /** Test equalObjects after adding multiple instances at once with a null */ public void testAddTwoEqualObjectsAtOnceWithNull() { try { equalsTester.addEqualityGroup(reference, equalObject1, null); fail("Should fail on null equal object"); } catch (NullPointerException e) { } } /** Test adding null equal object yields error */ public void testAddNullEqualObject() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 17 15:49:06 GMT 2023 - 12.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
* {@code asMap} has a few subtleties. As long as the set of keys remains unchanged, adding or * removing mappings does not affect the key iteration order. However, if you remove all values * associated with a key and then add the key back to the multimap, that key will come last in the * key iteration order. * * <p>The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an * existing key-value pair has no effect. *
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-tests/test/com/google/common/collect/ListsImplTest.java
ImmutableList.of("A"), ImmutableList.of("A"), ImmutableList.of("A", "A", "B", "C"), ImmutableList.of("A", "A", "D", "E", "B", "C")); String format = "Adding %s at %s"; for (int i = 0; i < toAdd.size(); i++) { int index = indexes.get(i); Iterable<String> iterableToAdd = toAdd.get(i); boolean expectedChanged = iterableToAdd.iterator().hasNext();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 26 16:35:21 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/FluentFuture.java
* * <h3>Alternatives</h3> * * <h4>Frameworks</h4> * * <p>When chaining together a graph of asynchronous operations, you will often find it easier to * use a framework. Frameworks automate the process, often adding features like monitoring, * debugging, and cancellation. Examples of frameworks include: * * <ul> * <li><a href="https://dagger.dev/producers.html">Dagger Producers</a> * </ul> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 11 19:08:44 GMT 2023 - 18.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/StatsAccumulatorTest.java
assertThat(manyValuesAccumulatorByAddAllStats.min()).isEqualTo(MANY_VALUES_MIN); assertThat(manyValuesAccumulatorByAddAllStatsAccumulator.min()).isEqualTo(MANY_VALUES_MIN); // For datasets of many double values created by adding elements individually, we test many // combinations of finite and non-finite values: for (ManyValues values : ALL_MANY_VALUES) { StatsAccumulator accumulator = new StatsAccumulator();
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 36.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
if (result[0] == 0) { distinctElements++; } this.totalCount += count; return (right.height == initHeight) ? this : rebalance(); } // adding count to me! No rebalance possible. result[0] = elemCount; long resultCount = (long) elemCount + count; checkArgument(resultCount <= Integer.MAX_VALUE); this.elemCount += count;
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/math/LongMath.java
/* * lowasser, 2015-Feb-12: Benchmarks suggest that changing this to UnsignedLongs.remainder * and increasing the threshold to 2^32 doesn't pay for itself, and adding another enum * constant hurts performance further -- I suspect because bimorphic implementation is a * sweet spot for the JVM. */ return (a * b) % m; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
putEdge(1, 2); // Duplicate putEdge(4, 5); } // Element Mutation @Test public void putEdge_existingNodes() { assume().that(graphIsMutable()).isTrue(); // Adding nodes initially for safety (insulating from possible future // modifications to proxy methods) addNode(N1); addNode(N2); assertThat(graphAsMutableGraph.putEdge(N1, N2)).isTrue(); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ListsImplTest.java
Collections.singletonList("A"), ImmutableList.of("A"), ImmutableList.of("A", "A", "B", "C"), ImmutableList.of("A", "A", "D", "E", "B", "C")); String format = "Adding %s at %s"; for (int i = 0; i < toAdd.size(); i++) { int index = indexes.get(i); Iterable<String> iterableToAdd = toAdd.get(i); boolean expectedChanged = iterableToAdd.iterator().hasNext();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 16:35:21 GMT 2024 - 10.6K bytes - Viewed (0)