diff options
author | Gennadiy Civil <misterg@google.com> | 2019-07-30 22:47:55 (GMT) |
---|---|---|
committer | Gennadiy Civil <misterg@google.com> | 2019-07-30 22:47:55 (GMT) |
commit | 9311242db422dd6f24c8e764847fe5d70d0d4859 (patch) | |
tree | 46476749af3ee455671a07764be6c54b8a065a43 /googletest/samples | |
parent | 0647b90eebfbe98d7bba3aa700b65752c3695c79 (diff) | |
parent | bf6df7eaee5cfaafe2655fab143f348eba98c9af (diff) | |
download | googletest-9311242db422dd6f24c8e764847fe5d70d0d4859.zip googletest-9311242db422dd6f24c8e764847fe5d70d0d4859.tar.gz googletest-9311242db422dd6f24c8e764847fe5d70d0d4859.tar.bz2 |
Merge pull request #2356 from kuzkry:typos
PiperOrigin-RevId: 260786935
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 119545a..4178e70 100644 --- a/googletest/samples/prime_tables.h +++ b/googletest/samples/prime_tables.h @@ -43,7 +43,7 @@ class PrimeTable { public: virtual ~PrimeTable() {} - // Returns true iff n is a prime number. + // Returns true 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 13cec1d..58dbf17 100644 --- a/googletest/samples/sample1.cc +++ b/googletest/samples/sample1.cc @@ -41,7 +41,7 @@ int Factorial(int n) { return result; } -// Returns true iff n is a prime number. +// Returns true 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 2c3e9f0..a90eae4 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 iff n is a prime number. +// Returns true if n is a prime number. bool IsPrime(int n); #endif // GTEST_SAMPLES_SAMPLE1_H_ |