MineSweeper/Mine.cpp at master · moshuiD/MineSweeper · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#include "Mine.h"
#include "Data.h"
#include <queue>
#include <set>
void Mine::SetMine()
{
	srand(time(nullptr));
	for (int i = 0; i < m_MaxX; i++)
	{
		for (int j = 0; j < m_MaxY; j++)
		{
			m_MineMap[{i, j}] = BlockBeInited;
		}
	}

	int unUsedMine = m_MineCount;
	do
	{
		int t_X = rand() % m_MaxX;
		int t_Y = rand() % m_MaxY;
		std::lock_guard lock(m_MineMapMutex);
		if (m_MineMap[{t_X, t_Y}] != BlockHaveMine) {
			m_MineMap[{t_X, t_Y}] = BlockHaveMine;
			unUsedMine--;
			Log("雷在 x:%d y:%d", t_X, t_Y);
		}
	} while (unUsedMine);

	Log("Mine初始化完成");
}

void Mine::ChangeMine()
{
	bool isSet = false;
	do
	{
		int t_X = rand() % m_MaxX;
		int t_Y = rand() % m_MaxY;
		std::lock_guard lock(m_MineMapMutex);
		if (m_MineMap[{t_X, t_Y}] != BlockHaveMine) {
			m_MineMap[{t_X, t_Y}] = BlockHaveMine;
			isSet = true;
			Log("雷重设在 x:%d y:%d", t_X, t_Y);
		}
	} while (!isSet);
}

void Mine::HandleClickBlock(const std::pair<int, int>& pos)
{
	auto blockState = GetBlockStateByPos(pos.first, pos.second);
	if (blockState - (blockState & 0xE0) == BlockMarked) {
		return;
	}
	SetBlockStateByPos(pos, BlockNoMine);
	auto nearNum = GetNearMineNum(pos);
	if (nearNum == 0) {
		std::queue<MinePos> needChangeBlockList;
		std::set<MinePos> processedBlockSet;
		needChangeBlockList.push(pos);

		do {
			auto& curPos = needChangeBlockList.front();

			needChangeBlockList.pop();
			processedBlockSet.insert(curPos);

			SetBlockStateByPos(curPos, BlockNoMine);
			for (int i = -1; i <= 1; i++)
			{
				for (int j = -1; j <= 1; j++)
				{
					if (i == 0 && j == 0) continue;
					MinePos neighborPos = { curPos.first + i, curPos.second + j };
					if (neighborPos.first < 0 || neighborPos.first > m_MaxX) continue;
					if (neighborPos.second < 0 || neighborPos.second > m_MaxY) continue;
					if (processedBlockSet.count(neighborPos) > 0) continue;

					auto nums = GetNearMineNum(neighborPos);
					if (nums == 0) {
						needChangeBlockList.push(neighborPos);
					}
					else {
						SetBlockStateByPos(neighborPos, [&](std::pair<const Mine::MinePos, Mine::BlockState>& v, const Mine::BlockState state) {
							v.second = (Mine::BlockState)(BlockNoMine | nums);
						});
					}
				}
			}
		} while (!needChangeBlockList.empty());
	}
	else {
		SetBlockStateByPos(pos, [&](std::pair<const Mine::MinePos, Mine::BlockState>& v, const Mine::BlockState state) {
			v.second = (Mine::BlockState)(state | nearNum);
		});
	}
	Log("位置: %d %d,周围有 %d 个地雷", pos.first, pos.second, nearNum);
}

int Mine::GetNearMineNum(const std::pair<int, int>& pos)
{
	int count = 0;
	for (int i = -1; i <= 1; i++)
	{
		for (int j = -1; j <= 1; j++)
		{
			if (i == 0 && j == 0) continue;
			auto state = GetBlockStateByPos(pos.first + i, pos.second + j);
			if (state == BlockHaveMine || state == BlockMarkedMine)
			{
				count++;
			}
		}
	}
	return count;

}

Mine::~Mine()
{
	Timer::Stop();
	SetWindowTextA(m_TimeShower, "000");
	Log("Mine被释放一次");
}

Mine::pair<bool, Mine::MinePos> Mine::GetBeClickedMine(const pair<int, int>& clickPoint)
{
	using Data::bitPicSize;
	std::unique_lock lock(m_DisplayMineMapMutex, std::defer_lock);
	lock.lock();
	auto iter = std::find_if(m_DisplayMineMap.begin(), m_DisplayMineMap.end(), [&](const pair<pair<int, int>, MinePos>& v1)->bool {
		if (clickPoint.first > v1.first.first && clickPoint.first < (v1.first.first + bitPicSize)) {
			if (clickPoint.second > v1.first.second && clickPoint.second < (v1.first.second + bitPicSize)) {
				return true;
			}
		}
		return  false;
	});
	lock.unlock();
	if (iter != m_DisplayMineMap.end()) {
		return { true,iter->second };
	}
	else {
		return { false,{-1,-1} };
	}
}