/*  
 *  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_SECTION_INFO_HPP_INCLUDED
#define TWOBLUECUBES_CATCH_SECTION_INFO_HPP_INCLUDED

#include "catch_common.h"

#include <map>
#include <string>

namespace Catch {

    struct ISectionInfo {
        virtual ~ISectionInfo() {}

        virtual std::string getName() const = 0;
        virtual const ISectionInfo* getParent() const = 0;
    };

    class SectionInfo : ISectionInfo {
    public:
    
        enum State {
            Root,
            Unknown,
            Branch,
            TestedBranch,
            TestedLeaf
        };
        
        SectionInfo( SectionInfo* parent, const std::string& name )
        :   m_state( Unknown ),
            m_parent( parent ),
            m_name( name )
        {}
        
        SectionInfo( const std::string& name )
        :   m_state( Root ),
            m_parent( NULL ),
            m_name( name )
        {}
        
        ~SectionInfo() {
            deleteAllValues( m_subSections );
        }

        virtual std::string getName() const {
            return m_name;
        }

        bool shouldRun() const {
            return m_state < TestedBranch;
        }
        
        bool isBranch() const {
            return m_state == Branch;
        }

        const SectionInfo* getParent() const {
            return m_parent;
        }

        bool hasUntestedSections() const {
            if( m_state == Unknown )
                return true;
            
            std::map<std::string, SectionInfo*>::const_iterator it = m_subSections.begin();
            std::map<std::string, SectionInfo*>::const_iterator itEnd = m_subSections.end();
            for(; it != itEnd; ++it ) {
                if( it->second->hasUntestedSections() )
                    return true;
            }
            return false;
        }

        // Mutable methods:

        SectionInfo* getParent() {
            return m_parent;
        }

        SectionInfo* findOrAddSubSection( const std::string& name, bool& changed ) {
            std::map<std::string, SectionInfo*>::const_iterator it = m_subSections.find( name );
            if( it != m_subSections.end() )
                return it->second;
            SectionInfo* subSection = new SectionInfo( this, name );
            m_subSections.insert( std::make_pair( name, subSection ) );
            m_state = Branch;
            changed = true;
            return subSection;
        }

        bool ran() {
            if( m_state < Branch ) {
                m_state = TestedLeaf;
                return true;
            }
            return false;
        }

        void ranToCompletion() {
            if( m_state == Branch && !hasUntestedSections() )
                m_state = TestedBranch;
        }

    private:
        State m_state;
        SectionInfo* m_parent;
        std::string m_name;
        std::map<std::string, SectionInfo*> m_subSections;
    };
}

#endif // TWOBLUECUBES_CATCH_SECTION_INFO_HPP_INCLUDED