Explorer.h

[詳解]

#ifndef __EXPLORER__
#define __EXPLORER__

#include "Node.h"
#include <algorithm>
#include <array>
#include <cstdlib>
#include <vector>

class Explorer {
  struct Position {
    std::int8_t x;
    std::int8_t y;
    Position() : x(0), y(0) {}
  };

 public:
  Explorer()
    : blockAreaNodeList(nullptr), neighborPtrs(TOTAL_NODE_COUNT), neighborsIDList(TOTAL_NODE_COUNT)
  {
    // 隣接ノードIDのリスト
    std::vector<std::array<std::int8_t, MAX_NEIGHBOR_COUNT>> neighborsIDList_{
      { { 1, 4, EMPTY_ID, EMPTY_ID },
        { 0, 2, 5, EMPTY_ID },
        { 1, 3, 6, EMPTY_ID },
        { 2, 7, EMPTY_ID, EMPTY_ID },

        { 0, 5, 8, EMPTY_ID },
        { 1, 4, 6, 9 },
        { 2, 5, 7, 10 },
        { 3, 6, 11, EMPTY_ID },

        { 4, 9, 12, EMPTY_ID },
        { 5, 8, 10, 13 },
        { 6, 9, 11, 14 },
        { 7, 10, 15, EMPTY_ID },

        { 8, 13, EMPTY_ID, EMPTY_ID },
        { 9, 12, 14, EMPTY_ID },
        { 10, 13, 15, EMPTY_ID },
        { 11, 14, EMPTY_ID, EMPTY_ID } }
    };

    // 相対的なノード位置のリスト
    std::vector<std::array<std::int8_t, 2>> currentPosition
        = { { 0, 0 }, { 1, 0 }, { 2, 0 }, { 3, 0 },

            { 0, 1 }, { 1, 1 }, { 2, 1 }, { 3, 1 },

            { 0, 2 }, { 1, 2 }, { 2, 2 }, { 3, 2 },

            { 0, 3 }, { 1, 3 }, { 2, 3 }, { 3, 3 } };

    //
    // 以降は触れなくてよい
    //

    for(unsigned int i = 0; i < neighborsIDList_.size(); i++) {
      neighborsIDList[i] = neighborsIDList_[i];
    }

    for(unsigned int i = 0; i < neighborsIDList.size(); i++) {
      Position position;
      position.x = currentPosition[i][0];
      position.y = currentPosition[i][1];
      positionList.push_back(position);
    }
  }

  void createBlockArea();

  void resetBlockArea();

  void setHasBlockIn(std::int8_t blockID);

  bool hasBlock(std::int8_t id);

  std::vector<int> searchRoute(std::int8_t start, std::int8_t end);

  Node* calculateNeighborCost(Node* parent, std::vector<Node*>* around, std::int32_t realCost,
                              std::int8_t end);

  std::vector<Node*>* getBlockAreaNodeList();

 private:
  std::vector<Node*>* blockAreaNodeList;

  std::vector<Position> positionList;

  const std::int8_t EMPTY_ID = -1;

  static const std::int8_t TOTAL_NODE_COUNT = 16;

  static const std::int8_t MAX_NEIGHBOR_COUNT = 4;

  std::vector<Node> nodeList;

  std::vector<Node*> nodePtrs;

  std::vector<std::vector<Node*>> neighborPtrs;

  std::vector<std::array<std::int8_t, MAX_NEIGHBOR_COUNT>> neighborsIDList;
};

#endif  // EXPLORER