ClassifiedNodes.h

Aller à la documentation de ce fichier.

 
#pragma once
 
#include <unordered_map>
#include <cstdint>
#include <cstddef>
 
enum class NodeClass : uint8_t
{
    TERMINUS,  
    STRAIGHT,  
    SWITCH,    
    CROSSING,  
    ISOLATED,  
    AMBIGUOUS  
};
 
struct ClassifiedNodes
{
    std::unordered_map<size_t, NodeClass> classification;
 
    size_t countTerminus = 0;
    size_t countStraight = 0;
    size_t countSwitch = 0;
    size_t countCrossing = 0;
    size_t countIsolated = 0;
    size_t countAmbiguous = 0;
 
    [[nodiscard]] NodeClass getClass(size_t nodeId) const
    {
        const auto it = classification.find(nodeId);
        return (it != classification.end()) ? it->second : NodeClass::AMBIGUOUS;
    }
 
    void classify(size_t nodeId, NodeClass cls)
    {
        classification[nodeId] = cls;
        switch (cls)
        {
        case NodeClass::TERMINUS:  ++countTerminus;  break;
        case NodeClass::STRAIGHT:  ++countStraight;  break;
        case NodeClass::SWITCH:    ++countSwitch;    break;
        case NodeClass::CROSSING:  ++countCrossing;  break;
        case NodeClass::ISOLATED:  ++countIsolated;  break;
        case NodeClass::AMBIGUOUS: ++countAmbiguous; break;
        }
    }
 
    void clear()
    {
        classification.clear();
        countTerminus = countStraight = countSwitch = 0;
        countCrossing = countIsolated = countAmbiguous = 0;
    }
};