- Sort Score
- Num 10 results
- Language All
Results 231 - 240 of 334 for randomOp (0.05 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
cmd/perf-tests.go
} func (n *netPerfRX) Reset() { n.Lock() defer n.Unlock() n.RX = 0 n.RXSample = 0 n.lastToConnect = time.Time{} n.firstToDisconnect = time.Time{} } // Reader to read random data. type netperfReader struct { n uint64 eof chan struct{} buf []byte } func (m *netperfReader) Read(b []byte) (int, error) { select { case <-m.eof: return 0, io.EOF default:
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 11.8K bytes - Click Count (0) -
cmd/object-api-utils.go
if w == 0 { return true } return false } // mustGetUUID - get a random UUID. func mustGetUUID() string { u, err := uuid.NewRandom() if err != nil { logger.CriticalIf(GlobalContext, err) } return u.String() } // mustGetUUIDBytes - get a random UUID as 16 bytes unencoded. func mustGetUUIDBytes() []byte { u, err := uuid.NewRandom() if err != nil {Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Wed Jun 25 15:08:54 GMT 2025 - 37.3K bytes - Click Count (0) -
guava/src/com/google/common/collect/ImmutableSet.java
* * <p>Note that for a RegularImmutableSet with elements with truly random hash codes, contains * operations take expected O(1) time but with high probability take O(log n) for at least some * element. (https://en.wikipedia.org/wiki/Linear_probing#Analysis) * * <p>This method may return {@code true} even on truly random input, but {@code * ImmutableSetTest} tests that the probability of that is low.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Nov 07 16:09:47 GMT 2025 - 35.3K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.7.md
* Detach the volume when pod is terminated ([#45286](https://github.com/kubernetes/kubernetes/pull/45286), [@gnufied](https://github.com/gnufied)) * CRI: Fix StopContainer timeout ([#44970](https://github.com/kubernetes/kubernetes/pull/44970), [@Random-Liu](https://github.com/Random-Liu))
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Thu May 05 13:44:43 GMT 2022 - 308.7K bytes - Click Count (1) -
okhttp-tls/src/main/kotlin/okhttp3/tls/HeldCertificate.kt
* Set this certificate's common name (CN). Historically this held the hostname of TLS * certificate, but that practice was deprecated by [RFC 2818][rfc_2818] and replaced with * [addSubjectAlternativeName]. If unset a random string will be used. * * [rfc_2818]: https://tools.ietf.org/html/rfc2818 */ fun commonName(cn: String) = apply { this.commonName = cn }
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Jan 27 09:00:39 GMT 2026 - 21.6K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/OkHttpClient.kt
listener: WebSocketListener, ): WebSocket { val webSocket = RealWebSocket( taskRunner = taskRunner, originalRequest = request, listener = listener, random = Random(), pingIntervalMillis = pingIntervalMillis.toLong(), // extensions is always null for clients: extensions = null, minimumDeflateSize = minWebSocketMessageToCompress,Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Feb 03 22:17:59 GMT 2026 - 51.5K bytes - Click Count (0) -
docs/ja/docs/tutorial/query-params-str-validations.md
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 14:07:17 GMT 2026 - 20.3K bytes - Click Count (0) -
internal/s3select/message.go
payloadLength := messageLength - 4 - 4 - 4 - headerLength - 4 return payloadLength } // continuationMessage - S3 periodically sends this message to keep the TCP connection open. // These messages appear in responses at random. The client must detect the message type and process accordingly. // // Header specification: // Continuation messages contain two headers, as follows:
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Feb 18 16:25:55 GMT 2025 - 15.3K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* token attempt, one measure of the quality of a hash function is <i>how well</i> it succeeds * at this goal. Important note: it may be easy to achieve the theoretical minimum collision * rate when using completely <i>random</i> sample input. The true test of a hash function is * how it performs on representative real-world data, which tends to contain many hidden
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
docs/en/docs/_llm-test.md
The tests: ## Code snippets { #code-snippets } //// tab | TestCreated: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 11K bytes - Click Count (0)