- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for Gcd (0.02 sec)
-
src/cmd/go/testdata/script/cover_swig.txt
/* Compute the greatest common divisor of positive integers */ int gcd(int x, int y) { int g; g = y; while (x > 0) { g = x; x = y % x; y = g; } return g; } -- main.go -- package main import ( "fmt" ) func main() { // Call our gcd() function x := 42 y := 105 g := Gcd(x, y) fmt.Println("The gcd of", x, "and", y, "is", g)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 05 21:29:51 UTC 2024 - 1.1K bytes - Viewed (0) -
docs/distributed/DESIGN.md
1024 drives. In this scenario 16 becomes the erasure set size. This is decided based on the greatest common divisor (GCD) of acceptable erasure set sizes ranging from *4 to 16*. - *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*. In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4...
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Aug 15 23:04:20 UTC 2023 - 8K bytes - Viewed (0) -
src/cmd/compile/internal/typebits/typebits.go
// the read-only data section. // b. If it is a reflect-allocated type, it points into the Go heap. // Reflect is responsible for keeping a reference to // the underlying type so it won't be GCd. // If we ever have a moving GC, we need to change this for 2b (as // well as scan itabs to update their itab._type fields). bv.Set(int32(off/int64(types.PtrSize) + 1)) // pointer in second slot case types.TSLICE:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 01:53:41 UTC 2023 - 3.2K bytes - Viewed (0)