- Sort Score
- Num 10 results
- Language All
Results 81 - 90 of 105 for Year (0.03 seconds)
-
.teamcity/subprojects.json
"path": "platforms/documentation/docs-asciidoctor-extensions-base", "unitTests": true, "functionalTests": false, "crossVersionTests": false }, { "name": "ear", "path": "platforms/jvm/ear", "unitTests": true, "functionalTests": true, "crossVersionTests": false }, { "name": "encryption-services", "path": "platforms/core-configuration/encryption-services",
Created: Wed Dec 31 11:36:14 GMT 2025 - Last Modified: Thu Dec 18 18:40:11 GMT 2025 - 37.5K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/SortedLists.java
* key, the choice of {@link KeyAbsentBehavior} decides which index is returned. * * <p>This method runs in log(n) time on random-access lists, which offer near-constant-time * access to each list element. * * @param list the list to be searched. * @param key the value to be searched for. * @param comparator the comparator by which the list is ordered.Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 10.9K bytes - Click Count (0) -
guava/src/com/google/common/collect/SortedLists.java
* key, the choice of {@link KeyAbsentBehavior} decides which index is returned. * * <p>This method runs in log(n) time on random-access lists, which offer near-constant-time * access to each list element. * * @param list the list to be searched. * @param key the value to be searched for. * @param comparator the comparator by which the list is ordered.Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 10.9K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.31.md
## Changelog since v1.31.0 ## Changes by Kind ### Deprecation
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Nov 12 11:33:21 GMT 2025 - 451.9K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.20.md
PID Limits features are now generally available on both `SupportNodePidsLimit` (node-to-pod PID isolation) and `SupportPodPidsLimit` (ability to limit PIDs per pod), after being enabled-by-default in beta stage for a year. ### API Priority and Fairness graduates to Beta
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Jan 19 21:05:45 GMT 2022 - 409K bytes - Click Count (0) -
android/guava/src/com/google/common/base/Optional.java
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Jun 04 13:03:16 GMT 2025 - 15.4K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/ws/RealWebSocket.kt
return -1L } } companion object { private val ONLY_HTTP1 = listOf(Protocol.HTTP_1_1) /** * The maximum number of bytes to enqueue. Rather than enqueueing beyond this limit we tear down * the web socket! It's possible that we're writing faster than the peer can read. */ private const val MAX_QUEUE_SIZE = 16L * 1024 * 1024 // 16 MiB. /**Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Thu Jul 31 04:18:40 GMT 2025 - 21.6K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Http2Stream.kt
/** * The reason why this stream was closed, or null if it closed normally or has not yet been * closed. * * If there are multiple reasons to abnormally close this stream (such as both peers closing it * near-simultaneously) then this is the first reason known to this peer. */ internal var errorCode: ErrorCode? = null get() = withLock { field }
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Mon Jul 07 18:57:05 GMT 2025 - 22.4K bytes - Click Count (0) -
guava/src/com/google/common/math/BigIntegerMath.java
* * <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754 * default rounding mode: if the two nearest representable values are equally near, the one with * the least significant bit zero is chosen. (In such cases, both of the nearest representable * values are even integers; this method returns the one that is a multiple of a greater power of * two.) *Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 18.8K bytes - Click Count (0) -
guava/src/com/google/common/math/LongMath.java
* technique previously used by BigIntegerMath: maintain separate numerator and * denominator accumulators, multiplying the fraction into result when near overflow. */ for (int i = 2; i <= k; i++, n--) { if (numeratorBits + nBits < Long.SIZE - 1) { // It's definitely safe to multiply into numerator and denominator.Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Nov 03 21:01:09 GMT 2025 - 46.8K bytes - Click Count (0)