- Sort Score
- Num 10 results
- Language All
Results 191 - 200 of 8,296 for require (0.4 seconds)
-
okhttp/src/commonJvmAndroid/kotlin/okhttp3/MultipartReader.kt
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Jan 27 09:00:39 GMT 2026 - 7.3K bytes - Click Count (0) -
ci/official/containers/ml_build/builder.devtoolset/build_devtoolset.sh
exit 1 ;; esac mkdir -p "${TARGET}" # Download glibc's shared and development libraries based on the value of the # `VERSION` parameter. # Note: 'Templatizing' this and the other conditional branches would require # defining several variables (version, os, path) making it difficult to maintain # and extend for future modifications. case "${VERSION}" in devtoolset-7) # Download binary glibc 2.12 shared library release.Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Fri Jan 16 21:51:13 GMT 2026 - 8K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/storage/GcsStorageClient.java
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Dec 13 02:21:17 GMT 2025 - 10.3K bytes - Click Count (0) -
docs/features/events.md
some connectivity failures. In this case, the `connectFailed()` event is not terminal and not followed by `callFailed()`. Event listeners will receive multiple events of the same type when retries are attempted. A single HTTP call may require follow-up requests to be made to handle authentication challenges, redirects, and HTTP-layer timeouts. In such cases multiple connections, requests, and responses may be attempted. Follow-ups are another reason a single call may trigger multiple events...
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sun Mar 15 09:01:42 GMT 2026 - 7.7K bytes - Click Count (0) -
docs/en/docs/async.md
--- Common examples of CPU bound operations are things that require complex math processing. For example: * **Audio** or **image processing**. * **Computer vision**: an image is composed of millions of pixels, each pixel has 3 values / colors, processing that normally requires computing something on those pixels, all at the same time.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 23.4K bytes - Click Count (0) -
docs/en/docs/tutorial/background-tasks.md
They tend to require more complex configurations, a message/job queue manager, like RabbitMQ or Redis, but they allow you to run background tasks in multiple processes, and especially, in multiple servers.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 4.7K bytes - Click Count (0) -
src/main/java/jcifs/internal/smb2/rdma/disni/DisniRdmaConnection.java
* * This class would integrate with the DiSNI library to provide * high-performance RDMA operations over InfiniBand/RoCE networks. * * Note: This is a skeleton implementation. A real implementation would * require proper DiSNI integration with actual RDMA hardware. */ public class DisniRdmaConnection extends RdmaConnection { private static final Logger log = LoggerFactory.getLogger(DisniRdmaConnection.class);Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 23 05:11:12 GMT 2025 - 10.2K bytes - Click Count (0) -
impl/maven-cli/src/test/java/org/apache/maven/cling/invoker/mvnup/goals/StrategyOrchestratorTest.java
Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Tue Nov 18 18:03:26 GMT 2025 - 12.3K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Http2Stream.kt
if (flushHeaders) { connection.flush() } } fun enqueueTrailers(trailers: Headers) { withLock { check(!sink.finished) { "already finished" } require(trailers.size != 0) { "trailers.size() == 0" } this.sink.trailers = trailers } } fun readTimeout(): Timeout = readTimeout fun writeTimeout(): Timeout = writeTimeout /**Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Mon Jul 07 18:57:05 GMT 2025 - 22.4K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/Traverser.java
* node(s), consider using {@link #forTree(SuccessorsFunction)} instead. * * <p><b>Performance notes</b> * * <ul> * <li>Traversals require <i>O(n)</i> time (where <i>n</i> is the number of nodes reachable from * the start node), assuming that the node objects have <i>O(1)</i> {@code equals()} and * {@code hashCode()} implementations. (See the <a
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 19.3K bytes - Click Count (0)