backtracking_strategy.hpp

Go to the documentation of this file.

#pragma once
 
#include <cstddef>
#include <limits>
#include <string>
 
#include "gsl/pointers"
 
#include "porytiles/domain/config/search_algorithm.hpp"
#include "porytiles/domain/packing/services/packing_strategy.hpp"
#include "porytiles/utilities/result/chainable_result.hpp"
#include "porytiles/xcut/diagnostics/user_diagnostics.hpp"
 
namespace porytiles {
 
class BacktrackingStrategy final : public PackingStrategy {
  public:
    BacktrackingStrategy() = default;
 
    explicit BacktrackingStrategy(gsl::not_null<const UserDiagnostics *> diag) : diag_{diag} {}
 
    explicit BacktrackingStrategy(
        SearchAlgorithm algorithm,
        std::size_t node_cutoff,
        std::size_t best_branches,
        bool smart_prune,
        const UserDiagnostics *diag = nullptr)
        : use_preset_matrix_{false}, algorithm_{algorithm}, node_cutoff_{node_cutoff}, best_branches_{best_branches},
          smart_prune_{smart_prune}, diag_{diag}
    {
    }
 
    [[nodiscard]] ChainableResult<PackingOutput> pack(const PackingInput &input) const override;
 
    [[nodiscard]] std::string name() const override
    {
        return "Backtracking";
    }
 
  private:
    bool use_preset_matrix_ = true;
    SearchAlgorithm algorithm_ = SearchAlgorithm::dfs;
    std::size_t node_cutoff_ = 1'000'000;
    std::size_t best_branches_ = std::numeric_limits<std::size_t>::max();
    bool smart_prune_ = true;
    const UserDiagnostics *diag_ = nullptr;
};
 
} // namespace porytiles