lab.h

Go to the documentation of this file.

#ifndef LAB_H
#define LAB_H
 
#include <memory>
#include <optional>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
 
#include <MazeBuilder/hash_funcs.h>
 
namespace mazes {
 
class cell;
class configurator;
 
 
class lab {
public:
    explicit lab();
 
    // Destructor
    ~lab();
 
    // Copy constructor
    lab(const lab& other);
 
    // Copy assignment operator
    lab& operator=(const lab& other);
 
    // Move constructor
    lab(lab&& other) noexcept = default;
 
    // Move assignment operator
    lab& operator=(lab&& other) noexcept = default;
 
    std::optional<std::tuple<int, int, int, int>> find(int p, int q) const noexcept;
    std::optional<std::tuple<int, int, int, int>> find(int p, int q, int r) const noexcept;
 
    void insert(int x, int y, int z, int w) noexcept;
 
    bool empty() const noexcept;
 
    int get_levels() const noexcept;
    void set_levels(int levels) noexcept;
 
    int get_random_block_id() const noexcept;
 
    static void link(const std::shared_ptr<cell>& c1, const std::shared_ptr<cell>& c2, bool bidi = true) noexcept;
 
    static void unlink(const std::shared_ptr<cell>& c1, const std::shared_ptr<cell>& c2, bool bidi = true) noexcept;
 
    static void set_neighbors(configurator const& config, const std::vector<int>& indices, std::vector<std::shared_ptr<cell>>& cells_to_set) noexcept;
private:
 
    int calculate_cell_index(unsigned int row, unsigned int col, unsigned int level, unsigned int rows, unsigned int columns) const noexcept;
 
 
    using pqmap = std::unordered_map<std::pair<int, int>, std::tuple<int, int, int, int>, pair_hash>;
    pqmap m_p_q;
 
    int levels;
};
}
 
#endif // LAB_H