- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 180 for Odd (0.26 sec)
-
android/guava/src/com/google/common/math/DoubleUtils.java
* We round up if either the fractional part of signif is strictly greater than 0.5 (which is * true if the 0.5 bit is set and any lower bit is set), or if the fractional part of signif is * >= 0.5 and signifFloor is odd (which is true if both the 0.5 bit and the 1 bit are set). */ boolean increment = (twiceSignifFloor & 1) != 0 && ((signifFloor & 1) != 0 || absX.getLowestSetBit() < shift);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 28 15:37:52 UTC 2021 - 5.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
int bTwos = Integer.numberOfTrailingZeros(b); b >>= bTwos; // divide out all 2s while (a != b) { // both a, b are odd // The key to the binary GCD algorithm is as follows: // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 23.5K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_s390x.s
// // Example: // // We want to calculate the sum (h) for a 64 byte message (m): // // h = m[0:16]r⁴ + m[16:32]r³ + m[32:48]r² + m[48:64]r // // To do this we split the calculation into the even indices // and odd indices of the message. These form our SIMD 'lanes': // // h = m[ 0:16]r⁴ + m[32:48]r² + <- lane 0 // m[16:32]r³ + m[48:64]r <- lane 1 // // To calculate this iteratively we refactor so that both lanes
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 17.5K bytes - Viewed (0) -
src/unicode/letter.go
// The characters at even offsets from the beginning of the // sequence are upper case; the ones at odd offsets are lower. // The correct mapping can be done by clearing or setting the low // bit in the sequence offset. // The constants UpperCase and TitleCase are even while LowerCase // is odd so we take the low bit from _case. return rune(cr.Lo) + ((r-rune(cr.Lo))&^1 | rune(_case&1)), true }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 10K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/resources/org/gradle/api/internal/artifacts/ivyservice/ivyresolve/verification/report/uikit.min.css
.uk-table-striped tbody tr:nth-of-type(odd),.uk-card-secondary>:not([class*=uk-card-media]) .uk-table-striped>tr:nth-of-type(odd),.uk-light .uk-table-striped tbody tr:nth-of-type(odd),.uk-light .uk-table-striped>tr:nth-of-type(odd),.uk-offcanvas-bar .uk-table-striped tbody tr:nth-of-type(odd),.uk-offcanvas-bar .uk-table-striped>tr:nth-of-type(odd),.uk-overlay-primary .uk-table-striped tbody tr:nth-of-type(odd),.uk-overlay-primary .uk-table-striped>tr:nth-of-type(odd),.uk-section-primary:not(.uk-preserve-color)...
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 257.2K bytes - Viewed (0) -
src/syscall/mksyscall.pl
my $cmdline = "mksyscall.pl " . join(' ', @ARGV); my $errors = 0; my $_32bit = ""; my $plan9 = 0; my $darwin = 0; my $openbsd = 0; my $netbsd = 0; my $dragonfly = 0; my $arm = 0; # 64-bit value should use (even, odd)-pair my $libc = 0; my $tags = ""; # build tags my $newtags = ""; # new style build tags my $stdimports = 'import "unsafe"'; my $extraimports = ""; if($ARGV[0] eq "-b32") { $_32bit = "big-endian"; shift;
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 17:15:02 UTC 2024 - 10.3K bytes - Viewed (0) -
src/slices/slices_test.go
Reverse(even) if want := []int{9, 5, 1, 4, 1, 3}; !Equal(even, want) { t.Errorf("Reverse(even) = %v, want %v", even, want) } odd := []int{3, 1, 4, 1, 5, 9, 2} // len = 7 Reverse(odd) if want := []int{2, 9, 5, 1, 4, 1, 3}; !Equal(odd, want) { t.Errorf("Reverse(odd) = %v, want %v", odd, want) } words := strings.Fields("one two three") Reverse(words)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:06 UTC 2024 - 33.2K bytes - Viewed (0) -
src/math/sqrt.go
if exp == 0 { // subnormal x for ix&(1<<shift) == 0 { ix <<= 1 exp-- } exp++ } exp -= bias // unbias exponent ix &^= mask << shift ix |= 1 << shift if exp&1 == 1 { // odd exp, double x to make it even ix <<= 1 } exp >>= 1 // exp = exp/2, exponent of square root // generate sqrt(x) bit by bit ix <<= 1 var q, s uint64 // q = sqrt(x)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 15 17:07:57 UTC 2022 - 4.8K bytes - Viewed (0) -
src/strconv/makeisprint.go
// Same algorithm, either on uint16 or uint32 value. // First, find first i such that rang[i] >= x. // This is the index of either the start or end of a pair that might span x. // The start is even (rang[i&^1]) and the end is odd (rang[i|1]). // If we find x in a range, make sure x is not in exception list. if 0 <= r && r < 1<<16 { rr, rang, except := uint16(r), range16, except16 i, _ := slices.BinarySearch(rang, rr)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 11 18:56:17 UTC 2024 - 4.3K bytes - Viewed (0) -
src/encoding/hex/hex.go
dst = slices.Grow(dst, n) Encode(dst[len(dst):][:n], src) return dst[:len(dst)+n] } // ErrLength reports an attempt to decode an odd-length input // using [Decode] or [DecodeString]. // The stream-based Decoder returns [io.ErrUnexpectedEOF] instead of ErrLength. var ErrLength = errors.New("encoding/hex: odd length hex string") // InvalidByteError values describe errors resulting from an invalid byte in a hex string. type InvalidByteError byte
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 19:30:23 UTC 2024 - 9.5K bytes - Viewed (0)