- Sort Score
- Num 10 results
- Language All
Results 671 - 680 of 690 for Date (0.05 seconds)
-
cmd/metrics-v2.go
Help: "Average replication transfer rate in bytes/sec", Type: gaugeMetric, } } func getClusterReplMaxTransferRateMD() MetricDescription { return MetricDescription{ Namespace: nodeMetricNamespace, Subsystem: replicationSubsystem, Name: maxTransferRate, Help: "Maximum replication transfer rate in bytes/sec seen since server uptime", Type: gaugeMetric,
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 133.6K bytes - Click Count (0) -
cmd/utils.go
return nil, err } defer RemoveAll(dirPath) return ioutilx.ReadFile(fn) } case madmin.ProfilerCPUIO: // at 10k or more goroutines fgprof is likely to become // unable to maintain its sampling rate and to significantly // degrade the performance of your application // https://github.com/felixge/fgprof#fgprof if n := runtime.NumGoroutine(); n > 10000 && !globalIsCICD {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 33K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
* * <p>See http://en.wikipedia.org/wiki/Bloom_filter#Probability_of_false_positives for the * formula. * * @param n expected insertions (must be positive) * @param p false positive rate (must be 0 < p < 1) */ @VisibleForTesting static long optimalNumOfBits(long n, double p) { if (p == 0) { p = Double.MIN_VALUE; } return (long) (-n * Math.log(p) / SQUARED_LOG_TWO);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 10 22:28:12 GMT 2026 - 27.6K bytes - Click Count (0) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
* * 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. */ // Constants /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 89.9K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.3.md
* vSphere Volume Plugin Implementation ([#24947](https://github.com/kubernetes/kubernetes/pull/24947), [@abithap](https://github.com/abithap)) * ResourceQuota controller uses rate limiter to prevent hot-loops in error situations ([#25748](https://github.com/kubernetes/kubernetes/pull/25748), [@derekwaynecarr](https://github.com/derekwaynecarr))
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Thu Dec 24 02:28:26 GMT 2020 - 84K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* * 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. */ // Constants /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 89.9K bytes - Click Count (0) -
docs/bucket/notifications/README.md
``` MinIO server also supports [NATS Streaming mode](http://nats.io/documentation/streaming/nats-streaming-intro/) that offers additional functionality like `At-least-once-delivery`, and `Publisher rate limiting`. To configure MinIO server to send notifications to NATS Streaming server, update the MinIO server configuration file as follows:
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 84.2K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
&d.a, out, buf) } else { // We have "buffered" output still to copy. if d.n < d.rate { x := copy(out, d.a[d.n:d.rate]) d.n += x out = out[x:] } if len(out) == 0 { return } klmd(d.function()|nopad, &d.a, out, nil) } if len(out)%d.rate == 0 { // The final permutation was not performed, // so there is no "buffered" output. d.n = d.rate } else { d.n = len(out) % d.rate } return } func (d *Digest) function() code { switch d.rate { case rateK256: return shake_128 case rateK448: return sha3_224 case rateK512:...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
docs/pt/docs/deployment/docker.md
Uvicorn executando seu aplicativo FastAPI). Todos seriam **contêineres idênticos**, executando a mesma coisa, mas cada um com seu próprio processo, memória, etc. Dessa forma, você aproveitaria a **paralelização** em **núcleos diferentes** da CPU, ou até mesmo em **máquinas diferentes**. E o sistema de contêiner com o **balanceador de carga** iria **distribuir as solicitações** para cada um dos contêineres com seu aplicativo **em turnos**. Portanto, cada solicitação poderia ser tratada por...
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:20:43 GMT 2026 - 30.9K bytes - Click Count (0) -
fess-crawler-lasta/src/main/resources/crawler/extractor.xml
"application/ocsp-request", "application/ocsp-response", "application/octet-stream", "application/oda", "application/oebps-package+xml", "application/ogg", "application/kate", "application/onenote", "application/parityfec", "application/patch-ops-error+xml", "application/pgp-encrypted", "application/pgp-keys", "application/pgp-signature",
Created: Sun Apr 12 03:50:13 GMT 2026 - Last Modified: Wed Feb 11 01:15:55 GMT 2026 - 50.4K bytes - Click Count (0)