- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 50 for Lyding (0.17 sec)
-
android/guava/src/com/google/common/graph/Graphs.java
/** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ArrayListMultimap.java
* * <p>When iterating through the collections supplied by this class, the ordering of values for a * given key agrees with the order in which the values were added. * * <p>This multimap allows duplicate key-value pairs. After adding a new key-value pair equal to an * existing key-value pair, the {@code ArrayListMultimap} will contain entries for both the new * value and the old value. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
public final class MoreExecutors { private MoreExecutors() {} /** * Converts the given ThreadPoolExecutor into an ExecutorService that exits when the application * is complete. It does so by using daemon threads and adding a shutdown hook to wait for their * completion. * * <p>This is mainly for fixed thread pools. See {@link Executors#newFixedThreadPool(int)}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 41.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
import java.util.function.Consumer; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * CompactHashSet is an implementation of a Set. All optional operations (adding and removing) are * supported. The elements can be any objects. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
if (that instanceof Pred) { return this.node.equals(((Pred<?>) that).node); } else { return false; } } @Override public int hashCode() { // Adding the class hashCode to avoid a clash with Succ instances. return Pred.class.hashCode() + node.hashCode(); } } static final class Succ<N> extends NodeConnection<N> { Succ(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Range.java
connectedRange); // TODO(kevinb): all the precondition checks in the constructor are redundant... return create(newLower, newUpper); } } /** * Returns the maximal range lying between this range and {@code otherRange}, if such a range * exists. The resulting range may be empty if the two ranges are adjacent but non-overlapping. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 27.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
this.queue = new Object[queueSize]; } @Override public int size() { return size; } /** * Adds the given element to this queue. If this queue has a maximum size, after adding {@code * element} the queue will automatically evict its greatest element (according to its comparator), * which may be {@code element} itself. * * @return {@code true} always */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K 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) -
android/guava/src/com/google/common/collect/CompactHashSet.java
import java.util.Set; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * CompactHashSet is an implementation of a Set. All optional operations (adding and removing) are * supported. The elements can be any objects. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)
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/MapMakerInternalMap.java
* the segment. */ final transient int segmentMask; /** * Shift value for indexing within segments. Helps prevent entries that end up in the same segment * from also ending up in the same bucket. */ final transient int segmentShift; /** The segments, each of which is a specialized hash table. */ final transient Segment<K, V, E, S>[] segments;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0)