diff options
| author | Shaindel Schwartz <shaindel@google.com> | 2019-09-12 16:10:51 (GMT) |
|---|---|---|
| committer | Shaindel Schwartz <shaindel@google.com> | 2019-09-12 16:10:51 (GMT) |
| commit | c7a03daa99e7c457561b5dd2afc0eddab166e48e (patch) | |
| tree | ef122e5c8d5e0c5239a29f1a56012445f59cb867 /googletest/samples | |
| parent | ac24edd6e06114818b1a29c99bb81153514f7fb2 (diff) | |
| parent | 7bd4a7f3e9ae46bb7d99fc5fd5dd1a137496bb6a (diff) | |
| download | googletest-c7a03daa99e7c457561b5dd2afc0eddab166e48e.zip googletest-c7a03daa99e7c457561b5dd2afc0eddab166e48e.tar.gz googletest-c7a03daa99e7c457561b5dd2afc0eddab166e48e.tar.bz2 | |
Merge pull request #2387 from kuzkry:iff
PiperOrigin-RevId: 268693457
Diffstat (limited to 'googletest/samples')
| -rw-r--r-- | googletest/samples/prime_tables.h | 2 | ||||
| -rw-r--r-- | googletest/samples/sample1.cc | 2 | ||||
| -rw-r--r-- | googletest/samples/sample1.h | 2 |
3 files changed, 3 insertions, 3 deletions
diff --git a/googletest/samples/prime_tables.h b/googletest/samples/prime_tables.h index 4178e70..72539bf 100644 --- a/googletest/samples/prime_tables.h +++ b/googletest/samples/prime_tables.h @@ -43,7 +43,7 @@ class PrimeTable { public: virtual ~PrimeTable() {} - // Returns true if n is a prime number. + // Returns true if and only if n is a prime number. virtual bool IsPrime(int n) const = 0; // Returns the smallest prime number greater than p; or returns -1 diff --git a/googletest/samples/sample1.cc b/googletest/samples/sample1.cc index 58dbf17..1d42759 100644 --- a/googletest/samples/sample1.cc +++ b/googletest/samples/sample1.cc @@ -41,7 +41,7 @@ int Factorial(int n) { return result; } -// Returns true if n is a prime number. +// Returns true if and only if n is a prime number. bool IsPrime(int n) { // Trivial case 1: small numbers if (n <= 1) return false; diff --git a/googletest/samples/sample1.h b/googletest/samples/sample1.h index a90eae4..12e49de 100644 --- a/googletest/samples/sample1.h +++ b/googletest/samples/sample1.h @@ -35,7 +35,7 @@ // Returns n! (the factorial of n). For negative n, n! is defined to be 1. int Factorial(int n); -// Returns true if n is a prime number. +// Returns true if and only if n is a prime number. bool IsPrime(int n); #endif // GTEST_SAMPLES_SAMPLE1_H_ |