- Sort Score
- Result 10 results
- Languages All
Results 411 - 420 of 1,281 for Mach (0.02 sec)
-
test-site/public/javascripts/suggestor.js
Registered: Fri Nov 08 09:08:12 UTC 2024 - Last Modified: Mon Apr 20 08:41:37 UTC 2015 - 14.6K bytes - Viewed (0) -
docs/en/docs/management.md
## Owner I, <a href="https://github.com/tiangolo" target="_blank">@tiangolo</a>, am the creator and owner of the FastAPI repository. 🤓 I normally give the final review to each PR before merging them. I make the final decisions on the project, I'm the <a href="https://en.wikipedia.org/wiki/Benevolent_dictator_for_life" class="external-link" target="_blank"><abbr title="Benevolent Dictator For Life">BDFL</abbr></a>. 😅
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Wed Jul 31 14:09:15 UTC 2024 - 1.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
} return 11; // initial capacity will be rounded up to 16 } /** * Returns an unmodifiable view of the union of two multisets. In the returned multiset, the count * of each element is the <i>maximum</i> of its counts in the two backing multisets. The iteration * order of the returned multiset matches that of the element set of {@code multiset1} followed by
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 41.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multisets.java
} return 11; // initial capacity will be rounded up to 16 } /** * Returns an unmodifiable view of the union of two multisets. In the returned multiset, the count * of each element is the <i>maximum</i> of its counts in the two backing multisets. The iteration * order of the returned multiset matches that of the element set of {@code multiset1} followed by
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 41.5K bytes - Viewed (0) -
docs/en/docs/async.md
But in this case, if you could bring the 8 ex-cashier/cooks/now-cleaners, and each one of them (plus you) could take a zone of the house to clean it, you could do all the work in **parallel**, with the extra help, and finish much sooner. In this scenario, each one of the cleaners (including you) would be a processor, doing their part of the job.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Wed Aug 28 23:33:37 UTC 2024 - 23.5K bytes - Viewed (0) -
build-logic-commons/gradle-plugin/src/main/kotlin/gradlebuild/testcleanup/extension/TestFilesCleanupProjectState.kt
import org.gradle.api.provider.Property /** * Works with {@see TestFilesCleanupService} and {@see TestFilesCleanupServiceRootExtension}. * It collects states to be used in the build service for each project. */ interface TestFilesCleanupProjectState : TestFileCleanUpExtension { val projectPath: Property<String> val projectBuildDir: DirectoryProperty
Registered: Wed Nov 06 11:36:14 UTC 2024 - Last Modified: Fri Mar 18 02:11:12 UTC 2022 - 1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableList.java
* undocumented and subject to change. * * <p>Note that if {@code list} is a {@code List<String>}, then {@code ImmutableList.copyOf(list)} * returns an {@code ImmutableList<String>} containing each of the strings in {@code list}, while * {@code ImmutableList.of(list)} returns an {@code ImmutableList<List<String>>} containing one * element (the given list itself). *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 21:21:17 UTC 2024 - 27.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
import java.time.Duration; import java.util.Locale; import java.util.concurrent.TimeUnit; import javax.annotation.CheckForNull; /** * A rate limiter. Conceptually, a rate limiter distributes permits at a configurable rate. Each * {@link #acquire()} blocks if necessary until a permit is available, and then takes it. Once * acquired, permits need not be released. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:51:36 UTC 2024 - 21.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableListMultimap.java
return CollectCollectors.toImmutableListMultimap(keyFunction, valueFunction); } /** * Returns a {@code Collector} accumulating entries into an {@code ImmutableListMultimap}. Each * input element is mapped to a key and a stream of values, each of which are put into the * resulting {@code Multimap}, in the encounter order of the stream and the encounter order of the * streams of values. * * <p>Example: *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 21:21:17 UTC 2024 - 19.3K bytes - Viewed (0) -
cmd/local-locker_test.go
ok, err = l.RLock(ctx, arg) if err != nil { t.Fatal(err) } if !ok { t.Fatal("did not get write lock") } rResources[i] = name rUIDs = append(rUIDs, uid) } // Each Lock has m entries if len(l.lockMap) != len(rResources)+len(wResources)*m { t.Fatalf("lockmap len, got %d, want %d + %d", len(l.lockMap), len(rResources), len(wResources)*m) } // A UID is added for every resource
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Jul 24 10:24:01 UTC 2024 - 11.9K bytes - Viewed (0)