- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for complexity (0.07 sec)
-
docs/sts/tls.md
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 6K bytes - Viewed (1) -
docs/SMB3_IMPLEMENTATION_PLAN.md
jcifs.smb.client.rdmaProvider=disni # Witness jcifs.smb.client.useWitness=true jcifs.smb.client.witnessNotificationTimeout=5000 ``` ## Risk Assessment ### Technical Risks 1. **RDMA Complexity**: Limited Java RDMA support may require JNI 2. **Multi-Channel Synchronization**: Complex thread synchronization required 3. **Persistent Handle State**: Requires reliable state persistence mechanism
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 02:53:50 UTC 2025 - 10.7K bytes - Viewed (0) -
docs/en/docs/deployment/docker.md
Having another process manager inside the container (as would be with multiple workers) would only add **unnecessary complexity** that you are most probably already taking care of with your cluster system. ### Containers with Multiple Processes and Special Cases { #containers-with-multiple-processes-and-special-cases }
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 29.5K bytes - Viewed (1) -
guava/src/com/google/common/graph/Network.java
* * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. * * <p>There are three primary interfaces provided to represent graphs. In order of increasing * complexity they are: {@link Graph}, {@link ValueGraph}, and {@link Network}. You should generally * prefer the simplest interface that satisfies your use case. See the <a
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/collect/RegularImmutableMap.java
*/ private final transient @Nullable Object hashTable; @VisibleForTesting final transient @Nullable Object[] alternatingKeysAndValues; private final transient int size; /* * We have some considerable complexity in these create methods because of * Builder.buildKeepingLast(). The same Builder might be called with buildKeepingLast() and then * buildOrThrow(), or vice versa. So in particular, if we modify alternatingKeysAndValues to
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 22.5K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/Cache.kt
} if (requestMethod != "GET" && requestMethod != "QUERY") { // Don't cache non-GET and non-QUERY responses. We're technically allowed to cache HEAD // requests and some POST requests, but the complexity of doing so is high and the benefit // is low. return null } if (response.hasVaryAll()) { return null } val entry = Entry(response)
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Sat Aug 16 09:39:51 UTC 2025 - 26.9K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/Smb2EncryptionContextTest.java
testEncryptionKey, testEncryptionKey); int threadCount = 5; // Reduced complexity int operationsPerThread = 10; ExecutorService executor = Executors.newFixedThreadPool(threadCount); CountDownLatch startLatch = new CountDownLatch(1);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 44.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* its capacity threshold. * * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit * rate, and ability to be implemented with O(1) time complexity. The initial LRU implementation * operates per-segment rather than globally for increased implementation simplicity. We expect * the cache hit rate to be similar to that of a global LRU algorithm. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 90K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/entity/DataStoreParamsTest.java
Map<String, String> complexObject = new HashMap<>(); complexObject.put("nested", "value"); dataStoreParams.put("complexKey", complexObject); assertEquals(complexObject, dataStoreParams.get("complexKey")); String asString = dataStoreParams.getAsString("complexKey"); assertNotNull(asString); assertTrue(asString.contains("nested")); } // Test overwriting existing values
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Tue Aug 19 14:09:36 UTC 2025 - 10.5K bytes - Viewed (0) -
RELEASE.md
* Reduce `tfp.layers` boilerplate via programmable docstrings. * Add `auc_with_confidence_intervals`, a method for computing the AUC and confidence interval with linearithmic time complexity. * `regression_head` now accepts customized link function, to satisfy the usage that user can define their own link function if the `array_ops.identity` does not meet the requirement.
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Aug 18 20:54:38 UTC 2025 - 740K bytes - Viewed (2)