- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 44 for quo (0.02 sec)
-
src/math/bits/example_math_test.go
n2 := []uint32{0, 3} // Divide them together. quo, rem := bits.Div32(n1[0], n1[1], n2[1]) nsum := []uint32{quo, rem} fmt.Printf("[%v %v] / %v = %v\n", n1[0], n1[1], n2[1], nsum) // First number is 2<<32 + 2147483648 n1 = []uint32{2, 0x80000000} // Second number is 0<<32 + 2147483648 n2 = []uint32{0, 0x80000000} // Divide them together. quo, rem = bits.Div32(n1[0], n1[1], n2[1]) nsum = []uint32{quo, rem}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 11 21:27:05 UTC 2021 - 6.3K bytes - Viewed (0) -
src/strconv/decimal.go
var n uint for r--; r >= 0; r-- { n += (uint(a.d[r]) - '0') << k quo := n / 10 rem := n - 10*quo w-- if w < len(a.d) { a.d[w] = byte(rem + '0') } else if rem != 0 { a.trunc = true } n = quo } // Put down extra digits. for n > 0 { quo := n / 10 rem := n - 10*quo w-- if w < len(a.d) { a.d[w] = byte(rem + '0') } else if rem != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Jul 15 19:41:25 UTC 2017 - 11K bytes - Viewed (0) -
src/path/filepath/path_windows.go
if path == "" { return []string{} } // Split path, respecting but preserving quotes. list := []string{} start := 0 quo := false for i := 0; i < len(path); i++ { switch c := path[i]; { case c == '"': quo = !quo case c == ListSeparator && !quo: list = append(list, path[start:i]) start = i + 1 } } list = append(list, path[start:]) // Remove quotes.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 23:07:50 UTC 2024 - 3K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/request/seat_seconds.go
} // String converts to a string. // This is suitable for large as well as small values. func (ss SeatSeconds) String() string { const div = SeatSeconds(ssScale) quo := ss / div rem := ss - quo*div return fmt.Sprintf("%d.%08dss", quo, rem) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 20 09:16:46 UTC 2023 - 2.1K bytes - Viewed (0) -
src/testing/testing_windows.go
queryPerformanceFrequency = windows.QueryPerformanceFrequency() } hi, lo := bits.Mul64(uint64(delta), uint64(time.Second)/uint64(time.Nanosecond)) quo, _ := bits.Div64(hi, lo, uint64(queryPerformanceFrequency)) return time.Duration(quo) } var queryPerformanceFrequency int64 // highPrecisionTimeSince returns duration since a. func highPrecisionTimeSince(a highPrecisionTime) time.Duration {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 22:55:25 UTC 2024 - 1.9K bytes - Viewed (0) -
src/go/types/token_test.go
import ( "go/token" "testing" ) var assignOps = map[token.Token]token.Token{ token.ADD_ASSIGN: token.ADD, token.SUB_ASSIGN: token.SUB, token.MUL_ASSIGN: token.MUL, token.QUO_ASSIGN: token.QUO, token.REM_ASSIGN: token.REM, token.AND_ASSIGN: token.AND, token.OR_ASSIGN: token.OR, token.XOR_ASSIGN: token.XOR, token.SHL_ASSIGN: token.SHL, token.SHR_ASSIGN: token.SHR,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 08 03:40:04 UTC 2015 - 1.2K bytes - Viewed (0) -
src/go/token/token.go
IDENT // main INT // 12345 FLOAT // 123.45 IMAG // 123.45i CHAR // 'a' STRING // "abc" literal_end operator_beg // Operators and delimiters ADD // + SUB // - MUL // * QUO // / REM // % AND // & OR // | XOR // ^ SHL // << SHR // >> AND_NOT // &^ ADD_ASSIGN // += SUB_ASSIGN // -= MUL_ASSIGN // *= QUO_ASSIGN // /=
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 6.4K bytes - Viewed (0) -
src/crypto/dsa/dsa_test.go
} one := new(big.Int) one.SetInt64(1) pm1 := new(big.Int).Sub(params.P, one) quo, rem := new(big.Int).DivMod(pm1, params.Q, new(big.Int)) if rem.Sign() != 0 { t.Errorf("%d: p-1 mod q != 0", int(sizes)) } x := new(big.Int).Exp(params.G, quo, params.P) if x.Cmp(one) == 0 { t.Errorf("%d: invalid generator", int(sizes)) } err = GenerateKey(&priv, rand.Reader)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 15 21:04:43 UTC 2019 - 4.7K bytes - Viewed (0) -
src/math/big/rat_test.go
arg = ratBinArg{test.prod, test.x, test.y} testRatBin(t, i, "Quo", (*Rat).Quo, arg) } if test.y != "0" { arg = ratBinArg{test.prod, test.y, test.x} testRatBin(t, i, "Quo symmetric", (*Rat).Quo, arg) } } } func TestIssue820(t *testing.T) { x := NewRat(3, 1) y := NewRat(2, 1) z := y.Quo(x, y) q := NewRat(3, 2) if z.Cmp(q) != 0 { t.Errorf("got %s want %s", z, q)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 07 00:15:59 UTC 2022 - 18.9K bytes - Viewed (0) -
test/64bit.go
if b.HasBit(i) { c = c.Plus(a.LeftShift(i)) } } return } func (a Uint64) DivMod(b Uint64) (quo, rem Uint64) { n := a.Len() - b.Len() if n >= 0 { b = b.LeftShift(uint(n)) for i := 0; i <= n; i++ { quo = quo.LeftShift(1) if b.Cmp(a) <= 0 { // b <= a quo.lo |= 1 a = a.Minus(b) } b = b.RightShift(1) } } rem = a return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 30 19:21:08 UTC 2013 - 24.8K bytes - Viewed (0)