cell.h

Go to the documentation of this file.

#ifndef CELL_H
#define CELL_H
 
#include <cstdint>
#include <memory>
#include <shared_mutex>
#include <unordered_map>
#include <vector>
 
#include <MazeBuilder/hash_funcs.h>
 
namespace mazes {
 
class cell final {
public:
    explicit cell(std::int32_t index = 0);
 
    ~cell();
 
    cell(const cell& other);
 
    cell& operator=(const cell& other);
 
    cell(cell&& other) noexcept;
 
    cell& operator=(cell&& other) noexcept;
 
    void add_link(const std::shared_ptr<cell>& other);
 
    void remove_link(const std::shared_ptr<cell>& other);
 
    std::vector<std::pair<std::shared_ptr<cell>, bool>> get_links() const;
 
    bool is_linked(const std::shared_ptr<cell>& c);
 
    int32_t get_index() const noexcept;
 
    void set_index(std::int32_t next_index) noexcept;
 
    void cleanup_links();
 
private:
 
    struct weak_ptr_equal {
 
        template <typename T>
        bool operator()(const std::weak_ptr<T>& lhs, const std::weak_ptr<T>& rhs) const {
 
            return !lhs.owner_before(rhs) && !rhs.owner_before(lhs);
        }
    };
 
    bool has_key(const std::shared_ptr<cell>& c);
 
    std::unordered_map<std::weak_ptr<cell>, bool, weak_ptr_hash, weak_ptr_equal> m_links;
 
    mutable std::shared_mutex m_links_mutex;
 
    std::int32_t m_index;
};
 
} // namespace mazes
 
#endif // CELL_H