| /external/chromium/testing/gtest/samples/ |
| prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
90 return 0 <= n && n < is_prime_size_ && is_prime_[n];
94 for (int n = p + 1; n < is_prime_size_; n++) {
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true);
116 const int is_prime_size_; member in class:PreCalculatedPrimeTable
|
| /external/chromium_org/testing/gtest/samples/ |
| prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
90 return 0 <= n && n < is_prime_size_ && is_prime_[n];
94 for (int n = p + 1; n < is_prime_size_; n++) {
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true);
116 const int is_prime_size_; member in class:PreCalculatedPrimeTable
|
| /external/gtest/samples/ |
| prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
90 return 0 <= n && n < is_prime_size_ && is_prime_[n];
94 for (int n = p + 1; n < is_prime_size_; n++) {
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true);
116 const int is_prime_size_; member in class:PreCalculatedPrimeTable
|
| /external/libvpx/libvpx/third_party/googletest/src/samples/ |
| prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
90 return 0 <= n && n < is_prime_size_ && is_prime_[n];
94 for (int n = p + 1; n < is_prime_size_; n++) {
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true);
116 const int is_prime_size_; member in class:PreCalculatedPrimeTable
|
| /external/protobuf/gtest/samples/ |
| prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
90 return 0 <= n && n < is_prime_size_ && is_prime_[n];
94 for (int n = p + 1; n < is_prime_size_; n++) {
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true);
116 const int is_prime_size_; member in class:PreCalculatedPrimeTable
|
| /ndk/sources/third_party/googletest/googletest/samples/ |
| prime_tables.h | 84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
90 return 0 <= n && n < is_prime_size_ && is_prime_[n];
94 for (int n = p + 1; n < is_prime_size_; n++) {
103 ::std::fill(is_prime_, is_prime_ + is_prime_size_, true);
116 const int is_prime_size_; member in class:PreCalculatedPrimeTable
|
