- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 489 for rounds (0.28 sec)
-
okhttp/src/main/kotlin/okhttp3/internal/concurrent/TaskLogger.kt
queue: TaskQueue, message: String, ) { fine("${queue.name} ${String.format("%-22s", message)}: ${task.name}") } /** * Returns a duration in the nearest whole-number units like "999 µs" or " 1 s ". This rounds 0.5 * units away from 0 and 0.499 towards 0. The smallest unit this returns is "µs"; the largest unit * it returns is "s". For values in [-499..499] this returns " 0 µs". *
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 2.6K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/queueset/doc.go
// implementation outline, the notation now() is used to mean reading // the virtual clock. In the original paper’s terms, "R(t)" is the // number of "rounds" that have been completed at real time t --- // where a round consists of virtually transmitting one bit from every // non-empty queue in the router (regardless of which queue holds the // packet that is really being transmitted at the moment); in this
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Feb 08 12:33:30 UTC 2024 - 6.1K bytes - Viewed (0) -
src/internal/chacha8rand/chacha8_amd64.s
// Copyright 2023 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. #include "textflag.h" // ChaCha8 is ChaCha with 8 rounds. // See https://cr.yp.to/chacha/chacha-20080128.pdf. // See chacha8_generic.go for additional details. // ROL rotates the uint32s in register R left by N bits, using temporary T. #define ROL(N, R, T) \
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:34:30 UTC 2023 - 4.6K bytes - Viewed (0) -
src/internal/fuzz/coverage.go
if len(base) != len(snapshot) { panic(fmt.Sprintf("the number of coverage bits changed: before=%d, after=%d", len(base), len(snapshot))) } found := false for i := range snapshot { if snapshot[i]&^base[i] != 0 { found = true break } } if !found { return nil } diff := make([]byte, len(snapshot)) for i := range diff { diff[i] = snapshot[i] &^ base[i] } return diff }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 18:23:49 UTC 2024 - 2.5K bytes - Viewed (0) -
src/go/types/named_test.go
T.AddMethod(m) } // check method order if i == 0 { // first round: collect methods in given order methods = make([]string, T.NumMethods()) for j := range methods { methods[j] = T.Method(j).Name() } } else { // successive rounds: methods must appear in the same order if got := T.NumMethods(); got != len(methods) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 05 16:29:58 UTC 2024 - 3.9K bytes - Viewed (0) -
src/cmd/compile/internal/types2/named_test.go
T.AddMethod(m) } // check method order if i == 0 { // first round: collect methods in given order methods = make([]string, T.NumMethods()) for j := range methods { methods[j] = T.Method(j).Name() } } else { // successive rounds: methods must appear in the same order if got := T.NumMethods(); got != len(methods) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 16 21:06:56 UTC 2024 - 3.6K bytes - Viewed (0) -
src/crypto/internal/mlkem768/mlkem768_test.go
// FloatString rounds halves away from 0, and our result should always be positive, // so it should work as we expect. (There's no direct way to round a Rat.) rounded, err := strconv.ParseInt(precise.FloatString(0), 10, 64) if err != nil { panic(err) } // If we rounded up, `rounded` may be equal to 2ᵈ, so we perform a final reduction. return uint16(rounded % (1 << d)) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 15:27:18 UTC 2024 - 10.3K 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) -
android/guava/src/com/google/common/math/ToDoubleRounder.java
/** * Returns x rounded to either the greatest double less than or equal to the precise value of x, * or the least double greater than or equal to the precise value of x. */ abstract double roundToDoubleArbitrarily(X x); /** Returns the sign of x: either -1, 0, or 1. */ abstract int sign(X x); /** Returns d's value as an X, rounded with the specified mode. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 5.8K bytes - Viewed (0) -
test/linkobj.go
if err != nil { fatalf("listing stdlib export files: %v", err) } // two rounds: once using normal objects, again using .a files (compile -pack). for round := 0; round < 2; round++ { pkg := "-pack=" + fmt.Sprint(round) // The compiler expects the files being read to have the right suffix. o := "o" if round == 1 { o = "a" }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 3.5K bytes - Viewed (0)