catch2/include/internal/catch_test_case_registry_impl.hpp

208 lines
7.2 KiB
C++
Raw Normal View History

2011-01-07 11:22:24 +01:00
/*
* Created by Phil on 7/1/2011
* 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)
*/
#ifndef TWOBLUECUBES_CATCH_TEST_CASE_REGISTRY_IMPL_HPP_INCLUDED
#define TWOBLUECUBES_CATCH_TEST_CASE_REGISTRY_IMPL_HPP_INCLUDED
2011-01-07 11:22:24 +01:00
#include "catch_test_registry.hpp"
2012-08-14 20:30:30 +02:00
#include "catch_test_case_info.h"
#include "catch_test_spec.hpp"
#include "catch_context.h"
2011-01-07 11:22:24 +01:00
#include <vector>
#include <set>
#include <sstream>
2014-09-16 00:32:13 +02:00
#include <algorithm>
2011-01-07 11:22:24 +01:00
2012-05-16 09:02:20 +02:00
namespace Catch {
2015-08-05 00:11:56 +02:00
struct RandomNumberGenerator {
typedef unsigned int result_type;
result_type operator()( result_type n ) const { return std::rand() % n; }
#ifdef CATCH_CONFIG_CPP11_SHUFFLE
static constexpr result_type (min)() { return 0; }
static constexpr result_type (max)() { return 1000000; }
result_type operator()() const { return std::rand() % (max)(); }
#endif
template<typename V>
static void shuffle( V& vector ) {
RandomNumberGenerator rng;
#ifdef CATCH_CONFIG_CPP11_SHUFFLE
std::shuffle( vector.begin(), vector.end(), rng );
#else
std::random_shuffle( vector.begin(), vector.end(), rng );
#endif
}
2015-08-05 00:11:56 +02:00
};
2015-08-05 00:11:56 +02:00
inline std::vector<TestCase> sortTests( IConfig const& config, std::vector<TestCase> const& unsortedTestCases ) {
2015-08-05 00:11:56 +02:00
std::vector<TestCase> sorted = unsortedTestCases;
2015-08-05 00:11:56 +02:00
switch( config.runOrder() ) {
case RunTests::InLexicographicalOrder:
std::sort( sorted.begin(), sorted.end() );
2015-08-05 00:11:56 +02:00
break;
case RunTests::InRandomOrder:
{
seedRng( config );
RandomNumberGenerator::shuffle( sorted );
2015-08-05 00:11:56 +02:00
}
break;
case RunTests::InDeclarationOrder:
// already in declaration order
break;
}
return sorted;
}
bool matchTest( TestCase const& testCase, TestSpec const& testSpec, IConfig const& config ) {
return testSpec.matches( testCase ) && ( config.allowThrows() || !testCase.throws() );
}
void enforceNoDuplicateTestCases( std::vector<TestCase> const& functions ) {
std::set<TestCase> seenFunctions;
for( std::vector<TestCase>::const_iterator it = functions.begin(), itEnd = functions.end();
it != itEnd;
++it ) {
std::pair<std::set<TestCase>::const_iterator, bool> prev = seenFunctions.insert( *it );
if( !prev.second ) {
std::ostringstream ss;
ss << Colour( Colour::Red )
<< "error: TEST_CASE( \"" << it->name << "\" ) already defined.\n"
<< "\tFirst seen at " << prev.first->getTestCaseInfo().lineInfo << '\n'
<< "\tRedefined at " << it->getTestCaseInfo().lineInfo << std::endl;
throw std::runtime_error(ss.str());
2015-08-05 00:11:56 +02:00
}
}
}
2015-08-05 00:11:56 +02:00
std::vector<TestCase> filterTests( std::vector<TestCase> const& testCases, TestSpec const& testSpec, IConfig const& config ) {
std::vector<TestCase> filtered;
filtered.reserve( testCases.size() );
for( std::vector<TestCase>::const_iterator it = testCases.begin(), itEnd = testCases.end();
it != itEnd;
++it )
if( matchTest( *it, testSpec, config ) )
filtered.push_back( *it );
2015-08-05 00:11:56 +02:00
return filtered;
}
std::vector<TestCase> const& getAllTestCasesSorted( IConfig const& config ) {
return getRegistryHub().getTestCaseRegistry().getAllTestsSorted( config );
}
2015-08-05 00:11:56 +02:00
class TestRegistry : public ITestCaseRegistry {
2011-01-07 11:22:24 +01:00
public:
TestRegistry()
: m_currentSortOrder( RunTests::InDeclarationOrder ),
2015-12-09 19:11:48 +01:00
m_unnamedCount( 0 )
{}
virtual ~TestRegistry();
virtual void registerTest( TestCase const& testCase ) {
std::string name = testCase.getTestCaseInfo().name;
if( name.empty() ) {
std::ostringstream oss;
2013-03-16 21:18:52 +01:00
oss << "Anonymous test case " << ++m_unnamedCount;
return registerTest( testCase.withName( oss.str() ) );
}
2015-08-05 00:11:56 +02:00
m_functions.push_back( testCase );
2011-01-07 11:22:24 +01:00
}
virtual std::vector<TestCase> const& getAllTests() const {
2015-08-05 00:11:56 +02:00
return m_functions;
2011-01-07 11:22:24 +01:00
}
2015-08-05 00:11:56 +02:00
virtual std::vector<TestCase> const& getAllTestsSorted( IConfig const& config ) const {
if( m_sortedFunctions.empty() )
enforceNoDuplicateTestCases( m_functions );
2015-08-05 00:11:56 +02:00
if( m_currentSortOrder != config.runOrder() || m_sortedFunctions.empty() ) {
m_sortedFunctions = sortTests( config, m_functions );
m_currentSortOrder = config.runOrder();
}
2015-08-05 00:11:56 +02:00
return m_sortedFunctions;
}
private:
2015-08-05 00:11:56 +02:00
std::vector<TestCase> m_functions;
mutable RunTests::InWhatOrder m_currentSortOrder;
mutable std::vector<TestCase> m_sortedFunctions;
size_t m_unnamedCount;
std::ios_base::Init m_ostreamInit; // Forces cout/ cerr to be initialised
2011-01-07 11:22:24 +01:00
};
2011-01-28 19:56:26 +01:00
///////////////////////////////////////////////////////////////////////////
2012-08-14 09:38:22 +02:00
class FreeFunctionTestCase : public SharedImpl<ITestCase> {
2012-05-10 22:46:46 +02:00
public:
FreeFunctionTestCase( TestFunction fun ) : m_fun( fun ) {}
2012-08-14 09:38:22 +02:00
2012-05-10 22:46:46 +02:00
virtual void invoke() const {
2011-01-31 11:10:20 +01:00
m_fun();
2011-01-07 11:22:24 +01:00
}
2012-08-14 09:38:22 +02:00
2011-01-07 11:22:24 +01:00
private:
2012-08-14 09:38:22 +02:00
virtual ~FreeFunctionTestCase();
2011-01-31 11:10:20 +01:00
TestFunction m_fun;
2011-01-07 11:22:24 +01:00
};
inline std::string extractClassName( std::string const& classOrQualifiedMethodName ) {
std::string className = classOrQualifiedMethodName;
if( startsWith( className, '&' ) )
{
std::size_t lastColons = className.rfind( "::" );
std::size_t penultimateColons = className.rfind( "::", lastColons-1 );
if( penultimateColons == std::string::npos )
penultimateColons = 1;
className = className.substr( penultimateColons, lastColons-penultimateColons );
}
return className;
}
void registerTestCase
( ITestCase* testCase,
char const* classOrQualifiedMethodName,
NameAndDesc const& nameAndDesc,
SourceLineInfo const& lineInfo ) {
2015-12-04 11:20:33 +01:00
getMutableRegistryHub().registerTest
( makeTestCase
( testCase,
extractClassName( classOrQualifiedMethodName ),
nameAndDesc.name,
nameAndDesc.description,
lineInfo ) );
}
void registerTestCaseFunction
( TestFunction function,
SourceLineInfo const& lineInfo,
NameAndDesc const& nameAndDesc ) {
registerTestCase( new FreeFunctionTestCase( function ), "", nameAndDesc, lineInfo );
}
2015-12-04 11:20:33 +01:00
2011-01-07 11:22:24 +01:00
///////////////////////////////////////////////////////////////////////////
AutoReg::AutoReg
( TestFunction function,
SourceLineInfo const& lineInfo,
NameAndDesc const& nameAndDesc ) {
registerTestCaseFunction( function, lineInfo, nameAndDesc );
}
2012-05-10 22:46:46 +02:00
AutoReg::~AutoReg() {}
2011-01-07 11:22:24 +01:00
} // end namespace Catch
#endif // TWOBLUECUBES_CATCH_TEST_CASE_REGISTRY_IMPL_HPP_INCLUDED