- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 180 for Odd (0.03 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/internal/bytealg/index_s390x.s
VREPH $0, V0, V1 CMPBGE R9, R2, index2to16 index2loop: VL 0(R7), V2 // 16 bytes, even indices VL 1(R7), V4 // 16 bytes, odd indices VCEQH V1, V2, V5 // compare even indices VCEQH V1, V4, V6 // compare odd indices VSEL V5, V6, V31, V7 // merge even and odd indices VFEEBS V16, V7, V17 // find leftmost index, set condition to 1 if found BLT foundV17 MOVD $16(R7), R7 // R7+=16
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Mar 04 19:49:44 UTC 2018 - 5.5K 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) -
test/fixedbugs/issue19137.go
// Issue 19137: folding address into load/store causes // odd offset on ARM64. package p type T struct { p *int a [2]byte b [6]byte // not 4-byte aligned } func f(b [6]byte) T { var x [1000]int // a large stack frame _ = x return T{b: b} } // Arg symbol's base address may be not at an aligned offset to // SP. Folding arg's address into load/store may cause odd offset. func move(a, b [20]byte) [20]byte {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 05 22:28:17 UTC 2017 - 1.1K bytes - Viewed (0) -
test/chan/sieve2.go
// Generate primes up to 100 using channels, checking the results. // This sieve is Eratosthenesque and only considers odd candidates. // See discussion at <http://blog.onideas.ws/eratosthenes.go>. package main import ( "container/heap" "container/ring" ) // Return a chan of odd numbers, starting from 5. func odds() chan int { out := make(chan int, 50) go func() { n := 5 for { out <- n
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Feb 19 06:44:02 UTC 2012 - 3.9K bytes - Viewed (0)