Searched refs:is_prime_ (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()
87 virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; } in ~PreCalculatedPrimeTable()
90 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
95 if (is_prime_[n]) return n; in GetNextPrime()
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); in CalculatePrimesUpTo()
104 is_prime_[0] = is_prime_[1] = false; in CalculatePrimesUpTo()
107 if (!is_prime_[i]) continue; in CalculatePrimesUpTo()
111 is_prime_[j] = false; in CalculatePrimesUpTo()
117 bool* const is_prime_; variable
|
| /external/googletest/googletest/samples/ |
| D | prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) { in PreCalculatedPrimeTable()
87 virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; } in ~PreCalculatedPrimeTable()
90 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
95 if (is_prime_[n]) return n; in GetNextPrime()
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); in CalculatePrimesUpTo()
104 is_prime_[0] = is_prime_[1] = false; in CalculatePrimesUpTo()
107 if (!is_prime_[i]) continue; in CalculatePrimesUpTo()
111 is_prime_[j] = false; in CalculatePrimesUpTo()
117 bool* const is_prime_; 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()
87 virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; } in ~PreCalculatedPrimeTable()
90 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
95 if (is_prime_[n]) return n; in GetNextPrime()
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); in CalculatePrimesUpTo()
104 is_prime_[0] = is_prime_[1] = false; in CalculatePrimesUpTo()
107 if (!is_prime_[i]) continue; in CalculatePrimesUpTo()
111 is_prime_[j] = false; in CalculatePrimesUpTo()
117 bool* const is_prime_; 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()
87 virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; } in ~PreCalculatedPrimeTable()
90 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
95 if (is_prime_[n]) return n; in GetNextPrime()
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); in CalculatePrimesUpTo()
104 is_prime_[0] = is_prime_[1] = false; in CalculatePrimesUpTo()
107 if (!is_prime_[i]) continue; in CalculatePrimesUpTo()
111 is_prime_[j] = false; in CalculatePrimesUpTo()
117 bool* const is_prime_; variable
|
| /external/protobuf/gtest/samples/ |
| D | prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) { in PreCalculatedPrimeTable()
87 virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; } in ~PreCalculatedPrimeTable()
90 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
95 if (is_prime_[n]) return n; in GetNextPrime()
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); in CalculatePrimesUpTo()
104 is_prime_[0] = is_prime_[1] = false; in CalculatePrimesUpTo()
107 if (!is_prime_[i]) continue; in CalculatePrimesUpTo()
111 is_prime_[j] = false; in CalculatePrimesUpTo()
117 bool* const is_prime_; variable
|