- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for udivisible (0.49 sec)
-
src/cmd/compile/internal/ssa/magic_test.go
} } } func testDivisibleExhaustiveU(t *testing.T, n uint) { maxU := uint64(1) << n for c := uint64(1); c < maxU; c++ { if !udivisibleOK(n, int64(c)) { continue } k := udivisible(n, int64(c)).k m := udivisible(n, int64(c)).m max := udivisible(n, int64(c)).max mask := ^uint64(0) >> (64 - n) for i := uint64(0); i < maxU; i++ { want := i%c == 0 mul := (i * m) & mask
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 30 22:02:07 UTC 2019 - 9.1K bytes - Viewed (0) -
pkg/registry/apps/deployment/strategy_test.go
errTests := []struct { name string newDeployment *apps.Deployment oldDeployment *apps.Deployment }{ { name: "validation on an existing deployment with divisible hugepages values to a new deployment with indivisible hugepages values", newDeployment: newDeploymentWithHugePageValue(api.ResourceHugePagesPrefix+"2Mi", resource.MustParse("2.1Mi")),
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 01 07:17:45 UTC 2023 - 9.1K bytes - Viewed (0) -
test/sieve.go
func Generate(ch chan<- int) { for i := 2; ; i++ { ch <- i // Send 'i' to channel 'ch'. } } // Copy the values from channel 'in' to channel 'out', // removing those divisible by 'prime'. func Filter(in <-chan int, out chan<- int, prime int) { for { i := <-in // Receive value of new variable 'i' from 'in'. if i%prime != 0 { out <- i // Send 'i' to channel 'out'. } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 24 00:48:19 UTC 2012 - 1K bytes - Viewed (0) -
cmd/metacache-bucket_test.go
"testing" ) func Benchmark_bucketMetacache_findCache(b *testing.B) { bm := newBucketMetacache("", false) const elements = 50000 const paths = 100 if elements%paths != 0 { b.Fatal("elements must be divisible by the number of paths") } var pathNames [paths]string for i := range pathNames[:] { pathNames[i] = fmt.Sprintf("prefix/%d", i) } for i := 0; i < elements; i++ { bm.findCache(listPathOptions{
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Mar 25 23:29:45 UTC 2022 - 1.8K bytes - Viewed (0) -
test/chan/sieve1.go
func Generate(ch chan<- int) { for i := 2; ; i++ { ch <- i // Send 'i' to channel 'ch'. } } // Copy the values from channel 'in' to channel 'out', // removing those divisible by 'prime'. func Filter(in <-chan int, out chan<- int, prime int) { for i := range in { // Loop over values received from 'in'. if i%prime != 0 { out <- i // Send 'i' to channel 'out'. } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Feb 19 06:44:02 UTC 2012 - 1.5K bytes - Viewed (0) -
src/crypto/rsa/pss_test.go
} } } func TestPSS513(t *testing.T) { // See Issue 42741, and separately, RFC 8017: "Note that the octet length of // EM will be one less than k if modBits - 1 is divisible by 8 and equal to // k otherwise, where k is the length in octets of the RSA modulus n." key, err := GenerateKey(rand.Reader, 513) if err != nil { t.Fatal(err) } digest := sha256.Sum256([]byte("message"))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 8.8K bytes - Viewed (0)