- Sort Score
- Result 10 results
- Languages All
Results 241 - 250 of 312 for recessive (0.04 sec)
-
src/main/java/jcifs/smb/SmbFile.java
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 103.2K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/SmbTransport.java
doSend0(req); } while (req.hasMoreElements() && req.nextElement() != null); /* * Receive multiple fragments */ long timeout = RESPONSE_TIMEOUT; resp.expiration = System.currentTimeMillis() + timeout;
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 31.8K bytes - Viewed (0) -
docs/en/docs/deployment/concepts.md
Those worker processes would be the ones running your application, they would perform the main computations to receive a **request** and return a **response**, and they would load anything you put in variables in RAM. <img src="/img/deployment/concepts/process-ram.drawio.svg">
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 18.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/UninterruptiblesTest.java
private static final class TimedTakeQueue { final BlockingQueue<String> queue; final Completion completed; /** * Creates a {@link EnableReads} which insert an element for a {@code take} to receive in {@code * countdownInMillis}. */ static TimedTakeQueue createWithDelay(long countdownInMillis) { return new TimedTakeQueue(countdownInMillis); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 16 17:42:14 UTC 2025 - 31.7K bytes - Viewed (0) -
docs/smb3-features/03-multi-channel-design.md
private int linkSpeed; // In units of 1 Mbps private byte[] sockaddrStorage; // Socket address private InetAddress address; private boolean ipv6; private boolean rssCapable; // Receive Side Scaling private boolean rdmaCapable; // Capability flags public static final int NETWORK_INTERFACE_CAP_RSS = 0x00000001; public static final int NETWORK_INTERFACE_CAP_RDMA = 0x00000002;
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 02:53:50 UTC 2025 - 39.6K bytes - Viewed (0) -
cmd/peer-rest-client.go
Scheme: scheme, Host: peer.String(), Path: peerRESTPath, } restClient := rest.NewClient(serverURL, globalInternodeTransport, newCachedAuthToken()) // Use a separate client to avoid recursive calls. healthClient := rest.NewClient(serverURL, globalInternodeTransport, newCachedAuthToken()) healthClient.NoMetrics = true // Construct a new health function. restClient.HealthCheckFn = func() bool {
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Mon Sep 09 16:58:30 UTC 2024 - 26.1K bytes - Viewed (0) -
README.md
 ## Example upgrade { #example-upgrade } Now modify the file `main.py` to receive a body from a `PUT` request. Declare the body using standard Python types, thanks to Pydantic. ```Python hl_lines="4 9-12 25-27" from typing import Union from fastapi import FastAPI
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 15:19:49 UTC 2025 - 24.3K bytes - Viewed (0) -
docs/en/docs/index.md
 ## Example upgrade { #example-upgrade } Now modify the file `main.py` to receive a body from a `PUT` request. Declare the body using standard Python types, thanks to Pydantic. ```Python hl_lines="4 9-12 25-27" from typing import Union from fastapi import FastAPI
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 10:49:48 UTC 2025 - 21.3K bytes - Viewed (0) -
docs/changelogs/changelog_4x.md
receiving stream to process it. This change may increase OkHttp's memory use for applications that make many concurrent HTTP calls and that can receive data faster than they can process it. Previously, OkHttp limited HTTP/2 to 16 MiB of unacknowledged data per connection. With this fix there is a limit of 16 MiB of unacknowledged data per stream and no per-connection limit.
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Apr 17 13:25:31 UTC 2024 - 25.2K bytes - Viewed (0) -
cmd/data-usage-cache.go
d.copyWithChildren(src, dataUsageHash(ch), &hash) } if parent != nil { p := d.Cache[parent.Key()] p.addChild(hash) d.Cache[parent.Key()] = p } } // reduceChildrenOf will reduce the recursive number of children to the limit // by compacting the children with the least number of objects. func (d *dataUsageCache) reduceChildrenOf(path dataUsageHash, limit int, compactSelf bool) { e, ok := d.Cache[path.Key()]
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 34.7K bytes - Viewed (0)