- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 46 for uniqBy (0.19 sec)
-
android/guava/src/com/google/common/graph/MutableValueGraph.java
*/ @Beta @ElementTypesAreNonnullByDefault public interface MutableValueGraph<N, V> extends ValueGraph<N, V> { /** * Adds {@code node} if it is not already present. * * <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null. * * @return {@code true} if the graph was modified as a result of this call */ @CanIgnoreReturnValue boolean addNode(N node); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeBasedTable.java
* quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer, * since an iteration across all row keys occurs. * * <p>Because a {@code TreeBasedTable} has unique sorted values for a given row, both {@code * row(rowKey)} and {@code rowMap().get(rowKey)} are {@link SortedMap} instances, instead of the * {@link Map} specified in the {@link Table} interface. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 11.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
* small portion of these would be in use. * * <p>Prior to this class, one might be tempted to use {@code Map<K, Lock>}, where {@code K} * represents the task. This maximizes concurrency by having each unique key mapped to a unique * lock, but also maximizes memory footprint. On the other extreme, one could use a single lock for * all tasks, which minimizes memory footprint but also minimizes concurrency. Instead of choosing
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 10 20:55:18 GMT 2023 - 20.3K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/Cut.java
import java.io.Serializable; import java.util.NoSuchElementException; import javax.annotation.CheckForNull; /** * Implementation detail for the internal structure of {@link Range} instances. Represents a unique * way of "cutting" a "number line" (actually of instances of type {@code C}, not necessarily * "numbers") into two sections; this can be done below a certain value, above a certain value,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 12.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractScheduledServiceTest.java
// with the correct parameters. private static final int INITIAL_DELAY = 10; private static final int DELAY = 20; private static final TimeUnit UNIT = MILLISECONDS; // Unique runnable object used for comparison. final Runnable testRunnable = new Runnable() { @Override public void run() {} }; boolean called = false;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/ClassPath.java
* </ul> * * <h2>{@code ClassPath} and symlinks</h2> * * <p>In the case of directory classloaders, symlinks are supported but cycles are not traversed. * This guarantees discovery of each unique loadable resource. However, not all possible * aliases for resources on cyclic paths will be listed. * * @author Ben Yu * @since 14.0 */ @ElementTypesAreNonnullByDefault public final class ClassPath {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jan 05 17:43:40 GMT 2022 - 24.9K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/collect/IterablesTest.java
} iterables.add(Ordering.<Integer>natural().sortedCopy(list)); } verifyMergeSorted(iterables, allIntegers); } // Like the pyramid, but creates more unique values, along with repeated ones. public void testMergeSorted_skipping_pyramid() { List<Iterable<Integer>> iterables = Lists.newLinkedList(); List<Integer> allIntegers = Lists.newArrayList();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 46K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableValueGraph.java
graphBuilder.copy().incidentEdgeOrder(ElementOrder.<N>stable()).build(); } /** * Adds {@code node} if it is not already present. * * <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null. * * @return this {@code Builder} object */ @CanIgnoreReturnValue public ImmutableValueGraph.Builder<N, V> addNode(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableGraph.java
* @since 20.0 */ @Beta @ElementTypesAreNonnullByDefault public interface MutableGraph<N> extends Graph<N> { /** * Adds {@code node} if it is not already present. * * <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null. * * @return {@code true} if the graph was modified as a result of this call */ @CanIgnoreReturnValue boolean addNode(N node); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/BiMap.java
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 4.3K bytes - Viewed (0)