- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 22 for staging (0.11 sec)
-
android/pom.xml
<url>https://oss.sonatype.org/content/repositories/snapshots/</url> </snapshotRepository> <repository> <id>sonatype-nexus-staging</id> <name>Nexus Release Repository</name> <url>https://oss.sonatype.org/service/local/staging/deploy/maven2/</url> </repository> <site> <id>guava-site</id> <name>Guava Documentation Site</name>
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 03 20:33:34 UTC 2024 - 19.4K bytes - Viewed (0) -
pom.xml
<url>https://oss.sonatype.org/content/repositories/snapshots/</url> </snapshotRepository> <repository> <id>sonatype-nexus-staging</id> <name>Nexus Release Repository</name> <url>https://oss.sonatype.org/service/local/staging/deploy/maven2/</url> </repository> <site> <id>guava-site</id> <name>Guava Documentation Site</name>
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 03 20:33:34 UTC 2024 - 19K 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) -
integration-tests/gradle/gradlew
# shellcheck disable=SC2039,SC3045 ulimit -n "$MAX_FD" || warn "Could not set maximum file descriptor limit to $MAX_FD" esac fi # Collect all arguments for the java command, stacking in reverse order: # * args from the command line # * the main class name # * -classpath # * -D...appname settings # * --module-path (only if needed)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Oct 31 19:07:19 UTC 2023 - 8.5K 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) -
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-tests/test/com/google/common/collect/ObjectArraysTest.java
String[] in = new String[0]; String[] empty = ObjectArrays.newArray(in, 0); assertThat(empty).isEmpty(); } public void testNewArray_fromArray_Nonempty() { String[] array = ObjectArrays.newArray(new String[0], 2); assertEquals(String[].class, array.getClass()); assertThat(array).hasLength(2); assertNull(array[0]); } public void testNewArray_fromArray_OfArray() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Mar 07 18:34:03 UTC 2024 - 8.8K bytes - Viewed (0)