CardStack.cpp 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367
  1. /*
  2. * Copyright (c) 2020, Till Mayer <till.mayer@web.de>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include "CardStack.h"
  7. namespace Cards {
  8. CardStack::CardStack()
  9. : m_position({ 0, 0 })
  10. , m_type(Type::Invalid)
  11. , m_base(m_position, { Card::width, Card::height })
  12. {
  13. }
  14. CardStack::CardStack(Gfx::IntPoint position, Type type, RefPtr<CardStack> covered_stack)
  15. : m_covered_stack(move(covered_stack))
  16. , m_position(position)
  17. , m_type(type)
  18. , m_rules(rules_for_type(type))
  19. , m_base(m_position, { Card::width, Card::height })
  20. {
  21. VERIFY(type != Type::Invalid);
  22. calculate_bounding_box();
  23. }
  24. void CardStack::clear()
  25. {
  26. m_stack.clear();
  27. m_stack_positions.clear();
  28. }
  29. void CardStack::paint(GUI::Painter& painter, Gfx::Color background_color)
  30. {
  31. auto draw_background_if_empty = [&]() {
  32. size_t number_of_moving_cards = 0;
  33. for (auto const& card : m_stack)
  34. number_of_moving_cards += card->is_moving() ? 1 : 0;
  35. if (m_covered_stack && !m_covered_stack->is_empty())
  36. return false;
  37. if (!is_empty() && (m_stack.size() != number_of_moving_cards))
  38. return false;
  39. auto paint_rect = m_base;
  40. painter.fill_rect_with_rounded_corners(paint_rect, background_color.darkened(0.5), Card::card_radius);
  41. paint_rect.shrink(2, 2);
  42. if (m_highlighted) {
  43. auto background_complement = background_color.xored(Color::White);
  44. painter.fill_rect_with_rounded_corners(paint_rect, background_complement, Card::card_radius - 1);
  45. paint_rect.shrink(4, 4);
  46. }
  47. painter.fill_rect_with_rounded_corners(paint_rect, background_color, Card::card_radius - 1);
  48. return true;
  49. };
  50. switch (m_type) {
  51. case Type::Stock:
  52. if (draw_background_if_empty()) {
  53. painter.fill_rect(m_base.shrunken(Card::width / 4, Card::height / 4), background_color.lightened(1.5));
  54. painter.fill_rect(m_base.shrunken(Card::width / 2, Card::height / 2), background_color);
  55. }
  56. break;
  57. case Type::Foundation:
  58. if (draw_background_if_empty()) {
  59. for (int y = 0; y < (m_base.height() - 4) / 8; ++y) {
  60. for (int x = 0; x < (m_base.width() - 4) / 5; ++x) {
  61. painter.draw_rect({ 4 + m_base.x() + x * 5, 4 + m_base.y() + y * 8, 1, 1 }, background_color.darkened(0.5));
  62. }
  63. }
  64. }
  65. break;
  66. case Type::Play:
  67. case Type::Normal:
  68. draw_background_if_empty();
  69. break;
  70. case Type::Waste:
  71. break;
  72. default:
  73. VERIFY_NOT_REACHED();
  74. }
  75. if (is_empty())
  76. return;
  77. if (m_rules.shift_x == 0 && m_rules.shift_y == 0) {
  78. auto& card = peek();
  79. card.paint(painter);
  80. return;
  81. }
  82. RefPtr<Card> previewed_card;
  83. for (size_t i = 0; i < m_stack.size(); ++i) {
  84. if (auto& card = m_stack[i]; !card->is_moving()) {
  85. if (card->is_previewed()) {
  86. VERIFY(!previewed_card);
  87. previewed_card = card;
  88. continue;
  89. }
  90. auto highlighted = m_highlighted && (i == m_stack.size() - 1);
  91. card->clear_and_paint(painter, Gfx::Color::Transparent, highlighted);
  92. }
  93. }
  94. if (previewed_card)
  95. previewed_card->clear_and_paint(painter, Gfx::Color::Transparent, false);
  96. }
  97. void CardStack::rebound_cards()
  98. {
  99. VERIFY(m_stack_positions.size() == m_stack.size());
  100. size_t card_index = 0;
  101. for (auto& card : m_stack)
  102. card->set_position(m_stack_positions.at(card_index++));
  103. }
  104. ErrorOr<void> CardStack::add_all_grabbed_cards(Gfx::IntPoint click_location, Vector<NonnullRefPtr<Card>>& grabbed, MovementRule movement_rule)
  105. {
  106. VERIFY(grabbed.is_empty());
  107. if (m_type != Type::Normal) {
  108. auto& top_card = peek();
  109. if (top_card.rect().contains(click_location)) {
  110. top_card.set_moving(true);
  111. TRY(grabbed.try_append(top_card));
  112. }
  113. return {};
  114. }
  115. RefPtr<Card> last_intersect;
  116. for (auto& card : m_stack) {
  117. if (card->rect().contains(click_location)) {
  118. if (card->is_upside_down())
  119. continue;
  120. last_intersect = card;
  121. } else if (!last_intersect.is_null()) {
  122. if (grabbed.is_empty()) {
  123. TRY(grabbed.try_append(*last_intersect));
  124. last_intersect->set_moving(true);
  125. }
  126. if (card->is_upside_down()) {
  127. grabbed.clear();
  128. return {};
  129. }
  130. card->set_moving(true);
  131. TRY(grabbed.try_append(card));
  132. }
  133. }
  134. if (grabbed.is_empty() && !last_intersect.is_null()) {
  135. TRY(grabbed.try_append(*last_intersect));
  136. last_intersect->set_moving(true);
  137. }
  138. // verify valid stack
  139. bool valid_stack = true;
  140. uint8_t last_value;
  141. Color last_color;
  142. for (size_t i = 0; i < grabbed.size(); i++) {
  143. auto& card = grabbed.at(i);
  144. if (i != 0) {
  145. bool color_match;
  146. switch (movement_rule) {
  147. case MovementRule::Alternating:
  148. color_match = card->color() != last_color;
  149. break;
  150. case MovementRule::Same:
  151. color_match = card->color() == last_color;
  152. break;
  153. case MovementRule::Any:
  154. color_match = true;
  155. break;
  156. }
  157. if (!color_match || to_underlying(card->rank()) != last_value - 1) {
  158. valid_stack = false;
  159. break;
  160. }
  161. }
  162. last_value = to_underlying(card->rank());
  163. last_color = card->color();
  164. }
  165. if (!valid_stack) {
  166. for (auto& card : grabbed) {
  167. card->set_moving(false);
  168. }
  169. grabbed.clear();
  170. }
  171. return {};
  172. }
  173. bool CardStack::is_allowed_to_push(Card const& card, size_t stack_size, MovementRule movement_rule) const
  174. {
  175. if (m_type == Type::Stock || m_type == Type::Waste || m_type == Type::Play)
  176. return false;
  177. if (m_type == Type::Normal && is_empty()) {
  178. // FIXME: proper solution for this
  179. if (movement_rule == MovementRule::Alternating) {
  180. return card.rank() == Rank::King;
  181. }
  182. return true;
  183. }
  184. if (m_type == Type::Foundation && is_empty())
  185. return card.rank() == Rank::Ace;
  186. if (!is_empty()) {
  187. auto const& top_card = peek();
  188. if (top_card.is_upside_down())
  189. return false;
  190. if (m_type == Type::Foundation) {
  191. // Prevent player from dragging an entire stack of cards to the foundation stack
  192. if (stack_size > 1)
  193. return false;
  194. return top_card.suit() == card.suit() && m_stack.size() == to_underlying(card.rank());
  195. }
  196. if (m_type == Type::Normal) {
  197. bool color_match;
  198. switch (movement_rule) {
  199. case MovementRule::Alternating:
  200. color_match = card.color() != top_card.color();
  201. break;
  202. case MovementRule::Same:
  203. color_match = card.color() == top_card.color();
  204. break;
  205. case MovementRule::Any:
  206. color_match = true;
  207. break;
  208. }
  209. return color_match && to_underlying(top_card.rank()) == to_underlying(card.rank()) + 1;
  210. }
  211. VERIFY_NOT_REACHED();
  212. }
  213. return true;
  214. }
  215. bool CardStack::preview_card(Gfx::IntPoint click_location)
  216. {
  217. RefPtr<Card> last_intersect;
  218. for (auto& card : m_stack) {
  219. if (!card->rect().contains(click_location))
  220. continue;
  221. if (card->is_upside_down())
  222. continue;
  223. last_intersect = card;
  224. }
  225. if (!last_intersect)
  226. return false;
  227. last_intersect->set_previewed(true);
  228. return true;
  229. }
  230. void CardStack::clear_card_preview()
  231. {
  232. for (auto& card : m_stack)
  233. card->set_previewed(false);
  234. }
  235. bool CardStack::make_top_card_visible()
  236. {
  237. if (is_empty())
  238. return false;
  239. auto& top_card = peek();
  240. if (top_card.is_upside_down()) {
  241. top_card.set_upside_down(false);
  242. return true;
  243. }
  244. return false;
  245. }
  246. ErrorOr<void> CardStack::push(NonnullRefPtr<Card> card)
  247. {
  248. auto top_most_position = m_stack_positions.is_empty() ? m_position : m_stack_positions.last();
  249. if (!m_stack.is_empty() && m_stack.size() % m_rules.step == 0) {
  250. if (peek().is_upside_down())
  251. top_most_position.translate_by(m_rules.shift_x, m_rules.shift_y_upside_down);
  252. else
  253. top_most_position.translate_by(m_rules.shift_x, m_rules.shift_y);
  254. }
  255. if (m_type == Type::Stock)
  256. card->set_upside_down(true);
  257. card->set_position(top_most_position);
  258. TRY(m_stack.try_append(card));
  259. TRY(m_stack_positions.try_append(top_most_position));
  260. calculate_bounding_box();
  261. return {};
  262. }
  263. NonnullRefPtr<Card> CardStack::pop()
  264. {
  265. auto card = m_stack.take_last();
  266. calculate_bounding_box();
  267. if (m_type == Type::Stock)
  268. card->set_upside_down(false);
  269. m_stack_positions.take_last();
  270. return card;
  271. }
  272. ErrorOr<void> CardStack::take_all(CardStack& stack)
  273. {
  274. while (!m_stack.is_empty()) {
  275. auto card = m_stack.take_first();
  276. m_stack_positions.take_first();
  277. TRY(stack.push(move(card)));
  278. }
  279. calculate_bounding_box();
  280. return {};
  281. }
  282. void CardStack::calculate_bounding_box()
  283. {
  284. m_bounding_box = Gfx::IntRect(m_position, { Card::width, Card::height });
  285. if (m_stack.is_empty())
  286. return;
  287. uint16_t width = 0;
  288. uint16_t height = 0;
  289. size_t card_position = 0;
  290. for (auto& card : m_stack) {
  291. if (card_position % m_rules.step == 0 && card_position != 0) {
  292. if (card->is_upside_down()) {
  293. width += m_rules.shift_x;
  294. height += m_rules.shift_y_upside_down;
  295. } else {
  296. width += m_rules.shift_x;
  297. height += m_rules.shift_y;
  298. }
  299. }
  300. ++card_position;
  301. }
  302. m_bounding_box.set_size(Card::width + width, Card::height + height);
  303. }
  304. }