mirror of
https://github.com/catchorg/Catch2.git
synced 2024-12-23 11:43:29 +01:00
ccf7f2842a
Catch passes an RNG which accepts int to random_shuffle. Inside random_shuffle, the STL tries to call that RNG with the difference_type of the user provided iterators. For std::vector, this is ptrdiff_t, which on amd64 builds is wider than int. This triggers a narrowing warning because the 64 bit difference is being truncated to 32 bits. Note that this RNG implementation still does not produce a correctly uniformly shuffled result -- it's currently asserting that std::rand can produce 1000000 which is false -- but I don't know enough about how much repeatable shuffles are necessary here, so I'm leaving that alone for now.
212 lines
7.3 KiB
C++
212 lines
7.3 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 <iostream>
|
|
#include <algorithm>
|
|
|
|
#ifdef CATCH_CPP14_OR_GREATER
|
|
#include <random>
|
|
#endif
|
|
|
|
namespace Catch {
|
|
|
|
struct RandomNumberGenerator {
|
|
typedef std::ptrdiff_t result_type;
|
|
|
|
result_type operator()( result_type n ) const { return std::rand() % n; }
|
|
|
|
#ifdef CATCH_CPP14_OR_GREATER
|
|
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_CPP14_OR_GREATER
|
|
std::shuffle( vector.begin(), vector.end(), rng );
|
|
#else
|
|
std::random_shuffle( vector.begin(), vector.end(), rng );
|
|
#endif
|
|
}
|
|
};
|
|
|
|
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( 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());
|
|
}
|
|
}
|
|
}
|
|
|
|
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 );
|
|
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 == "" ) {
|
|
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
|