- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 44 for staging (0.33 sec)
-
guava/src/com/google/common/primitives/package-info.java
* the License. */ /** * Static utilities for the eight primitive types and {@code void}, and value types for treating * them as unsigned or storing them in immutable arrays. * * <p>This package is a part of the open-source <a href="https://github.com/google/guava">Guava</a> * library. * * <p>See the Guava User Guide article on <a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 26 21:13:41 UTC 2023 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
// Graph query methods /** * 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) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
// Graph query methods /** * 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) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractExecutionThreadService.java
* * <p>The default implementation returns a new {@link Executor} that sets the name of its threads * to the string returned by {@link #serviceName} */ protected Executor executor() { return command -> MoreExecutors.newThread(serviceName(), command).start(); } @Override public String toString() { return serviceName() + " [" + state() + "]"; } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Dec 13 19:45:20 UTC 2023 - 7.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/DiscreteDomain.java
public abstract C previous(C value); /** * Returns a signed value indicating how many nested invocations of {@link #next} (if positive) or * {@link #previous} (if negative) are needed to reach {@code end} starting from {@code start}. * For example, if {@code end = next(next(next(start)))}, then {@code distance(start, end) == 3} * and {@code distance(end, start) == -3}. As well, {@code distance(a, a)} is always zero. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.3K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/GcFinalization.java
// Hope to catch some stragglers queued up behind our finalizable object System.runFinalization(); } private static RuntimeException formatRuntimeException(String format, Object... args) { return new RuntimeException(String.format(Locale.ROOT, format, args)); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 17:40:56 UTC 2024 - 11.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
* bufferSize ≥ k, then we can ignore any elements greater than this value. */ @CheckForNull private T threshold; @SuppressWarnings("unchecked") // TODO(cpovirk): Consider storing Object[] instead of T[]. private TopKSelector(Comparator<? super T> comparator, int k) { this.comparator = checkNotNull(comparator, "comparator"); this.k = k; checkArgument(k >= 0, "k (%s) must be >= 0", k);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java
* references to the map or modify it in any way. * * <p>The returned multiset is serializable if the input map is. * * @param countMap backing map for storing the elements in the multiset and their counts. It must * be empty. * @throws IllegalArgumentException if {@code countMap} is not empty * @since 20.0 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 20.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
this.key = key; KeyList<K, V> keyList = keyToKeyList.get(key); next = (keyList == null) ? null : keyList.head; } /** * Constructs a new iterator over all values for the specified key starting at the specified * index. This constructor is optimized so that it starts at either the head or the tail, * depending on which is closer to the specified index. This allows adds to the tail to be done
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 27.2K bytes - Viewed (0) -
android/guava/src/com/google/common/net/MediaType.java
private final String type; private final String subtype; private final ImmutableListMultimap<String, String> parameters; @LazyInit @CheckForNull private String toString; @LazyInit private int hashCode; @LazyInit @CheckForNull private Optional<Charset> parsedCharset; private MediaType(String type, String subtype, ImmutableListMultimap<String, String> parameters) { this.type = type;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Aug 07 16:17:10 UTC 2023 - 46.2K bytes - Viewed (0)