unique_queue.h

Go to the documentation of this file.

 
 
#include <robin_hood.h>
#include <queue>
#include <node.h>
 
#ifndef UNIQUE_QUEUE_INCLUDE_GUARD
#define UNIQUE_QUEUE_INCLUDE_GUARD
 
namespace HF::GraphGenerator {
 
    class UniqueQueue {
    private:
        std::queue<HF::SpatialStructures::Node> node_queue;                     
        robin_hood::unordered_map<HF::SpatialStructures::Node, int> hashmap;
 
    public:
 
 
        bool push(const HF::SpatialStructures::Node& p);
 
 
        HF::SpatialStructures::Node pop();
 
        int size() const;
 
        HF::SpatialStructures::Node popFromDict();
 
        bool hasNode(const HF::SpatialStructures::Node& p) const;
 
        bool forcePush(const HF::SpatialStructures::Node& p);
 
        bool empty() const;
 
        void clearQueue();
 
 
        std::vector<SpatialStructures::Node> popMany(int max = -1);
        template <typename arr_type>
        inline bool PushAny(const arr_type& node) {
            auto node_to_push = Node(
                static_cast<float>(node[0]),
                static_cast<float>(node[1]),
                static_cast<float>(node[2])
            );
            
            return this->push(node_to_push);
        }
    };
}
#endif