- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 185 for ROUND (0.1 sec)
-
src/time/example_test.go
if err != nil { panic(err) } round := []time.Duration{ time.Nanosecond, time.Microsecond, time.Millisecond, time.Second, 2 * time.Second, time.Minute, 10 * time.Minute, time.Hour, } for _, r := range round { fmt.Printf("d.Round(%6s) = %s\n", r, d.Round(r).String()) } // Output: // d.Round( 1ns) = 1h15m30.918273645s // d.Round( 1µs) = 1h15m30.918274s
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 13 01:05:00 UTC 2024 - 22.4K bytes - Viewed (0) -
src/math/big/ftoa.go
prec = len(d.mant) } } else { // round appropriately switch fmt { case 'e', 'E': // one digit before and number of digits after decimal point d.round(1 + prec) case 'f': // number of digits before and after decimal point d.round(d.exp + prec) case 'g', 'G': if prec == 0 { prec = 1 } d.round(prec) } } // 3) read digits out and format
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 13.5K bytes - Viewed (0) -
cmd/metrics-resource.go
cpuUserVal := math.Round(ts.User/tot*100*100) / 100 updateResourceMetrics(cpuSubsystem, cpuUser, cpuUserVal, labels, false) cpuSystemVal := math.Round(ts.System/tot*100*100) / 100 updateResourceMetrics(cpuSubsystem, cpuSystem, cpuSystemVal, labels, false) cpuIdleVal := math.Round(ts.Idle/tot*100*100) / 100
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/strconv/ftoa.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:21:28 UTC 2024 - 13.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/tensorflow/passes/quantized_function_library.mlir
%clamp_min = "tf.Minimum"(%clamp_max, %i8_max) : (tensor<*xf32>, tensor<f32>) -> tensor<*xf32> %round = "tf.Round"(%clamp_min) : (tensor<*xf32>) -> tensor<*xf32> %cast = "tf.Cast"(%round) {Truncate = false} : (tensor<*xf32>) -> tensor<*xi8> func.return %cast : tensor<*xi8> } // Requantizes and applies quantized Relu by clipping.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Jan 08 01:16:10 UTC 2024 - 30.6K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/admission/plugin/webhook/mutating/dispatcher.go
return apierrors.NewInternalError(err) } t := time.Now() round := 0 if reinvokeCtx.IsReinvoke() { round = 1 } annotator := newWebhookAnnotator(versionedAttr, round, i, hook.Name, invocation.Webhook.GetConfigurationName()) changed, err := a.callAttrMutatingHook(ctx, hook, invocation, versionedAttr, annotator, o, round, i)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 28 08:48:22 UTC 2024 - 19.6K bytes - Viewed (0) -
platforms/software/dependency-management/src/integTest/groovy/org/gradle/integtests/internal/component/ResolutionFailureHandlerIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue May 28 15:55:38 UTC 2024 - 45K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/keccakf.go
// in the keccak reference code. var t, bc0, bc1, bc2, bc3, bc4, d0, d1, d2, d3, d4 uint64 for i := 0; i < 24; i += 4 { // Combines the 5 steps in each round into 2 steps. // Unrolls 4 rounds per loop and spreads some steps across rounds. // Round 1 bc0 = a[0] ^ a[5] ^ a[10] ^ a[15] ^ a[20] bc1 = a[1] ^ a[6] ^ a[11] ^ a[16] ^ a[21] bc2 = a[2] ^ a[7] ^ a[12] ^ a[17] ^ a[22]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 10 16:37:53 UTC 2024 - 10.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/telemetry/internal/counter/file.go
if limit == 0 { // first record in file limit = m.hdrLen + hashOff + 4*numHash } n := round(uint32(16+len(name)), recordUnit) start = round(limit, recordUnit) // should already be rounded but just in case if start/pageSize != (start+n)/pageSize { // bump start to next page start = round(limit, pageSize) } return start, start + n } var memmap = mmap.Mmap var munmap = mmap.Munmap
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 18.2K bytes - Viewed (0) -
src/cmd/internal/obj/riscv/cpu.go
return "", fmt.Errorf("invalid suffix, require round mode bit:%x", u) } u &^= rmSuffixBit for k, v := range rmSuffixSet { if v == u { return k, nil } } return "", fmt.Errorf("unknown suffix:%x", u) } const ( RM_RNE uint8 = iota // Round to Nearest, ties to Even RM_RTZ // Round towards Zero RM_RDN // Round Down RM_RUP // Round Up
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 20 14:19:33 UTC 2024 - 13.1K bytes - Viewed (0)