118 lines
3.7 KiB
C++
118 lines
3.7 KiB
C++
/*
|
|
* Created by Phil Nash on 4/5/2012
|
|
* Copyright 2012 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_RUNNING_TEST_HPP_INCLUDED
|
|
#define TWOBLUECUBES_CATCH_RUNNING_TEST_HPP_INCLUDED
|
|
|
|
#include "catch_test_case_info.h"
|
|
#include "catch_section_info.hpp"
|
|
|
|
namespace Catch {
|
|
|
|
class RunningTest {
|
|
|
|
enum RunStatus {
|
|
NothingRun,
|
|
EncounteredASection,
|
|
RanAtLeastOneSection,
|
|
RanToCompletionWithSections,
|
|
RanToCompletionWithNoSections
|
|
};
|
|
|
|
public:
|
|
explicit RunningTest( const TestCase& info )
|
|
: m_info( info ),
|
|
m_runStatus( RanAtLeastOneSection ),
|
|
m_rootSection( info.getTestCaseInfo().name ),
|
|
m_currentSection( &m_rootSection ),
|
|
m_changed( false )
|
|
{}
|
|
|
|
bool wasSectionSeen() const {
|
|
return m_runStatus == RanAtLeastOneSection ||
|
|
m_runStatus == RanToCompletionWithSections;
|
|
}
|
|
|
|
bool isBranchSection() const {
|
|
return m_currentSection &&
|
|
m_currentSection->isBranch();
|
|
}
|
|
|
|
bool hasSections() const {
|
|
return m_runStatus == RanAtLeastOneSection ||
|
|
m_runStatus == RanToCompletionWithSections ||
|
|
m_runStatus == EncounteredASection;
|
|
}
|
|
|
|
void reset() {
|
|
m_runStatus = NothingRun;
|
|
m_changed = false;
|
|
m_lastSectionToRun = NULL;
|
|
}
|
|
|
|
void ranToCompletion() {
|
|
if( m_runStatus != RanAtLeastOneSection && m_runStatus != EncounteredASection )
|
|
m_runStatus = RanToCompletionWithNoSections;
|
|
m_runStatus = RanToCompletionWithSections;
|
|
if( m_lastSectionToRun ) {
|
|
m_lastSectionToRun->ranToCompletion();
|
|
m_changed = true;
|
|
}
|
|
}
|
|
|
|
bool addSection( const std::string& name ) {
|
|
if( m_runStatus == NothingRun )
|
|
m_runStatus = EncounteredASection;
|
|
|
|
RunningSection* thisSection = m_currentSection->findOrAddSubSection( name, m_changed );
|
|
|
|
if( !wasSectionSeen() && thisSection->shouldRun() ) {
|
|
m_currentSection = thisSection;
|
|
m_lastSectionToRun = NULL;
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void endSection( const std::string&, bool stealth ) {
|
|
if( m_currentSection->ran() ) {
|
|
if( !stealth )
|
|
m_runStatus = RanAtLeastOneSection;
|
|
m_changed = true;
|
|
}
|
|
else if( m_runStatus == EncounteredASection ) {
|
|
if( !stealth )
|
|
m_runStatus = RanAtLeastOneSection;
|
|
m_lastSectionToRun = m_currentSection;
|
|
}
|
|
m_currentSection = m_currentSection->getParent();
|
|
}
|
|
|
|
const TestCase& getTestCase() const {
|
|
return m_info;
|
|
}
|
|
|
|
bool hasUntestedSections() const {
|
|
return m_runStatus == RanAtLeastOneSection ||
|
|
( m_rootSection.hasUntestedSections() && m_changed );
|
|
}
|
|
|
|
private:
|
|
RunningTest( RunningTest const& );
|
|
void operator=( RunningTest const& );
|
|
|
|
const TestCase& m_info;
|
|
RunStatus m_runStatus;
|
|
RunningSection m_rootSection;
|
|
RunningSection* m_currentSection;
|
|
RunningSection* m_lastSectionToRun;
|
|
bool m_changed;
|
|
};
|
|
}
|
|
|
|
#endif // TWOBLUECUBES_CATCH_RUNNING_TEST_HPP_INCLUDED
|