- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 36 for wmin (0.59 sec)
-
pkg/proxy/metrics/metrics.go
metrics.LinearBuckets(1, 1, 59), // 1s, 2s, 3s, ... 59s metrics.LinearBuckets(60, 5, 12), // 60s, 65s, 70s, ... 115s metrics.LinearBuckets(120, 30, 7), // 2min, 2.5min, 3min, ..., 5min ), StabilityLevel: metrics.ALPHA, }, ) // EndpointChangesPending is the number of pending endpoint changes that // have not yet been synced to the proxy.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 21 14:39:54 UTC 2024 - 13.7K bytes - Viewed (0) -
docs/metrics/prometheus/list.md
| `minio_node_cpu_avg_load5` | CPU load average 5min. | | `minio_node_cpu_avg_load5_avg` | CPU load average 5min (avg). | | `minio_node_cpu_avg_load5_max` | CPU load average 5min (max). | | `minio_node_cpu_avg_load5_perc` | CPU load average 5min (percentage). |
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jun 13 22:26:54 UTC 2024 - 43.3K bytes - Viewed (0) -
cmd/metrics-resource.go
cpuSteal: "CPU steal time", cpuNice: "CPU nice time", cpuLoad1: "CPU load average 1min", cpuLoad5: "CPU load average 5min", cpuLoad15: "CPU load average 15min", cpuLoad1Perc: "CPU load average 1min (perentage)", cpuLoad5Perc: "CPU load average 5min (percentage)", cpuLoad15Perc: "CPU load average 15min (percentage)", } resourceMetricsGroups = []*MetricsGroupV2{
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 17 15:15:13 UTC 2024 - 17.2K bytes - Viewed (0) -
src/math/big/float.go
// become normal. Check again. if e < emin { // denormal number: recompute precision // Since rounding may have at best increased precision // and we have eliminated p <= 0 early, we know p > 0. // bexp == 0 for denormals p = mbits + 1 - emin + int(e) mant = msb32(r.mant) >> uint(fbits-p) } else { // normal number: emin <= e <= emax bexp = uint32(e+bias) << mbits
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 15:46:54 UTC 2024 - 44.5K bytes - Viewed (0) -
src/math/big/rat.go
mantissa >>= 1 exp++ } if mantissa>>Msize1 != 1 { panic(fmt.Sprintf("expected exactly %d bits of result", Msize2)) } // 4. Rounding. if Emin-Msize <= exp && exp <= Emin { // Denormal case; lose 'shift' bits of precision. shift := uint(Emin - (exp - 1)) // [1..Esize1) lostbits := mantissa & (1<<shift - 1) haveRem = haveRem || lostbits != 0 mantissa >>= shift exp = 2 - Ebias // == exp + shift }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 13.5K bytes - Viewed (0) -
src/cmd/vendor/github.com/ianlancetaylor/demangle/rust.go
firstTime := oldI == 0 if firstTime { delta /= damp } else { delta /= 2 } delta += delta / numPoints k := 0 for delta > ((base-tmin)*tmax)/2 { delta /= base - tmin k += base } bias = k + ((base-tmin+1)*delta)/(delta+skew) n += i / (len(output) + 1) if n > utf8.MaxRune { rst.fail("punycode rune overflow") } else if !utf8.ValidRune(rune(n)) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 15 16:39:48 UTC 2023 - 23.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/python/tf_tfl_flatbuffer_helpers.cc
// Only qint8 and quint8 are considered here. double qmin, qmax; if (type == DT_QUINT8) { qmin = 0.0; qmax = 255.0; } else if (type == DT_QINT8) { qmin = -128.0; qmax = 127.0; } else { return absl::InvalidArgumentError("Only int8 and uint8 are considered."); } return std::make_pair((qmin - mean) / std, (qmax - mean) / std); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sun May 12 12:39:37 UTC 2024 - 17.3K bytes - Viewed (0) -
pkg/ctrlz/assets/static/js/clipboard-1.7.1.min.js
zirain <******@****.***> 1684861711 +0800
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 23 17:08:31 UTC 2023 - 10.7K bytes - Viewed (0) -
pkg/ctrlz/assets/static/js/bootstrap-4.0.0.min.js
//# sourceMappingURL=bootstrap.min.js.map...
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 23 17:08:31 UTC 2023 - 47.8K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/intervals.go
// TEMPORARY until bootstrap version catches up. func imin(i, j int) int { if i < j { return i } return j } // TEMPORARY until bootstrap version catches up. func imax(i, j int) int { if i > j { return i } return j } // Overlaps returns true if here is any overlap between i and i2. func (i Interval) Overlaps(i2 Interval) bool { return (imin(i.en, i2.en) - imax(i.st, i2.st)) > 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 21:55:27 UTC 2024 - 10K bytes - Viewed (0)