Selector.h

[詳解]

#ifndef __SELECTOR__
#define __SELECTOR__

#include "Explorer.h"
#include <algorithm>
#include <cstdlib>
#include <deque>
#include <vector>

class Selector {
 public:
  Selector()
    : blockPositionList(MAX_BLOCK_COUNT),
      movedBlockPositionList(MAX_BLOCK_COUNT, EMPTY_ID),
      evacuatedBlockPositionList(MAX_BLOCK_COUNT, EMPTY_ID),
      nodePositionCostList(TOTAL_NODE_COUNT),
      routeBeforeOne_(TOTAL_NODE_COUNT, EMPTY_ID)
  {
    // 各ノードにおける位置コストのリスト
    std::vector<int> nodePositionCostList_{ { 4, 3, 3, 4, 3, 2, 2, 3, 1, 2, 2, 3, 4, 3, 3, 4 } };

    for(unsigned int i = 0; i < nodePositionCostList_.size(); i++)
      nodePositionCostList[i] = nodePositionCostList_[i];

    explorer.createBlockArea();
  }

  enum NextOperationOfSearchingRouteIs { Evacuating, Moving, Carrying };

  enum BlockColor { Blue, Red, Yellow, Green, Undefined };

  std::vector<int> exploreNextOperation(std::int8_t currentPosition, BlockColor color);

  std::int8_t searchBlockPosition(std::int8_t currentPosition);

  std::int8_t searchMostPoorCostShelter(std::int8_t currentPosition);

  bool isAlreadyMovedNode(std::int8_t position);

  bool isAlreadyAllBlockMoved();

  void changeBlockPosition(std::int8_t beforePosition, std::int8_t afterPosition);

  void setBlockPositionList(std::vector<std::int8_t> list);

  std::vector<std::int8_t> getBlockPositionList();

  void addMovedBlockPosition(std::int8_t position);

  void pushEvacuatedBlockPosition(std::int8_t position);

  std::int8_t popEvacuatedBlockPosition();

  bool canFindBlockInEvacuatedList(std::int8_t position);

  void prepareSearching(std::vector<std::int8_t> list);

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

  void setNext(NextOperationOfSearchingRouteIs next);

  bool isEvacuatingWithNext();

  bool isMovingWithNext();

  bool isCarryingWithNext();

  bool isBacksteppingBeforeNextOperation();

  bool isBackstepping();

  std::int8_t getPositionOfCenterQuadirilateral(BlockColor color);

  [[deprecated("memory is enlarged if this is used!!!")]] void updateRoute(std::vector<int> route);

  std::vector<int> extractRoute();

 private:
  static const std::int8_t TOTAL_NODE_COUNT = 16;

  static const std::int8_t MAX_BLOCK_COUNT = 4;

  const std::int8_t EMPTY_ID = -1;

  bool evacuatingFlag = false;

  bool movingFlag = false;

  bool carryingFlag = false;

  bool backsteppingFlag = false;

  bool backsteppingBeforeNextOeperationFlag = false;

  bool isCarriedToShelter = false;

  bool isClearGame = false;

  std::int8_t movedCount = 0;

  std::int8_t evacuatedSize = 0;

  std::int8_t lastBlock = EMPTY_ID;

  std::vector<std::int8_t> blockPositionList;

  std::vector<std::int8_t> movedBlockPositionList;

  std::deque<std::int8_t> evacuatedBlockPositionList;

  std::vector<int> nodePositionCostList;

  std::vector<int> routeBeforeOne_;

  Explorer explorer;
};

#endif  // SELECTOR