LINUX gtest单元测试工具的使用介绍

一.安装Googletest

git clone https://github.com/google/googletest.git

cd到下载好的这个目录中

cmake ./   

make

cmake要求版本3.13以上的  如果版本不够自行到官网下载最新版

 如果make编译报错注意到CMakeLists.txt中加入这句

SET(CMAKE_CXX_FLAGS "-std=c++11")

 重新执行cmake(要把cmake产生的文件都删除  最好直接重新clone) 和 make

二.Googletest的使用

测试代码: 

这里就按照这个格式写 

EXPECT_EQ:断言这两个结果相等

EXPECT_GT:断言第一个比第二个更大

EXPECT_TRUE:断言为真

EXPECT_FALSE:断言为假

分块写测试到时候出问题了好找哪里断言错了

#include <limits.h>
#include <gtest/gtest.h>
#include "sample1.h"

namespace{

TEST(FactorialTest, Negative) {
    // This test is named "Negative", and belongs to the "FactorialTest"
    // test case.
    EXPECT_EQ(1, Factorial(-5));
    EXPECT_EQ(1, Factorial(-1));
    EXPECT_GT(Factorial(-10), 0);
}

TEST(FactorialTest, Zero) {
    EXPECT_EQ(1, Factorial(0));
}

TEST(FactorialTest, Positive) {
    EXPECT_EQ(1, Factorial(1));
    EXPECT_EQ(2, Factorial(2));
    EXPECT_EQ(6, Factorial(3));
    EXPECT_EQ(40320, Factorial(8));
}

// Tests IsPrime()
TEST(IsPrimeTest, Negative) {
  EXPECT_FALSE(IsPrime(-1));
  EXPECT_FALSE(IsPrime(-2));
  EXPECT_FALSE(IsPrime(INT_MIN));
}

TEST(IsPrimeTest, Trivial) {
  EXPECT_FALSE(IsPrime(0));
  EXPECT_FALSE(IsPrime(1));
  EXPECT_FALSE(IsPrime(INT_MIN));
}

TEST(IsPrimeTest, Trivial) {
  EXPECT_FALSE(IsPrime(0));
  EXPECT_FALSE(IsPrime(1));
  EXPECT_TRUE(IsPrime(2));
  EXPECT_TRUE(IsPrime(3));
}

TEST(IsPrimeTest, Positive) {
  EXPECT_FALSE(IsPrime(4));
  EXPECT_TRUE(IsPrime(5));
  EXPECT_FALSE(IsPrime(6));
  EXPECT_TRUE(IsPrime(23));
}

源码:

分别是两个函数  判断阶乘还有素数的

#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;
}

最后编译的时候注意加这些选项:

因为函数中没有main函数注意加上  lgtest_main  里面还使用了多线程  注意加 lpthread

g++ unittest.cc sample1.cc -lgtest -std=c++14 -lgtest_main -lpthread -o test.exe

注意:Google test 只支持c++14以上 

也可以在测试样例里加上

int main(int argc, char** argv){
    testing::InitGoogleTest(&argc, argv);
    return RUN_ALL_TESTS();
}

这样编译的时候就不用加那个 -lgtest_main了 

最后测试的结果都为OK