Searched refs:is_prime_size_ (Results 1 – 5 of 5) sorted by relevance
| /external/v8/testing/gtest/samples/ |
| D | prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) { in PreCalculatedPrimeTable()
90 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
94 for (int n = p + 1; n < is_prime_size_; n++) { in GetNextPrime()
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); in CalculatePrimesUpTo()
116 const int is_prime_size_; variable
|
| /external/googletest/googletest/samples/ |
| D | prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) { in PreCalculatedPrimeTable()
90 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
94 for (int n = p + 1; n < is_prime_size_; n++) { in GetNextPrime()
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); in CalculatePrimesUpTo()
116 const int is_prime_size_; variable
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| D | prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) { in PreCalculatedPrimeTable()
90 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
94 for (int n = p + 1; n < is_prime_size_; n++) { in GetNextPrime()
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); in CalculatePrimesUpTo()
116 const int is_prime_size_; variable
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| D | prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) { in PreCalculatedPrimeTable()
90 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
94 for (int n = p + 1; n < is_prime_size_; n++) { in GetNextPrime()
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); in CalculatePrimesUpTo()
116 const int is_prime_size_; variable
|
| /external/protobuf/gtest/samples/ |
| D | prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) { in PreCalculatedPrimeTable()
90 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
94 for (int n = p + 1; n < is_prime_size_; n++) { in GetNextPrime()
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); in CalculatePrimesUpTo()
116 const int is_prime_size_; variable
|