| /external/llvm-project/lldb/test/API/functionalities/data-formatter/data-formatter-stl/libcxx/bitset/ |
| D | TestDataFormatterLibcxxBitset.py | 20 primes = [1]*300
21 primes[0] = primes[1] = 0
22 for i in range(2, len(primes)):
23 for j in range(2*i, len(primes), i):
24 primes[j] = 0
25 self.primes = primes
33 self.assertEqual(child.GetValueAsUnsigned(), self.primes[i],
|
| /external/python/cpython2/Demo/scripts/ |
| D | primes.py | 5 def primes(min, max): function
8 primes = [2]
11 for p in primes:
15 primes.append(i)
27 primes(min, max)
|
| /external/igt-gpu-tools/lib/ |
| D | igt_primes.c | 131 unsigned long *primes, in mark_multiples() argument
142 clear_bit(m, primes); in mark_multiples()
151 static unsigned long *primes; in igt_next_prime_number() local
168 nprimes = realloc(primes, sz / sizeof(long)); in igt_next_prime_number()
180 primes = nprimes; in igt_next_prime_number()
184 return find_next_bit(primes, last, x + 1); in igt_next_prime_number()
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | CalendarCache.java | 79 if (pIndex < primes.length - 1) { in rehash()
80 arraySize = primes[++pIndex]; in rehash()
113 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in CalendarCache
120 private int arraySize = primes[pIndex];
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | CalendarCache.java | 77 if (pIndex < primes.length - 1) { in rehash()
78 arraySize = primes[++pIndex]; in rehash()
111 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in CalendarCache
118 private int arraySize = primes[pIndex];
|
| /external/swiftshader/third_party/marl/examples/ |
| D | primes.cpp | 65 std::vector<int> primes; in main() local
68 primes.push_back(i); in main()
78 for (auto prime : primes) { in main()
|
| D | BUILD.bazel | 36 name = "primes",
38 "primes.cpp",
|
| /external/kotlinx.coroutines/benchmarks/src/jmh/kotlin/benchmarks/flow/ |
| D | NumbersBenchmark.kt | 26 private const val primes = 100 in <lambda>() constant
59 fun primes() = runBlocking { in <lambda>() method
60 primesFlow().take(primes).count() in <lambda>()
64 fun primesRx() = generateRxPrimes().take(primes.toLong()).count().blockingGet() in <lambda>()
|
| /external/bcc/tools/ |
| D | cthreads_example.txt | 28 0.924 27462 pthread primes_thread [primes]
29 0.927 27463 pthread primes_thread [primes]
30 0.928 27464 pthread primes_thread [primes]
31 0.928 27465 pthread primes_thread [primes]
|
| D | javathreads_example.txt | 28 0.924 27462 pthread primes_thread [primes]
29 0.927 27463 pthread primes_thread [primes]
30 0.928 27464 pthread primes_thread [primes]
31 0.928 27465 pthread primes_thread [primes]
|
| D | funclatency_example.txt | 85 # ./funclatency /home/user/primes:* -p $(pidof primes) -F
86 Tracing 15 functions for "/home/user/primes:*"... Hit Ctrl-C to end.
136 an exponential distribution -- very few primes take a very long time to test,
|
| /external/bcc/tools/lib/ |
| D | uthreads_example.txt | 28 0.924 27462 pthread primes_thread [primes]
29 0.927 27463 pthread primes_thread [primes]
30 0.928 27464 pthread primes_thread [primes]
31 0.928 27465 pthread primes_thread [primes]
|
| /external/boringssl/src/third_party/wycheproof_testvectors/ |
| D | rsa_pkcs1_3072_test.txt | 494 # edge case for montgomery reduction with special primes
507 # edge case for montgomery reduction with special primes
519 # edge case for montgomery reduction with special primes
531 # edge case for montgomery reduction with special primes
543 # edge case for montgomery reduction with special primes
555 # edge case for montgomery reduction with special primes
567 # edge case for montgomery reduction with special primes
579 # edge case for montgomery reduction with special primes
591 # edge case for montgomery reduction with special primes
603 # edge case for montgomery reduction with special primes
|
| D | rsa_pkcs1_2048_test.txt | 494 # edge case for montgomery reduction with special primes
506 # edge case for montgomery reduction with special primes
518 # edge case for montgomery reduction with special primes
530 # edge case for montgomery reduction with special primes
542 # edge case for montgomery reduction with special primes
554 # edge case for montgomery reduction with special primes
566 # edge case for montgomery reduction with special primes
578 # edge case for montgomery reduction with special primes
590 # edge case for montgomery reduction with special primes
602 # edge case for montgomery reduction with special primes
|
| D | rsa_pkcs1_4096_test.txt | 494 # edge case for montgomery reduction with special primes
506 # edge case for montgomery reduction with special primes
519 # edge case for montgomery reduction with special primes
531 # edge case for montgomery reduction with special primes
543 # edge case for montgomery reduction with special primes
555 # edge case for montgomery reduction with special primes
567 # edge case for montgomery reduction with special primes
579 # edge case for montgomery reduction with special primes
591 # edge case for montgomery reduction with special primes
603 # edge case for montgomery reduction with special primes
|
| /external/testng/src/test/java/test/testng387/ |
| D | FailedDPTest.java | 20 static final List<Integer> primes = Arrays.asList(2, 3, 5, 7); field in FailedDPTest
40 if (primes.contains(i)){ in isNotPrime()
|
| D | TestNG387.java | 27 assertEqualsNoOrder(failed.toArray(), FailedDPTest.primes.toArray()); in testInvocationCounterIsCorrectForMethodWithDataProvider()
|
| /external/swiftshader/third_party/marl/kokoro/ubuntu/ |
| D | docker.sh | 116 ./primes > /dev/null
175 bazel run //examples:primes > /dev/null
|
| /external/python/rsa/tests/ |
| D | test_key.py | 64 primes = [64123, 64123, 64123, 50957, 39317, 33107]
67 return primes.pop(0)
|
| /external/swiftshader/third_party/marl/kokoro/macos/ |
| D | build.sh | 96 ./primes > /dev/null
160 "${BAZEL}" run //examples:primes > /dev/null
|
| /external/rust/crates/ring/tests/ |
| D | rsa_from_pkcs8_tests.txt | 32 # private primes aren't equal, because it is too small, because the private
38 # private primes aren't equal and because the private modulus length isn't a
59 # length isn't a multiple of 512 bits and because the private primes aren't
|
| /external/rust/crates/quote/tests/ |
| D | test.rs | 72 let primes = &[X, X, X, X]; in test_iter() localVariable
74 assert_eq!("X X X X", quote!(#(#primes)*).to_string()); in test_iter()
76 assert_eq!("X , X , X , X ,", quote!(#(#primes,)*).to_string()); in test_iter()
78 assert_eq!("X , X , X , X", quote!(#(#primes),*).to_string()); in test_iter()
|
| /external/openssh/ |
| D | Makefile.in | 428 echo "moving $(DESTDIR)$(sysconfdir)/primes to $(DESTDIR)$(sysconfdir)/moduli"; \
429 mv "$(DESTDIR)$(sysconfdir)/primes" "$(DESTDIR)$(sysconfdir)/moduli"; \
|
| /external/deqp/external/vulkancts/modules/vulkan/descriptor_indexing/ |
| D | vktDescriptorSetsIndexingTests.cpp | 438 const std::vector<deUint32> primes = ut::generatePrimes(availableDescriptorCount); in init() local
439 const deUint32 primeCount = static_cast<deUint32>(primes.size()); in init()
445 data[idx].x() = static_cast<pixelType::Element>(primes[idx % primeCount]); in init()
646 const std::vector<deUint32> primes = ut::generatePrimes(availableDescriptorCount); in createVertexAttributeBuffer() local
647 const deUint32 primeCount = static_cast<deUint32>(primes.size()); in createVertexAttributeBuffer()
655 data[invIdx].index.x() = primes[invIdx % primeCount]; in createVertexAttributeBuffer()
667 const deUint32 prime = primes[primeIdx]; in createVertexAttributeBuffer()
1117 const std::vector<deUint32> primes = ut::generatePrimes(variables.availableDescriptorCount); in updateDescriptors() local
1118 const deUint32 primeCount = static_cast<deUint32>(primes.size()); in updateDescriptors()
1176 primes[primeIdx], // elementIndex in updateDescriptors()
[all …]
|
| /external/python/cpython3/Modules/_decimal/libmpdec/literature/ |
| D | bignum.txt | 32 prime field. However, it is possible to use multiple primes and
79 transforms modulo three different primes to get the
|