media/webrtc/trunk/testing/gtest/samples/sample1.cc@4ab42b5ab56c (annotated)
media/webrtc/trunk/testing/gtest/samples/sample1.cc
Wed, 31 Dec 2014 07:53:36 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Wed, 31 Dec 2014 07:53:36 +0100
- branch
- TOR_BUG_3246
- changeset 5
- 4ab42b5ab56c
- permissions
- -rw-r--r--
Correct small whitespace inconsistency, lost while renaming variables.
| michael@0 | 1 | // Copyright 2005, Google Inc. |
| michael@0 | 2 | // All rights reserved. |
| michael@0 | 3 | // |
| michael@0 | 4 | // Redistribution and use in source and binary forms, with or without |
| michael@0 | 5 | // modification, are permitted provided that the following conditions are |
| michael@0 | 6 | // met: |
| michael@0 | 7 | // |
| michael@0 | 8 | // * Redistributions of source code must retain the above copyright |
| michael@0 | 9 | // notice, this list of conditions and the following disclaimer. |
| michael@0 | 10 | // * Redistributions in binary form must reproduce the above |
| michael@0 | 11 | // copyright notice, this list of conditions and the following disclaimer |
| michael@0 | 12 | // in the documentation and/or other materials provided with the |
| michael@0 | 13 | // distribution. |
| michael@0 | 14 | // * Neither the name of Google Inc. nor the names of its |
| michael@0 | 15 | // contributors may be used to endorse or promote products derived from |
| michael@0 | 16 | // this software without specific prior written permission. |
| michael@0 | 17 | // |
| michael@0 | 18 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| michael@0 | 19 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| michael@0 | 20 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| michael@0 | 21 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| michael@0 | 22 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| michael@0 | 23 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| michael@0 | 24 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| michael@0 | 25 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| michael@0 | 26 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| michael@0 | 27 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| michael@0 | 28 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| michael@0 | 29 | |
| michael@0 | 30 | // A sample program demonstrating using Google C++ testing framework. |
| michael@0 | 31 | // |
| michael@0 | 32 | // Author: wan@google.com (Zhanyong Wan) |
| michael@0 | 33 | |
| michael@0 | 34 | #include "sample1.h" |
| michael@0 | 35 | |
| michael@0 | 36 | // Returns n! (the factorial of n). For negative n, n! is defined to be 1. |
| michael@0 | 37 | int Factorial(int n) { |
| michael@0 | 38 | int result = 1; |
| michael@0 | 39 | for (int i = 1; i <= n; i++) { |
| michael@0 | 40 | result *= i; |
| michael@0 | 41 | } |
| michael@0 | 42 | |
| michael@0 | 43 | return result; |
| michael@0 | 44 | } |
| michael@0 | 45 | |
| michael@0 | 46 | // Returns true iff n is a prime number. |
| michael@0 | 47 | bool IsPrime(int n) { |
| michael@0 | 48 | // Trivial case 1: small numbers |
| michael@0 | 49 | if (n <= 1) return false; |
| michael@0 | 50 | |
| michael@0 | 51 | // Trivial case 2: even numbers |
| michael@0 | 52 | if (n % 2 == 0) return n == 2; |
| michael@0 | 53 | |
| michael@0 | 54 | // Now, we have that n is odd and n >= 3. |
| michael@0 | 55 | |
| michael@0 | 56 | // Try to divide n by every odd number i, starting from 3 |
| michael@0 | 57 | for (int i = 3; ; i += 2) { |
| michael@0 | 58 | // We only have to try i up to the squre root of n |
| michael@0 | 59 | if (i > n/i) break; |
| michael@0 | 60 | |
| michael@0 | 61 | // Now, we have i <= n/i < n. |
| michael@0 | 62 | // If n is divisible by i, n is not prime. |
| michael@0 | 63 | if (n % i == 0) return false; |
| michael@0 | 64 | } |
| michael@0 | 65 | |
| michael@0 | 66 | // n has no integer factor in the range (1, n), and thus is prime. |
| michael@0 | 67 | return true; |
| michael@0 | 68 | } |
