Searched refs:is_prime (Results 1 – 14 of 14) sorted by relevance
| /external/python/rsa/tests/ |
| D | test_prime.py | 31 self.assertFalse(rsa.prime.is_prime(-1))
32 self.assertFalse(rsa.prime.is_prime(0))
33 self.assertFalse(rsa.prime.is_prime(1))
34 self.assertTrue(rsa.prime.is_prime(2))
35 self.assertFalse(rsa.prime.is_prime(42))
36 self.assertTrue(rsa.prime.is_prime(41))
41 [x for x in range(901, 1000) if rsa.prime.is_prime(x)]
45 self.assertTrue(rsa.prime.is_prime(982451653))
46 self.assertFalse(rsa.prime.is_prime(982451653 * 961748941))
96 self.assertTrue(rsa.prime.is_prime(2**exp - 1))
|
| D | test_parallel.py | 16 self.assertFalse(rsa.prime.is_prime(p - 1))
17 self.assertTrue(rsa.prime.is_prime(p))
18 self.assertFalse(rsa.prime.is_prime(p + 1))
|
| /external/python/futures/ |
| D | primes.py | 17 def is_prime(n): function
28 return list(map(is_prime, PRIMES))
32 return list(executor.map(is_prime, PRIMES))
36 return list(executor.map(is_prime, PRIMES))
|
| /external/libcxx/test/libcxx/containers/unord/ |
| D | next_prime.pass.cpp | 24 is_prime(size_t n) in is_prime() function
48 assert(!is_prime(i)); in main()
49 assert(is_prime(p)); in main()
|
| /external/elfutils/lib/ |
| D | next_prime.c | 35 is_prime (size_t candidate) in is_prime() function
62 while (!is_prime (seed)) in next_prime()
|
| /external/python/rsa/rsa/ |
| D | prime.py | 121 def is_prime(number): function
169 if is_prime(integer):
|
| D | parallel.py | 41 if rsa.prime.is_prime(integer):
|
| /external/Reactive-Extensions/RxCpp/Ix/CPP/unittest/ |
| D | testbench.cpp | 128 bool is_prime(int x) { in is_prime() function
154 .where(is_prime) in TEST()
168 .where(is_prime); in TEST()
229 .where(is_prime) in some_primes()
|
| /external/bcc/tools/ |
| D | funclatency_example.txt | 89 Function = is_prime [6556]
135 From the results, we can see that the is_prime function has something resembling
|
| D | funccount_example.txt | 180 is_prime 1252772
|
| /external/python/futures/docs/ |
| D | index.rst | 181 def is_prime(n):
193 for number, prime in zip(PRIMES, executor.map(is_prime, PRIMES)):
|
| /external/python/cpython3/Doc/library/ |
| D | concurrent.futures.rst | 259 def is_prime(n):
271 for number, prime in zip(PRIMES, executor.map(is_prime, PRIMES)):
|
| /external/boringssl/src/crypto/fipsmodule/bn/ |
| D | bn_test.cc | 1980 bool is_prime = false; in TEST_F() local
1983 is_prime = true; in TEST_F()
1991 EXPECT_EQ(is_prime ? 1 : 0, is_probably_prime_1); in TEST_F()
1995 EXPECT_EQ(is_prime ? 1 : 0, is_probably_prime_2); in TEST_F()
1999 EXPECT_EQ(is_prime, result_3 == bn_probably_prime); in TEST_F()
|
| /external/tensorflow/tensorflow/contrib/autograph/examples/notebooks/ |
| D | dev_summit_2018_demo.ipynb | 577 " is_prime = True\n",
580 " is_prime = False\n",
582 " if not is_prime:\n",
|