mirror of
https://github.com/catchorg/Catch2.git
synced 2024-11-04 05:09:53 +01:00
71df66365e
All C++11 toggles are now removed. What is left is either platform specific (POSIX_SIGNALS, WINDOWS_SEH), or possibly still needed (USE_COUNTER). If current CLion is compatible with `__COUNTER__`, then we should also force `__COUNTER__` usage. Changed * CATCH_AUTO_PTR -> std::unique_ptr * CATCH_OVERRIDE -> override * CATCH_NULL -> nullptr * CATCH_NOEXCEPT -> noexcept * CATCH_NOEXCEPT_IS -> noexcept Removed * CATCH_CONFIG_CPP11_UNIQUE_PTR * CATCH_CONFIG_CPP11_SHUFFLE * CATCH_CONFIG_CPP11_TYPE_TRAITS * CATCH_CONFIG_CPP11_OVERRIDE * CATCH_CONFIG_CPP11_LONG_LONG * CATCH_CONFIG_CPP11_TUPLE * CATCH_CONFIG_CPP11_IS_ENUM * CATCH_CONFIG_CPP11_GENERATED_METHODS * CATCH_CONFIG_CPP11_NOEXCEPT * CATCH_CONFIG_CPP11_NULLPTR * CATCH_CONFIG_VARIADIC_MACROS
198 lines
6.9 KiB
C++
198 lines
6.9 KiB
C++
/*
|
|
* 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
|
|
|
|
#include "catch_test_registry.hpp"
|
|
#include "catch_test_case_info.h"
|
|
#include "catch_test_spec.hpp"
|
|
#include "catch_context.h"
|
|
|
|
#include <vector>
|
|
#include <set>
|
|
#include <sstream>
|
|
#include <algorithm>
|
|
|
|
|
|
namespace Catch {
|
|
|
|
struct RandomNumberGenerator {
|
|
typedef std::ptrdiff_t result_type;
|
|
|
|
result_type operator()( result_type n ) const { return std::rand() % n; }
|
|
|
|
static constexpr result_type min() { return 0; }
|
|
static constexpr result_type max() { return 1000000; }
|
|
result_type operator()() const { return std::rand() % max(); }
|
|
template<typename V>
|
|
static void shuffle( V& vector ) {
|
|
RandomNumberGenerator rng;
|
|
std::shuffle( vector.begin(), vector.end(), rng );
|
|
}
|
|
};
|
|
|
|
inline std::vector<TestCase> sortTests( IConfig const& config, std::vector<TestCase> const& unsortedTestCases ) {
|
|
|
|
std::vector<TestCase> sorted = unsortedTestCases;
|
|
|
|
switch( config.runOrder() ) {
|
|
case RunTests::InLexicographicalOrder:
|
|
std::sort( sorted.begin(), sorted.end() );
|
|
break;
|
|
case RunTests::InRandomOrder:
|
|
{
|
|
seedRng( config );
|
|
RandomNumberGenerator::shuffle( sorted );
|
|
}
|
|
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( auto const function : functions ) {
|
|
std::pair<std::set<TestCase>::const_iterator, bool> prev = seenFunctions.insert( function );
|
|
if( !prev.second ) {
|
|
std::ostringstream ss;
|
|
|
|
ss << Colour( Colour::Red )
|
|
<< "error: TEST_CASE( \"" << function.name << "\" ) already defined.\n"
|
|
<< "\tFirst seen at " << prev.first->getTestCaseInfo().lineInfo << '\n'
|
|
<< "\tRedefined at " << function.getTestCaseInfo().lineInfo << std::endl;
|
|
|
|
throw std::runtime_error(ss.str());
|
|
}
|
|
}
|
|
}
|
|
|
|
std::vector<TestCase> filterTests( std::vector<TestCase> const& testCases, TestSpec const& testSpec, IConfig const& config ) {
|
|
std::vector<TestCase> filtered;
|
|
filtered.reserve( testCases.size() );
|
|
for( auto const& testCase : testCases )
|
|
if( matchTest( testCase, testSpec, config ) )
|
|
filtered.push_back( testCase );
|
|
return filtered;
|
|
}
|
|
std::vector<TestCase> const& getAllTestCasesSorted( IConfig const& config ) {
|
|
return getRegistryHub().getTestCaseRegistry().getAllTestsSorted( config );
|
|
}
|
|
|
|
class TestRegistry : public ITestCaseRegistry {
|
|
public:
|
|
TestRegistry()
|
|
: m_currentSortOrder( RunTests::InDeclarationOrder ),
|
|
m_unnamedCount( 0 )
|
|
{}
|
|
virtual ~TestRegistry();
|
|
|
|
virtual void registerTest( TestCase const& testCase ) {
|
|
std::string name = testCase.getTestCaseInfo().name;
|
|
if( name.empty() ) {
|
|
std::ostringstream oss;
|
|
oss << "Anonymous test case " << ++m_unnamedCount;
|
|
return registerTest( testCase.withName( oss.str() ) );
|
|
}
|
|
m_functions.push_back( testCase );
|
|
}
|
|
|
|
virtual std::vector<TestCase> const& getAllTests() const {
|
|
return m_functions;
|
|
}
|
|
virtual std::vector<TestCase> const& getAllTestsSorted( IConfig const& config ) const {
|
|
if( m_sortedFunctions.empty() )
|
|
enforceNoDuplicateTestCases( m_functions );
|
|
|
|
if( m_currentSortOrder != config.runOrder() || m_sortedFunctions.empty() ) {
|
|
m_sortedFunctions = sortTests( config, m_functions );
|
|
m_currentSortOrder = config.runOrder();
|
|
}
|
|
return m_sortedFunctions;
|
|
}
|
|
|
|
private:
|
|
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
|
|
};
|
|
|
|
///////////////////////////////////////////////////////////////////////////
|
|
|
|
class FreeFunctionTestCase : public SharedImpl<ITestCase> {
|
|
public:
|
|
|
|
FreeFunctionTestCase( TestFunction fun ) : m_fun( fun ) {}
|
|
|
|
virtual void invoke() const {
|
|
m_fun();
|
|
}
|
|
|
|
private:
|
|
virtual ~FreeFunctionTestCase();
|
|
|
|
TestFunction m_fun;
|
|
};
|
|
|
|
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 ) {
|
|
|
|
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 );
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////
|
|
|
|
AutoReg::AutoReg
|
|
( TestFunction function,
|
|
SourceLineInfo const& lineInfo,
|
|
NameAndDesc const& nameAndDesc ) {
|
|
registerTestCaseFunction( function, lineInfo, nameAndDesc );
|
|
}
|
|
|
|
AutoReg::~AutoReg() {}
|
|
|
|
} // end namespace Catch
|
|
|
|
|
|
#endif // TWOBLUECUBES_CATCH_TEST_CASE_REGISTRY_IMPL_HPP_INCLUDED
|