distances.h

Go to the documentation of this file.

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