- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 180 for Odd (0.08 sec)
-
src/maps/example_test.go
} func ExampleDeleteFunc() { m := map[string]int{ "one": 1, "two": 2, "three": 3, "four": 4, } maps.DeleteFunc(m, func(k string, v int) bool { return v%2 != 0 // delete odd values }) fmt.Println(m) // Output: // map[four:4 two:2] } func ExampleEqual() { m1 := map[int]string{ 1: "one", 10: "Ten", 1000: "THOUSAND", } m2 := map[int]string{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 11 20:21:56 UTC 2023 - 2.2K bytes - Viewed (0) -
src/strconv/ftoaryu.go
extra := uint(-dexp2) extraMask := uint32(1<<extra - 1) di, dfrac := di>>extra, di&extraMask roundUp := false if exact { // If we computed an exact product, d + 1/2 // should round to d+1 if 'd' is odd. roundUp = dfrac > 1<<(extra-1) || (dfrac == 1<<(extra-1) && !d0) || (dfrac == 1<<(extra-1) && d0 && di&1 == 1) } else { // otherwise, d+1/2 always rounds up because // we truncated below.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 00:28:56 UTC 2022 - 15.7K bytes - Viewed (0) -
docs/distributed/DESIGN.md
drives we get a total of 128 possible sets, with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total. - *If total number of nodes are of odd number then GCD algorithm provides affinity towards odd number erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives are pariticipating in any erasure set. For example if you have 2 nodes with 180 drives then GCD is 15 but...
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Aug 15 23:04:20 UTC 2023 - 8K bytes - Viewed (0) -
src/crypto/rand/util.go
if b >= 2 { bytes[0] |= 3 << (b - 2) } else { // Here b==1, because b cannot be zero. bytes[0] |= 1 if len(bytes) > 1 { bytes[1] |= 0x80 } } // Make the value odd since an even number this large certainly isn't prime. bytes[len(bytes)-1] |= 1 p.SetBytes(bytes) if p.ProbablyPrime(20) { return p, nil } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 17:09:47 UTC 2023 - 2.4K bytes - Viewed (0) -
src/math/big/int.go
} } // ModSqrt sets z to a square root of x mod p if such a square root exists, and // returns z. The modulus p must be an odd prime. If x is not a square mod p, // ModSqrt leaves z unchanged and returns nil. This function panics if p is // not an odd integer, its behavior is undefined if p is odd but not prime. func (z *Int) ModSqrt(x, p *Int) *Int { switch Jacobi(x, p) { case -1: return nil // x is not a square mod p
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 33.1K bytes - Viewed (0) -
test/codegen/arithmetic.go
// 386:"IMUL3L\t[$]678152731",-"ROLL",-"DIVQ" // arm64:"MOVD\t[$]-8737931403336103397","MUL",-"ROR",-"DIV" // arm:"MUL","CMP\t[$]226050910",-".*udiv" // ppc64x:"MULLD",-"ROTL" odd := n%19 == 0 return even, odd } func Divisible(n int) (bool, bool) { // amd64:"IMULQ","ADD","ROLQ\t[$]63",-"DIVQ" // 386:"IMUL3L\t[$]-1431655765","ADDL\t[$]715827882","ROLL\t[$]31",-"DIVQ"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 15:28:00 UTC 2024 - 15.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/UncheckedThrowingFuture.java
* not wrapped in {@code ExecutionException}. For just a normal failure, use {@link * SettableFuture}). * * <p>Useful for testing the behavior of Future utilities against odd futures. * * @author Anthony Zana */ @GwtCompatible final class UncheckedThrowingFuture<V> extends AbstractFuture<V> { public static <V> ListenableFuture<V> throwingError(Error error) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 12 20:02:10 UTC 2018 - 3.2K bytes - Viewed (0) -
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) -
pkg/envoy/proxy_test.go
} } func TestSplitComponentLog(t *testing.T) { cases := []struct { input string log string components []string }{ {"info", "info", nil}, // A bit odd, but istio logging behaves this way so might as well be consistent {"info,warn", "warn", nil}, {"info,misc:warn", "info", []string{"misc:warn"}}, {"misc:warn,info", "info", []string{"misc:warn"}},
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu May 09 11:45:51 UTC 2024 - 3.2K bytes - Viewed (0) -
src/crypto/internal/nistec/p224_sqrt.go
// The constant-time implementation is adapted from Thomas Pornin's ecGFp5. // // https://github.com/pornin/ecgfp5/blob/82325b965/rust/src/field.rs#L337-L385 // p = q*2^n + 1 with q odd -> q = 2^128 - 1 and n = 96 // g^(2^n) = 1 -> g = 11 ^ q (where 11 is the smallest non-square) // GG[j] = g^(2^j) for j = 0 to n-1 p224GGOnce.Do(func() { p224GG = new([96]fiat.P224Element) for i := range p224GG {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 3.1K bytes - Viewed (1)