- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 150 for Odd (0.02 sec)
-
src/cmd/go/testdata/vcstest/git/odd-tags.txt
cce3d0f5d2ec85678cca3c45ac4a87f3be5efaca refs/tags/v3.0.0-20220223184802-12d19af20458 -- README.txt -- This module lacks a go.mod file. -- go.mod -- module vcs-test.golang.org/git/odd-tags.git go 1.18 -- v3/go.mod -- module vcs-test.golang.org/git/odd-tags.git/v3
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 25 15:36:24 UTC 2022 - 1.2K bytes - Viewed (0) -
src/cmd/go/testdata/script/mod_list_odd_tags.txt
[short] skip [!git] skip env GOPROXY=direct go list -m vcs-test.golang.org/git/odd-tags.git@latest stdout -count=1 '^.' stdout '^vcs-test.golang.org/git/odd-tags.git v0.1.1-0.20220223184835-9d863d525bbf$' go list -m -versions vcs-test.golang.org/git/odd-tags.git stdout -count=1 '^.'
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 24 15:54:04 UTC 2023 - 392 bytes - Viewed (0) -
maven-embedder/src/test/java/org/apache/maven/cli/CLIManagerDocumentationTest.java
StringBuilder sb = new StringBuilder(512); boolean odd = true; sb.append( "<table border='1' class='zebra-striped'><tr class='a'><th><b>Options</b></th><th><b>Description</b></th></tr>"); for (Option option : new CLIManagerExtension().getOptions()) { odd = !odd; sb.append("<tr class='"); sb.append(odd ? 'a' : 'b'); sb.append("'>");
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Tue Jun 11 09:06:12 UTC 2024 - 4K bytes - Viewed (0) -
src/math/pow_s390x.s
BNE negZeroOddInt // y is an odd integer and y < 0 BR zeroNotOdd // y is not an (odd) integer and y < 0 negZeroGtZero: // special case Pow(-0, y) = -0 for y an odd integer > 0 // special case Pow(±0, y) = +0 for finite y > 0 and not an odd integer FIDBR $5, F2, F4 //F2 translate to integer F4 FCMPU F2, F4 BNE zeroNotOddGtZero // y is not an (odd) integer and y > 0 FMOVD $(2.0), F4
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 14 00:03:57 UTC 2023 - 16.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/magic.go
// // To extend this to even integers, consider c = d0 * 2^k where d0 is odd. // We can test whether x is divisible by both d0 and 2^k. // For d0, the test is the same as above. Let m be such that m*d0 mod 2^n == 1 // Then x*m mod 2^n <= ⎣(2^n - 1)/d0⎦ is the first test. // The test for divisibility by 2^k is a check for k trailing zeroes. // Note that since d0 is odd, m is odd and thus x*m will have the same number of
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:25 UTC 2024 - 15.8K bytes - Viewed (0) -
src/math/pow.go
// Pow(x, 1) = x for any x // Pow(NaN, y) = NaN // Pow(x, NaN) = NaN // Pow(±0, y) = ±Inf for y an odd integer < 0 // Pow(±0, -Inf) = +Inf // Pow(±0, +Inf) = +0 // Pow(±0, y) = +Inf for finite y < 0 and not an odd integer // Pow(±0, y) = ±0 for y an odd integer > 0 // Pow(±0, y) = +0 for finite y > 0 and not an odd integer // Pow(-1, ±Inf) = 1 // Pow(x, +Inf) = +Inf for |x| > 1 // Pow(x, -Inf) = +0 for |x| > 1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 24 19:10:58 UTC 2023 - 3.6K bytes - Viewed (0) -
src/math/floor.go
func RoundToEven(x float64) float64 { // RoundToEven is a faster implementation of: // // func RoundToEven(x float64) float64 { // t := math.Trunc(x) // odd := math.Remainder(t, 2) != 0 // if d := math.Abs(x - t); d > 0.5 || (d == 0.5 && odd) { // return t + math.Copysign(1, x) // } // return t // } bits := Float64bits(x) e := uint(bits>>shift) & mask if e >= bias {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 3.3K bytes - Viewed (0) -
src/math/big/sqrt.go
// the MantExp call. prec := z.prec b := x.MantExp(z) z.prec = prec // Compute √(z·2**b) as // √( z)·2**(½b) if b is even // √(2z)·2**(⌊½b⌋) if b > 0 is odd // √(½z)·2**(⌈½b⌉) if b < 0 is odd switch b % 2 { case 0: // nothing to do case 1: z.exp++ case -1: z.exp-- } // 0.25 <= z < 2.0 // Solving 1/x² - z = 0 avoids Quo calls and is faster, especially
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 2.8K bytes - Viewed (0) -
src/crypto/internal/edwards25519/scalarmult.go
func (v *Point) ScalarBaseMult(x *Scalar) *Point { basepointTable := basepointTable() // Write x = sum(x_i * 16^i) so x*B = sum( B*x_i*16^i ) // as described in the Ed25519 paper // // Group even and odd coefficients // x*B = x_0*16^0*B + x_2*16^2*B + ... + x_62*16^62*B // + x_1*16^1*B + x_3*16^3*B + ... + x_63*16^63*B // x*B = x_0*16^0*B + x_2*16^2*B + ... + x_62*16^62*B
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 05 21:53:10 UTC 2022 - 6.3K bytes - Viewed (0) -
test/fixedbugs/issue67160.go
// unaligned loads. package main // T has a big field that wants to be compared with larger loads/stores. // T is "special" because of the unnamed field, so it needs a generated equality function. // T is an odd number of bytes in size and has alignment 1. type T struct { src [8]byte _ byte } // U contains 8 copies of T, each at a different %8 alignment. type U [8]T //go:noinline func f(x, y *U) bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 15:34:04 UTC 2024 - 767 bytes - Viewed (0)