HomeSort by relevance Sort by last modified time
    Searched refs:is_prime_ (Results 1 - 3 of 3) sorted by null

  /external/chromium_org/testing/gtest/samples/
prime_tables.h 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
87 virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; }
90 return 0 <= n && n < is_prime_size_ && is_prime_[n];
95 if (is_prime_[n]) return n;
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true);
104 is_prime_[0] = is_prime_[1] = false;
107 if (!is_prime_[i]) continue;
111 is_prime_[j] = false
117 bool* const is_prime_; member in class:PreCalculatedPrimeTable
    [all...]
  /external/protobuf/gtest/samples/
prime_tables.h 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
87 virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; }
90 return 0 <= n && n < is_prime_size_ && is_prime_[n];
95 if (is_prime_[n]) return n;
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true);
104 is_prime_[0] = is_prime_[1] = false;
107 if (!is_prime_[i]) continue;
111 is_prime_[j] = false
117 bool* const is_prime_; member in class:PreCalculatedPrimeTable
    [all...]
  /ndk/sources/third_party/googletest/googletest/samples/
prime_tables.h 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
87 virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; }
90 return 0 <= n && n < is_prime_size_ && is_prime_[n];
95 if (is_prime_[n]) return n;
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true);
104 is_prime_[0] = is_prime_[1] = false;
107 if (!is_prime_[i]) continue;
111 is_prime_[j] = false
117 bool* const is_prime_; member in class:PreCalculatedPrimeTable
    [all...]

Completed in 544 milliseconds