Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
18 changed files
with
2,142 additions
and
2,144 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,123 +1,123 @@ | ||
| // Copyright 2008 Google Inc. | ||
| // All Rights Reserved. | ||
| // | ||
| // Redistribution and use in source and binary forms, with or without | ||
| // modification, are permitted provided that the following conditions are | ||
| // met: | ||
| // | ||
| // * Redistributions of source code must retain the above copyright | ||
| // notice, this list of conditions and the following disclaimer. | ||
| // * Redistributions in binary form must reproduce the above | ||
| // copyright notice, this list of conditions and the following disclaimer | ||
| // in the documentation and/or other materials provided with the | ||
| // distribution. | ||
| // * Neither the name of Google Inc. nor the names of its | ||
| // contributors may be used to endorse or promote products derived from | ||
| // this software without specific prior written permission. | ||
| // | ||
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | ||
| // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | ||
| // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | ||
| // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | ||
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | ||
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | ||
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | ||
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | ||
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | ||
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| // | ||
| // Author: wan@google.com (Zhanyong Wan) | ||
| // Author: vladl@google.com (Vlad Losev) | ||
|
|
||
| // This provides interface PrimeTable that determines whether a number is a | ||
| // prime and determines a next prime number. This interface is used | ||
| // in Google Test samples demonstrating use of parameterized tests. | ||
|
|
||
| #ifndef GTEST_SAMPLES_PRIME_TABLES_H_ | ||
| #define GTEST_SAMPLES_PRIME_TABLES_H_ | ||
|
|
||
| #include <algorithm> | ||
|
|
||
| // The prime table interface. | ||
| class PrimeTable { | ||
| public: | ||
| virtual ~PrimeTable() {} | ||
|
|
||
| // Returns true iff n is a prime number. | ||
| virtual bool IsPrime(int n) const = 0; | ||
|
|
||
| // Returns the smallest prime number greater than p; or returns -1 | ||
| // if the next prime is beyond the capacity of the table. | ||
| virtual int GetNextPrime(int p) const = 0; | ||
| }; | ||
|
|
||
| // Implementation #1 calculates the primes on-the-fly. | ||
| class OnTheFlyPrimeTable : public PrimeTable { | ||
| public: | ||
| virtual bool IsPrime(int n) const { | ||
| if (n <= 1) return false; | ||
|
|
||
| for (int i = 2; i*i <= n; i++) { | ||
| // n is divisible by an integer other than 1 and itself. | ||
| if ((n % i) == 0) return false; | ||
| } | ||
|
|
||
| return true; | ||
| } | ||
|
|
||
| virtual int GetNextPrime(int p) const { | ||
| for (int n = p + 1; n > 0; n++) { | ||
| if (IsPrime(n)) return n; | ||
| } | ||
|
|
||
| return -1; | ||
| } | ||
| }; | ||
|
|
||
| // Implementation #2 pre-calculates the primes and stores the result | ||
| // in an array. | ||
| class PreCalculatedPrimeTable : public PrimeTable { | ||
| public: | ||
| // 'max' specifies the maximum number the prime table holds. | ||
| explicit PreCalculatedPrimeTable(int max) | ||
| : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) { | ||
| CalculatePrimesUpTo(max); | ||
| } | ||
| virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; } | ||
|
|
||
| virtual bool IsPrime(int n) const { | ||
| return 0 <= n && n < is_prime_size_ && is_prime_[n]; | ||
| } | ||
|
|
||
| virtual int GetNextPrime(int p) const { | ||
| for (int n = p + 1; n < is_prime_size_; n++) { | ||
| if (is_prime_[n]) return n; | ||
| } | ||
|
|
||
| return -1; | ||
| } | ||
|
|
||
| private: | ||
| void CalculatePrimesUpTo(int max) { | ||
| ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); | ||
| is_prime_[0] = is_prime_[1] = false; | ||
|
|
||
| for (int i = 2; i <= max; i++) { | ||
| if (!is_prime_[i]) continue; | ||
|
|
||
| // Marks all multiples of i (except i itself) as non-prime. | ||
| for (int j = 2*i; j <= max; j += i) { | ||
| is_prime_[j] = false; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| const int is_prime_size_; | ||
| bool* const is_prime_; | ||
|
|
||
| // Disables compiler warning "assignment operator could not be generated." | ||
| void operator=(const PreCalculatedPrimeTable& rhs); | ||
| }; | ||
|
|
||
| #endif // GTEST_SAMPLES_PRIME_TABLES_H_ | ||
| // Copyright 2008 Google Inc. | ||
| // All Rights Reserved. | ||
| // | ||
| // Redistribution and use in source and binary forms, with or without | ||
| // modification, are permitted provided that the following conditions are | ||
| // met: | ||
| // | ||
| // * Redistributions of source code must retain the above copyright | ||
| // notice, this list of conditions and the following disclaimer. | ||
| // * Redistributions in binary form must reproduce the above | ||
| // copyright notice, this list of conditions and the following disclaimer | ||
| // in the documentation and/or other materials provided with the | ||
| // distribution. | ||
| // * Neither the name of Google Inc. nor the names of its | ||
| // contributors may be used to endorse or promote products derived from | ||
| // this software without specific prior written permission. | ||
| // | ||
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | ||
| // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | ||
| // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | ||
| // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | ||
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | ||
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | ||
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | ||
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | ||
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | ||
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| // | ||
| // Author: wan@google.com (Zhanyong Wan) | ||
| // Author: vladl@google.com (Vlad Losev) | ||
|
|
||
| // This provides interface PrimeTable that determines whether a number is a | ||
| // prime and determines a next prime number. This interface is used | ||
| // in Google Test samples demonstrating use of parameterized tests. | ||
|
|
||
| #ifndef GTEST_SAMPLES_PRIME_TABLES_H_ | ||
| #define GTEST_SAMPLES_PRIME_TABLES_H_ | ||
|
|
||
| #include <algorithm> | ||
|
|
||
| // The prime table interface. | ||
| class PrimeTable { | ||
| public: | ||
| virtual ~PrimeTable() {} | ||
|
|
||
| // Returns true iff n is a prime number. | ||
| virtual bool IsPrime(int n) const = 0; | ||
|
|
||
| // Returns the smallest prime number greater than p; or returns -1 | ||
| // if the next prime is beyond the capacity of the table. | ||
| virtual int GetNextPrime(int p) const = 0; | ||
| }; | ||
|
|
||
| // Implementation #1 calculates the primes on-the-fly. | ||
| class OnTheFlyPrimeTable : public PrimeTable { | ||
| public: | ||
| virtual bool IsPrime(int n) const { | ||
| if (n <= 1) return false; | ||
|
|
||
| for (int i = 2; i*i <= n; i++) { | ||
| // n is divisible by an integer other than 1 and itself. | ||
| if ((n % i) == 0) return false; | ||
| } | ||
|
|
||
| return true; | ||
| } | ||
|
|
||
| virtual int GetNextPrime(int p) const { | ||
| for (int n = p + 1; n > 0; n++) { | ||
| if (IsPrime(n)) return n; | ||
| } | ||
|
|
||
| return -1; | ||
| } | ||
| }; | ||
|
|
||
| // Implementation #2 pre-calculates the primes and stores the result | ||
| // in an array. | ||
| class PreCalculatedPrimeTable : public PrimeTable { | ||
| public: | ||
| // 'max' specifies the maximum number the prime table holds. | ||
| explicit PreCalculatedPrimeTable(int max) | ||
| : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) { | ||
| CalculatePrimesUpTo(max); | ||
| } | ||
| virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; } | ||
|
|
||
| virtual bool IsPrime(int n) const { | ||
| return 0 <= n && n < is_prime_size_ && is_prime_[n]; | ||
| } | ||
|
|
||
| virtual int GetNextPrime(int p) const { | ||
| for (int n = p + 1; n < is_prime_size_; n++) { | ||
| if (is_prime_[n]) return n; | ||
| } | ||
|
|
||
| return -1; | ||
| } | ||
|
|
||
| private: | ||
| void CalculatePrimesUpTo(int max) { | ||
| ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); | ||
| is_prime_[0] = is_prime_[1] = false; | ||
|
|
||
| for (int i = 2; i <= max; i++) { | ||
| if (!is_prime_[i]) continue; | ||
|
|
||
| // Marks all multiples of i (except i itself) as non-prime. | ||
| for (int j = 2*i; j <= max; j += i) { | ||
| is_prime_[j] = false; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| const int is_prime_size_; | ||
| bool* const is_prime_; | ||
|
|
||
| // Disables compiler warning "assignment operator could not be generated." | ||
| void operator=(const PreCalculatedPrimeTable& rhs); | ||
| }; | ||
|
|
||
| #endif // GTEST_SAMPLES_PRIME_TABLES_H_ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,68 +1,68 @@ | ||
| // Copyright 2005, Google Inc. | ||
| // All rights reserved. | ||
| // | ||
| // Redistribution and use in source and binary forms, with or without | ||
| // modification, are permitted provided that the following conditions are | ||
| // met: | ||
| // | ||
| // * Redistributions of source code must retain the above copyright | ||
| // notice, this list of conditions and the following disclaimer. | ||
| // * Redistributions in binary form must reproduce the above | ||
| // copyright notice, this list of conditions and the following disclaimer | ||
| // in the documentation and/or other materials provided with the | ||
| // distribution. | ||
| // * Neither the name of Google Inc. nor the names of its | ||
| // contributors may be used to endorse or promote products derived from | ||
| // this software without specific prior written permission. | ||
| // | ||
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | ||
| // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | ||
| // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | ||
| // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | ||
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | ||
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | ||
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | ||
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | ||
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | ||
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
|
|
||
| // A sample program demonstrating using Google C++ testing framework. | ||
| // | ||
| // Author: wan@google.com (Zhanyong Wan) | ||
|
|
||
| #include "sample1.h" | ||
|
|
||
| // Returns n! (the factorial of n). For negative n, n! is defined to be 1. | ||
| int Factorial(int n) { | ||
| int result = 1; | ||
| for (int i = 1; i <= n; i++) { | ||
| result *= i; | ||
| } | ||
|
|
||
| return result; | ||
| } | ||
|
|
||
| // Returns true iff n is a prime number. | ||
| bool IsPrime(int n) { | ||
| // Trivial case 1: small numbers | ||
| if (n <= 1) return false; | ||
|
|
||
| // Trivial case 2: even numbers | ||
| if (n % 2 == 0) return n == 2; | ||
|
|
||
| // Now, we have that n is odd and n >= 3. | ||
|
|
||
| // Try to divide n by every odd number i, starting from 3 | ||
| for (int i = 3; ; i += 2) { | ||
| // We only have to try i up to the squre root of n | ||
| if (i > n/i) break; | ||
|
|
||
| // Now, we have i <= n/i < n. | ||
| // If n is divisible by i, n is not prime. | ||
| if (n % i == 0) return false; | ||
| } | ||
|
|
||
| // n has no integer factor in the range (1, n), and thus is prime. | ||
| return true; | ||
| } | ||
| // Copyright 2005, Google Inc. | ||
| // All rights reserved. | ||
| // | ||
| // Redistribution and use in source and binary forms, with or without | ||
| // modification, are permitted provided that the following conditions are | ||
| // met: | ||
| // | ||
| // * Redistributions of source code must retain the above copyright | ||
| // notice, this list of conditions and the following disclaimer. | ||
| // * Redistributions in binary form must reproduce the above | ||
| // copyright notice, this list of conditions and the following disclaimer | ||
| // in the documentation and/or other materials provided with the | ||
| // distribution. | ||
| // * Neither the name of Google Inc. nor the names of its | ||
| // contributors may be used to endorse or promote products derived from | ||
| // this software without specific prior written permission. | ||
| // | ||
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | ||
| // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | ||
| // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | ||
| // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | ||
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | ||
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | ||
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | ||
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | ||
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | ||
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
|
|
||
| // A sample program demonstrating using Google C++ testing framework. | ||
| // | ||
| // Author: wan@google.com (Zhanyong Wan) | ||
|
|
||
| #include "sample1.h" | ||
|
|
||
| // Returns n! (the factorial of n). For negative n, n! is defined to be 1. | ||
| int Factorial(int n) { | ||
| int result = 1; | ||
| for (int i = 1; i <= n; i++) { | ||
| result *= i; | ||
| } | ||
|
|
||
| return result; | ||
| } | ||
|
|
||
| // Returns true iff n is a prime number. | ||
| bool IsPrime(int n) { | ||
| // Trivial case 1: small numbers | ||
| if (n <= 1) return false; | ||
|
|
||
| // Trivial case 2: even numbers | ||
| if (n % 2 == 0) return n == 2; | ||
|
|
||
| // Now, we have that n is odd and n >= 3. | ||
|
|
||
| // Try to divide n by every odd number i, starting from 3 | ||
| for (int i = 3; ; i += 2) { | ||
| // We only have to try i up to the square root of n | ||
| if (i > n/i) break; | ||
|
|
||
| // Now, we have i <= n/i < n. | ||
| // If n is divisible by i, n is not prime. | ||
| if (n % i == 0) return false; | ||
| } | ||
|
|
||
| // n has no integer factor in the range (1, n), and thus is prime. | ||
| return true; | ||
| } |
Oops, something went wrong.