- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 217 for ongoing (0.09 sec)
-
impl/maven-core/src/main/java/org/apache/maven/classrealm/DefaultClassRealmManager.java
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 13.4K bytes - Viewed (0) -
docs/en/docs/tutorial/body-nested-models.md
This would be useful if you want to receive keys that you don't already know. --- Another useful case is when you want to have keys of another type (e.g., `int`). That's what we are going to see here. In this case, you would accept any `dict` as long as it has `int` keys with `float` values: //// tab | Python 3.9+ ```Python hl_lines="7"
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 9.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionList.java
private static void executeListener(Runnable runnable, Executor executor) { try { executor.execute(runnable); } catch (Exception e) { // sneaky checked exception // Log it and keep going -- bad runnable and/or executor. Don't punish the other runnables if // we're given a bad one. We only catch Exception because we want Errors to propagate up. log.get() .log( Level.SEVERE,
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 22 21:17:24 UTC 2024 - 6.9K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/internal/aether/ReverseTreeRepositoryListener.java
|| artifact.getFile() .getPath() .startsWith(session.getLocalRepository().getBasedir().getPath()); } /** * Unravels trace tree (going upwards from current node), looking for {@link CollectStepData} trace data. * This method may return {@code null} if no collect step data found in passed trace data or it's parents. * <p> * Visible for testing.
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 9.8K bytes - Viewed (0) -
cmd/erasure-healing-common_test.go
} if diskIndex != 0 && disk == nil { t.Errorf("Drive erroneously filtered, driveIndex: %d", diskIndex) } } partsMetadata[0] = partsMetadataBackup // Revert before going to the next test // Test 3: Not synchronized DataDir partsMetadataBackup = partsMetadata[1] partsMetadata[1].DataDir = "foo-random" errs = make([]error, len(erasureDisks))
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 01 15:19:10 UTC 2024 - 23.1K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/AndXServerMessageBlock.java
* A word about communicating header info to andx smbs * * This is where we recursively invoke the provided andx smb * object to write it's parameter words and bytes to our outgoing * array. Incedentally when these andx smbs are created they are not * necessarily populated with header data because they're not writing
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Mon Nov 28 10:56:27 UTC 2022 - 14.3K bytes - Viewed (0) -
compat/maven-model-builder/src/main/java/org/apache/maven/model/interpolation/reflection/ClassMap.java
// clazz is public if (Modifier.isPublic(clazz.getModifiers())) { return methods; } // No luck - the class is not public, so we're going the longer way. MethodInfo[] methodInfos = new MethodInfo[methods.length]; for (int i = methods.length; i-- > 0; ) { methodInfos[i] = new MethodInfo(methods[i]); }
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 13.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/GeneratedMonitorTest.java
*/ private static TestCase generateGuardWithWrongMonitorTestCase( final Method method, final boolean fair1, final boolean fair2) { final boolean timed = isTimed(method); // Not going to bother with all timeouts, just 0ms. return new TestCase(method.getName() + (timed ? "(0ms)" : "()") + "/WrongMonitor->IMSE") { @Override protected void runTest() throws Throwable {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:51:36 UTC 2024 - 27.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableMap.java
: new NonTerminalImmutableMapEntry<K, V>(key, value, keyBucketHead); table[tableIndex] = effectiveEntry; } else { // We already saw this key, and the first value we saw (going backwards) is the one we are // keeping. So we won't touch table[], but we do still want to add the existing entry that // we found to entries[] so that we will see this key in the right place when iterating.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 16.2K bytes - Viewed (0) -
internal/dsync/drwmutex.go
if locksFailed > tolerance { // We know that we are not going to get the lock anymore, // so exit out and release any locks that did get acquired done = true } } case <-ctx.Done(): // Capture timedout locks as failed or took too long locksFailed++ if locksFailed > tolerance { // We know that we are not going to get the lock anymore,
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Sep 09 15:49:49 UTC 2024 - 20.4K bytes - Viewed (0)