- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 14 for parallel (0.88 sec)
-
guava/src/com/google/common/graph/Network.java
* an edge connecting node A to node B if this {@link Network} has an edge connecting A to B. * * <p>If this network {@link #allowsParallelEdges() allows parallel edges}, parallel edges will be * treated as if collapsed into a single edge. For example, the {@link #degree(Object)} of a node * in the {@link Graph} view may be less than the degree of the same node in this {@link Network}. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:03:02 UTC 2025 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EdgesConnecting.java
/** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #nodeToOutEdge} map means this class only works on networks without parallel edges. * See {@link MultiEdgesConnecting} for a class that works with parallel edges. * * @author James Sexton * @param <E> Edge parameter type */ final class EdgesConnecting<E> extends AbstractSet<E> { private final Map<?, E> nodeToOutEdge;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 2.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
*/ public static boolean hasCycle(Network<?, ?> network) { // In a directed graph, parallel edges cannot introduce a cycle in an acyclic graph. // However, in an undirected graph, any parallel edge induces a cycle in the graph. if (!network.isDirected() && network.allowsParallelEdges() && network.edges().size() > network.asGraph().edges().size()) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
*/ public static boolean hasCycle(Network<?, ?> network) { // In a directed graph, parallel edges cannot introduce a cycle in an acyclic graph. // However, in an undirected graph, any parallel edge induces a cycle in the graph. if (!network.isDirected() && network.allowsParallelEdges() && network.edges().size() > network.asGraph().edges().size()) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Streams.java
boolean isParallel = false; int characteristics = Spliterator.ORDERED | Spliterator.SIZED | Spliterator.NONNULL; long estimatedSize = 0L; ImmutableList.Builder<Spliterator<? extends T>> splitrsBuilder = new ImmutableList.Builder<>(streams.length); for (Stream<? extends T> stream : streams) { isParallel |= stream.isParallel();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 37K bytes - Viewed (0) -
okhttp/src/jvmTest/kotlin/okhttp3/KotlinSourceModernTest.kt
multipartBody.writeTo(Buffer()) val mixed: MediaType = MultipartBody.MIXED val alternative: MediaType = MultipartBody.ALTERNATIVE val digest: MediaType = MultipartBody.DIGEST val parallel: MediaType = MultipartBody.PARALLEL val form: MediaType = MultipartBody.FORM } @Test fun multipartBodyPart() { val requestBody: RequestBody = "".toRequestBody(null)
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Sat Jun 21 20:36:35 UTC 2025 - 46.5K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/rank/fusion/RankFusionProcessor.java
} return availableSearchers; } /** * Performs concurrent searches using multiple searchers and fuses the results. * Executes searches in parallel across all provided searchers, then combines the results * using rank fusion algorithms to produce a unified result set. * * @param searchers array of searchers to use for concurrent searching
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 24.8K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/thumbnail/ThumbnailManager.java
thumbnailQueueBhv.batchInsert(list); } /** * Generates thumbnails using the provided executor service. * * @param executorService the executor service for parallel processing * @param cleanup whether to run in cleanup mode * @return the number of tasks processed */ public int generate(final ExecutorService executorService, final boolean cleanup) {
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Tue Aug 19 14:09:36 UTC 2025 - 26.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/exec/Crawler.java
} /** * Executes the actual crawling operations based on the provided options. * This method coordinates web/file system crawling and data store crawling, * running them in parallel threads when multiple types are requested. * * @param options crawling configuration options * @return exit code (Constants.EXIT_OK for success, Constants.EXIT_FAIL for failure) */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 31K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Http2Connection.kt
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Thu Jul 31 04:18:40 UTC 2025 - 31.8K bytes - Viewed (0)