1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/media/webrtc/trunk/testing/gtest/samples/sample1.cc Wed Dec 31 06:09:35 2014 +0100 1.3 @@ -0,0 +1,68 @@ 1.4 +// Copyright 2005, Google Inc. 1.5 +// All rights reserved. 1.6 +// 1.7 +// Redistribution and use in source and binary forms, with or without 1.8 +// modification, are permitted provided that the following conditions are 1.9 +// met: 1.10 +// 1.11 +// * Redistributions of source code must retain the above copyright 1.12 +// notice, this list of conditions and the following disclaimer. 1.13 +// * Redistributions in binary form must reproduce the above 1.14 +// copyright notice, this list of conditions and the following disclaimer 1.15 +// in the documentation and/or other materials provided with the 1.16 +// distribution. 1.17 +// * Neither the name of Google Inc. nor the names of its 1.18 +// contributors may be used to endorse or promote products derived from 1.19 +// this software without specific prior written permission. 1.20 +// 1.21 +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 1.22 +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 1.23 +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 1.24 +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 1.25 +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 1.26 +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 1.27 +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 1.28 +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 1.29 +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 1.30 +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 1.31 +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 1.32 + 1.33 +// A sample program demonstrating using Google C++ testing framework. 1.34 +// 1.35 +// Author: wan@google.com (Zhanyong Wan) 1.36 + 1.37 +#include "sample1.h" 1.38 + 1.39 +// Returns n! (the factorial of n). For negative n, n! is defined to be 1. 1.40 +int Factorial(int n) { 1.41 + int result = 1; 1.42 + for (int i = 1; i <= n; i++) { 1.43 + result *= i; 1.44 + } 1.45 + 1.46 + return result; 1.47 +} 1.48 + 1.49 +// Returns true iff n is a prime number. 1.50 +bool IsPrime(int n) { 1.51 + // Trivial case 1: small numbers 1.52 + if (n <= 1) return false; 1.53 + 1.54 + // Trivial case 2: even numbers 1.55 + if (n % 2 == 0) return n == 2; 1.56 + 1.57 + // Now, we have that n is odd and n >= 3. 1.58 + 1.59 + // Try to divide n by every odd number i, starting from 3 1.60 + for (int i = 3; ; i += 2) { 1.61 + // We only have to try i up to the squre root of n 1.62 + if (i > n/i) break; 1.63 + 1.64 + // Now, we have i <= n/i < n. 1.65 + // If n is divisible by i, n is not prime. 1.66 + if (n % i == 0) return false; 1.67 + } 1.68 + 1.69 + // n has no integer factor in the range (1, n), and thus is prime. 1.70 + return true; 1.71 +}