distances.h

Go to the documentation of this file.

#ifndef DISTANCES_H
#define DISTANCES_H
 
#include <cstdint>
#include <memory>
#include <unordered_map>
#include <vector>
 
#include <MazeBuilder/cell.h>
#include <MazeBuilder/grid_interface.h>
 
namespace mazes
{
    class grid_interface;
 
    class distances
    {
    public:
        explicit distances(std::int32_t root_index);
 
        int& operator[](std::int32_t index) noexcept;
 
        const int& operator[](std::int32_t index) const noexcept;
 
        void set(std::int32_t index, int distance) noexcept;
 
        [[nodiscard]] bool contains(std::int32_t index) const noexcept;
 
        [[nodiscard]] std::pair<std::int32_t, int> max() const noexcept;
 
        void collect_keys(std::vector<std::int32_t>& indices) const noexcept;
 
        static std::shared_ptr<distances> path_to(grid_interface* g, std::int32_t start_index,
                                                  std::int32_t goal_index) noexcept;
 
    private:
        std::unordered_map<std::int32_t, int> m_cells;
 
        std::int32_t m_root_index;
    }; // class distances
} // namespace mazes
 
#endif // DISTANCES_H