mirror of https://github.com/catchorg/Catch2.git
344 lines
7.6 KiB
C++
344 lines
7.6 KiB
C++
/*
|
|
* Created by Phil on 29/11/2010.
|
|
* Copyright 2010 Two Blue Cubes Ltd. All rights reserved.
|
|
*
|
|
* Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
* file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
*/
|
|
|
|
#include "catch.hpp"
|
|
#include "catch_self_test.hpp"
|
|
|
|
#include <iostream>
|
|
|
|
TEST_CASE( "./succeeding/Misc/Sections", "random SECTION tests" )
|
|
{
|
|
int a = 1;
|
|
int b = 2;
|
|
|
|
SECTION( "s1", "doesn't equal" )
|
|
{
|
|
REQUIRE( a != b );
|
|
REQUIRE( b != a );
|
|
}
|
|
|
|
SECTION( "s2", "not equal" )
|
|
{
|
|
REQUIRE( a != b);
|
|
}
|
|
}
|
|
|
|
TEST_CASE( "./succeeding/Misc/Sections/nested", "nested SECTION tests" )
|
|
{
|
|
int a = 1;
|
|
int b = 2;
|
|
|
|
SECTION( "s1", "doesn't equal" )
|
|
{
|
|
REQUIRE( a != b );
|
|
REQUIRE( b != a );
|
|
|
|
SECTION( "s2", "not equal" )
|
|
{
|
|
REQUIRE( a != b);
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_CASE( "./mixed/Misc/Sections/nested2", "nested SECTION tests" )
|
|
{
|
|
int a = 1;
|
|
int b = 2;
|
|
|
|
SECTION( "s1", "doesn't equal" )
|
|
{
|
|
SECTION( "s2", "equal" )
|
|
{
|
|
REQUIRE( a == b );
|
|
}
|
|
|
|
SECTION( "s3", "not equal" )
|
|
{
|
|
REQUIRE( a != b );
|
|
}
|
|
SECTION( "s4", "less than" )
|
|
{
|
|
REQUIRE( a < b );
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_CASE( "./Sections/nested/a/b", "nested SECTION tests" )
|
|
{
|
|
SECTION( "c", "" )
|
|
{
|
|
SECTION( "d (leaf)", "" )
|
|
{
|
|
}
|
|
|
|
SECTION( "e (leaf)", "" )
|
|
{
|
|
}
|
|
}
|
|
|
|
SECTION( "f (leaf)", "" )
|
|
{
|
|
}
|
|
}
|
|
|
|
TEST_CASE( "./mixed/Misc/Sections/loops", "looped SECTION tests" )
|
|
{
|
|
int a = 1;
|
|
|
|
for( int b = 0; b < 10; ++b )
|
|
{
|
|
std::ostringstream oss;
|
|
oss << "b is currently: " << b;
|
|
SECTION( "s1", oss.str() )
|
|
{
|
|
CHECK( b > a );
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_CASE( "./mixed/Misc/loops", "looped tests" )
|
|
{
|
|
static const int fib[] = { 1, 1, 2, 3, 5, 8, 13, 21 };
|
|
|
|
for( size_t i=0; i < sizeof(fib)/sizeof(int); ++i )
|
|
{
|
|
INFO( "Testing if fib[" << i << "] (" << fib[i] << ") is even" );
|
|
CHECK( ( fib[i] % 2 ) == 0 );
|
|
}
|
|
}
|
|
|
|
TEST_CASE( "./succeeding/Misc/stdout,stderr", "Sends stuff to stdout and stderr" )
|
|
{
|
|
std::cout << "Some information" << std::endl;
|
|
|
|
std::cerr << "An error" << std::endl;
|
|
}
|
|
|
|
inline const char* makeString( bool makeNull )
|
|
{
|
|
return makeNull ? NULL : "valid string";
|
|
}
|
|
|
|
TEST_CASE( "./succeeding/Misc/null strings", "" )
|
|
{
|
|
REQUIRE( makeString( false ) != static_cast<char*>(NULL));
|
|
REQUIRE( makeString( true ) == static_cast<char*>(NULL));
|
|
}
|
|
|
|
TEST_CASE( "./failing/info", "sends information to INFO" )
|
|
{
|
|
INFO( "hi" );
|
|
int i = 7;
|
|
CAPTURE( i );
|
|
REQUIRE( false );
|
|
}
|
|
|
|
inline bool testCheckedIf( bool flag )
|
|
{
|
|
CHECKED_IF( flag )
|
|
return true;
|
|
else
|
|
return false;
|
|
}
|
|
|
|
TEST_CASE( "./succeeding/checkedif", "" )
|
|
{
|
|
REQUIRE( testCheckedIf( true ) );
|
|
}
|
|
|
|
TEST_CASE( "./failing/checkedif", "" )
|
|
{
|
|
REQUIRE( testCheckedIf( false ) );
|
|
}
|
|
|
|
inline bool testCheckedElse( bool flag )
|
|
{
|
|
CHECKED_ELSE( flag )
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
TEST_CASE( "./succeeding/checkedelse", "" )
|
|
{
|
|
REQUIRE( testCheckedElse( true ) );
|
|
}
|
|
|
|
TEST_CASE( "./failing/checkedelse", "" )
|
|
{
|
|
REQUIRE( testCheckedElse( false ) );
|
|
}
|
|
|
|
TEST_CASE( "./misc/xmlentitycheck", "" )
|
|
{
|
|
SECTION( "embedded xml", "<test>it should be possible to embed xml characters, such as <, \" or &, or even whole <xml>documents</xml> within an attribute</test>" )
|
|
{
|
|
// No test
|
|
}
|
|
SECTION( "encoded chars", "these should all be encoded: &&&\"\"\"<<<&\"<<&\"" )
|
|
{
|
|
// No test
|
|
}
|
|
}
|
|
|
|
TEST_CASE( "./manual/onechar", "send a single char to INFO" )
|
|
{
|
|
INFO(3);
|
|
REQUIRE(false);
|
|
}
|
|
|
|
TEST_CASE("./succeeding/atomic if", "")
|
|
{
|
|
size_t x = 0;
|
|
|
|
if( x )
|
|
REQUIRE(x > 0);
|
|
else
|
|
REQUIRE(x == 0);
|
|
}
|
|
|
|
inline const char* testStringForMatching()
|
|
{
|
|
return "this string contains 'abc' as a substring";
|
|
}
|
|
|
|
TEST_CASE("./succeeding/matchers", "")
|
|
{
|
|
REQUIRE_THAT( testStringForMatching(), Contains( "string" ) );
|
|
CHECK_THAT( testStringForMatching(), Contains( "abc" ) );
|
|
|
|
CHECK_THAT( testStringForMatching(), StartsWith( "this" ) );
|
|
CHECK_THAT( testStringForMatching(), EndsWith( "substring" ) );
|
|
}
|
|
|
|
TEST_CASE("./failing/matchers/Contains", "")
|
|
{
|
|
CHECK_THAT( testStringForMatching(), Contains( "not there" ) );
|
|
}
|
|
|
|
TEST_CASE("./failing/matchers/StartsWith", "")
|
|
{
|
|
CHECK_THAT( testStringForMatching(), StartsWith( "string" ) );
|
|
}
|
|
|
|
TEST_CASE("./failing/matchers/EndsWith", "")
|
|
{
|
|
CHECK_THAT( testStringForMatching(), EndsWith( "this" ) );
|
|
}
|
|
|
|
TEST_CASE("./failing/matchers/Equals", "")
|
|
{
|
|
CHECK_THAT( testStringForMatching(), Equals( "something else" ) );
|
|
}
|
|
TEST_CASE("string", "Equals with NULL")
|
|
{
|
|
REQUIRE_THAT("", Equals(NULL));
|
|
}
|
|
TEST_CASE("./succeeding/matchers/AllOf", "")
|
|
{
|
|
CHECK_THAT( testStringForMatching(), AllOf( Catch::Contains( "string" ), Catch::Contains( "abc" ) ) );
|
|
}
|
|
TEST_CASE("./succeeding/matchers/AnyOf", "")
|
|
{
|
|
CHECK_THAT( testStringForMatching(), AnyOf( Catch::Contains( "string" ), Catch::Contains( "not there" ) ) );
|
|
CHECK_THAT( testStringForMatching(), AnyOf( Catch::Contains( "not there" ), Catch::Contains( "string" ) ) );
|
|
}
|
|
|
|
TEST_CASE("./succeeding/matchers/Equals", "")
|
|
{
|
|
CHECK_THAT( testStringForMatching(), Equals( "this string contains 'abc' as a substring" ) );
|
|
}
|
|
|
|
inline unsigned int Factorial( unsigned int number )
|
|
{
|
|
// return number <= 1 ? number : Factorial(number-1)*number;
|
|
return number > 1 ? Factorial(number-1)*number : 1;
|
|
}
|
|
|
|
TEST_CASE( "Factorials are computed", "[factorial]" ) {
|
|
REQUIRE( Factorial(0) == 1 );
|
|
REQUIRE( Factorial(1) == 1 );
|
|
REQUIRE( Factorial(2) == 2 );
|
|
REQUIRE( Factorial(3) == 6 );
|
|
REQUIRE( Factorial(10) == 3628800 );
|
|
}
|
|
|
|
TEST_CASE( "empty", "An empty test with no assertions" )
|
|
{
|
|
}
|
|
|
|
TEST_CASE( "Nice descriptive name", "[tag1][tag2][tag3][hide]" )
|
|
{
|
|
WARN( "This one ran" );
|
|
}
|
|
TEST_CASE( "first tag", "[tag1]" )
|
|
{
|
|
}
|
|
TEST_CASE( "second tag", "[tag2]" )
|
|
{
|
|
}
|
|
//
|
|
//TEST_CASE( "spawn a new process", "[hide]" )
|
|
//{
|
|
// // !TBD Work in progress
|
|
// char line[200];
|
|
// FILE* output = popen("./CatchSelfTest ./failing/matchers/StartsWith", "r");
|
|
// while ( fgets(line, 199, output) )
|
|
// std::cout << line;
|
|
//}
|
|
|
|
TEST_CASE( "vectors can be sized and resized", "[vector]" ) {
|
|
|
|
std::vector<int> v( 5 );
|
|
|
|
REQUIRE( v.size() == 5 );
|
|
REQUIRE( v.capacity() >= 5 );
|
|
|
|
SECTION( "resizing bigger changes size and capacity", "" ) {
|
|
v.resize( 10 );
|
|
|
|
REQUIRE( v.size() == 10 );
|
|
REQUIRE( v.capacity() >= 10 );
|
|
}
|
|
SECTION( "resizing smaller changes size but not capacity", "" ) {
|
|
v.resize( 0 );
|
|
|
|
REQUIRE( v.size() == 0 );
|
|
REQUIRE( v.capacity() >= 5 );
|
|
|
|
SECTION( "We can use the 'swap trick' to reset the capacity", "" ) {
|
|
std::vector<int> empty;
|
|
empty.swap( v );
|
|
|
|
REQUIRE( v.capacity() == 0 );
|
|
}
|
|
}
|
|
SECTION( "reserving bigger changes capacity but not size", "" ) {
|
|
v.reserve( 10 );
|
|
|
|
REQUIRE( v.size() == 5 );
|
|
REQUIRE( v.capacity() >= 10 );
|
|
}
|
|
SECTION( "reserving smaller does not change size or capacity", "" ) {
|
|
v.reserve( 0 );
|
|
|
|
REQUIRE( v.size() == 5 );
|
|
REQUIRE( v.capacity() >= 5 );
|
|
}
|
|
}
|
|
|
|
// https://github.com/philsquared/Catch/issues/166
|
|
//TEST_CASE("CatchSectionInfiniteLoop", "")
|
|
//{
|
|
// SECTION("Outer", "")
|
|
// SECTION("Inner", "")
|
|
// SUCCEED("that's not flying - that's failing in style");
|
|
//
|
|
// FAIL("to infinity and beyond");
|
|
//}
|