- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 163 for Modifications (0.22 sec)
-
android/guava/src/com/google/common/collect/RangeMap.java
* call to {@code remove(range)}, {@code get(k)} will return {@code null}. */ void remove(Range<K> range); /** * Returns a view of this range map as an unmodifiable {@code Map<Range<K>, V>}. Modifications to * this range map are guaranteed to read through to the returned {@code Map}. * * <p>The returned {@code Map} iterates over entries in ascending order of the bounds of the * {@code Range} entries. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
* implementation-dependent). Furthermore, implementations are not required to support * modifications to the entry set at all, and the {@code Entry} instances themselves don't even * have methods for modification. See the specific implementation class for more details on how * its entry set handles modifications. * * @return a set of entries representing the data of this multiset */ Set<Entry<E>> entrySet();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 19.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
// 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(); } @Test public void putEdge_existingEdgeBetweenSameNodes() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java
} } /** * {@inheritDoc} * * <p>If the data in the multiset is modified by any other threads during this method, it is * undefined which (if any) of these modifications will be reflected in the result. */ @Override public int size() { long sum = 0L; for (Integer value : countMap.values()) { sum += value; }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed May 09 15:17:25 GMT 2018 - 16.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ListsTest.java
List<Integer> toList = Lists.reverse(fromList); assertReverseView(fromList, toList); } private static void assertReverseView(List<Integer> fromList, List<Integer> toList) { /* fromList modifications reflected in toList */ fromList.set(0, 5); assertEquals(asList(4, 3, 2, 5), toList); fromList.add(6); assertEquals(asList(6, 4, 3, 2, 5), toList); fromList.add(2, 9);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 35.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/AbstractMultiset.java
* implementation can be created easily by extending this class and implementing the {@link * Multiset#entrySet()} method, plus optionally overriding {@link #add(Object, int)} and {@link * #remove(Object, int)} to enable modifications to the multiset. * * <p>The {@link #count} and {@link #size} implementations all iterate across the set returned by * {@link Multiset#entrySet()}, as do many methods acting on the set returned by {@link
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedMultiset.java
* <p>The iterator returns the elements in ascending order according to this multiset's * comparator. */ @Override Iterator<E> iterator(); /** * Returns a descending view of this multiset. Modifications made to either map will be reflected * in the other. */ SortedMultiset<E> descendingMultiset(); /** * Returns a view of this multiset restricted to the elements less than {@code upperBound},
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
// Element Mutation @Test public void addEdge_existingNodes() { assume().that(graphIsMutable()).isTrue(); // Adding nodes initially for safety (insulating from possible future // modifications to proxy methods) addNode(N1); addNode(N2); assertThat(networkAsMutableNetwork.addEdge(N1, N2, E12)).isTrue(); assertThat(network.edges()).contains(E12);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java
import java.util.concurrent.atomic.AtomicInteger; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A multiset that supports concurrent modifications and that provides atomic versions of most * {@code Multiset} operations (exceptions where noted). Null elements are not supported. * * <p>See the Guava User Guide article on <a href=
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 20.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* elements.length) are all {@code null}. */ @VisibleForTesting @CheckForNull transient @Nullable Object[] elements; /** * Keeps track of metadata like the number of hash table bits and modifications of this data * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note * that we choose not to make this volatile, so we do less of a "best effort" to track such
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0)