deck.cpp 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364
  1. #include "deck.h"
  2. #include <algorithm>
  3. #include <sstream>
  4. Deck::Deck(int size) {
  5. cardback = door::ANSIColor(door::COLOR::RED);
  6. card_height = size;
  7. init();
  8. }
  9. Deck::Deck(door::ANSIColor backcolor, int size) : cardback{backcolor} {
  10. card_height = size;
  11. init();
  12. }
  13. void Deck::init(void) {
  14. if (card_height != 3) {
  15. if (card_height != 5) {
  16. card_height = 3;
  17. }
  18. }
  19. for (int i = 0; i < 52; ++i) {
  20. cards.push_back(card_of(i));
  21. }
  22. // 0 = BLANK, 1-4 levels
  23. for (int i = 0; i < 5; ++i) {
  24. backs.push_back(back_of(i));
  25. }
  26. }
  27. Deck::~Deck() {
  28. for (auto c : cards) {
  29. delete c;
  30. }
  31. cards.clear();
  32. for (auto b : backs) {
  33. delete b;
  34. }
  35. backs.clear();
  36. }
  37. int Deck::is_deck(int c) { return c / 52; }
  38. int Deck::is_suit(int c) { return (c % 52) / 13; }
  39. int Deck::is_rank(int c) { return (c % 52) % 13; }
  40. char Deck::rank_symbol(int c) {
  41. const char symbols[] = "A23456789TJQK";
  42. return symbols[c];
  43. }
  44. std::string Deck::suit_symbol(int c) {
  45. // unicode
  46. if (door::unicode) {
  47. switch (c) {
  48. case 0:
  49. return std::string("\u2665");
  50. case 1:
  51. return std::string("\u2666");
  52. case 2:
  53. return std::string("\u2663");
  54. case 3:
  55. return std::string("\u2660");
  56. }
  57. } else {
  58. if (door::full_cp437) {
  59. switch (c) {
  60. case 0:
  61. return std::string(1, '\x03');
  62. case 1:
  63. return std::string(1, '\x04');
  64. case 2:
  65. return std::string(1, '\x05');
  66. case 3:
  67. return std::string(1, '\x06');
  68. }
  69. } else {
  70. // These look horrible!
  71. switch (c) {
  72. case 0:
  73. return std::string(1, '*'); // H
  74. case 1:
  75. return std::string(1, '^'); // D
  76. case 2:
  77. return std::string(1, '%'); // C
  78. case 3:
  79. return std::string(1, '$'); // S
  80. }
  81. }
  82. }
  83. return std::string("!", 1);
  84. }
  85. door::Panel *Deck::card_of(int c) {
  86. int suit = is_suit(c);
  87. int rank = is_rank(c);
  88. bool is_red = (suit < 2);
  89. door::ANSIColor color;
  90. if (is_red) {
  91. color = door::ANSIColor(door::COLOR::RED, door::COLOR::WHITE);
  92. } else {
  93. color = door::ANSIColor(door::COLOR::BLACK, door::COLOR::WHITE);
  94. }
  95. door::Panel *p = new door::Panel(0, 0, 5);
  96. // setColor sets border_color. NOT WHAT I WANT.
  97. // p->setColor(color);
  98. char r = rank_symbol(rank);
  99. std::string s = suit_symbol(suit);
  100. // build lines
  101. std::ostringstream oss;
  102. oss << r << s << " ";
  103. std::string str = oss.str();
  104. p->addLine(std::make_unique<door::Line>(str, 5, color));
  105. oss.str(std::string());
  106. oss.clear();
  107. if (card_height == 5)
  108. p->addLine(std::make_unique<door::Line>(" ", 5, color));
  109. oss << " " << s << " ";
  110. str = oss.str();
  111. p->addLine(std::make_unique<door::Line>(str, 5, color));
  112. oss.str(std::string());
  113. oss.clear();
  114. if (card_height == 5)
  115. p->addLine(std::make_unique<door::Line>(" ", 5, color));
  116. oss << " " << s << r;
  117. str = oss.str();
  118. p->addLine(std::make_unique<door::Line>(str, 5, color));
  119. oss.str(std::string());
  120. oss.clear();
  121. return p;
  122. }
  123. std::string Deck::back_char(int level) {
  124. std::string c;
  125. if (level == 0) {
  126. c = ' ';
  127. return c;
  128. }
  129. if (door::unicode) {
  130. switch (level) {
  131. case 1:
  132. c = "\u2591";
  133. break;
  134. case 2:
  135. c = "\u2592";
  136. break;
  137. case 3:
  138. c = "\u2593";
  139. break;
  140. case 4:
  141. c = "\u2588";
  142. break;
  143. }
  144. } else {
  145. switch (level) {
  146. case 1:
  147. c = "\xb0";
  148. break;
  149. case 2:
  150. c = "\xb1";
  151. break;
  152. case 3:
  153. c = "\xb2";
  154. break;
  155. case 4:
  156. c = "\xdb";
  157. break;
  158. }
  159. }
  160. return c;
  161. }
  162. door::Panel *Deck::back_of(int level) {
  163. // using: \xb0, 0xb1, 0xb2, 0xdb
  164. // OR: \u2591, \u2592, \u2593, \u2588
  165. // door::ANSIColor color(door::COLOR::RED, door::COLOR::BLACK);
  166. door::Panel *p = new door::Panel(0, 0, 5);
  167. std::string c = back_char(level);
  168. std::string l = c + c + c + c + c;
  169. for (int x = 0; x < card_height; ++x) {
  170. p->addLine(std::make_unique<door::Line>(l, 5, cardback));
  171. };
  172. // p->addLine(std::make_unique<door::Line>(l, 5, cardback));
  173. // p->addLine(std::make_unique<door::Line>(l, 5, cardback));
  174. return p;
  175. }
  176. void Deck::part(int x, int y, door::Door &d, int level, bool left) {
  177. // Render part of the back of a card.
  178. y += 2;
  179. if (!left) {
  180. x += 2;
  181. }
  182. std::string c = back_char(level);
  183. std::string l = c + c + c;
  184. door::Goto g(x, y);
  185. d << g << cardback << l;
  186. }
  187. door::Panel *Deck::card(int c) { return cards[c]; }
  188. door::Panel *Deck::back(int level) { return backs[level]; }
  189. const std::array<std::pair<int, int>, 18> Deck::blocks = {
  190. make_pair(3, 4), make_pair(5, 6), make_pair(7, 8), // end row 1
  191. make_pair(9, 10), make_pair(10, 11), make_pair(12, 13),
  192. make_pair(13, 14), make_pair(15, 16), make_pair(16, 17),
  193. make_pair(18, 19), // end row 2
  194. make_pair(19, 20), make_pair(20, 21), make_pair(21, 22),
  195. make_pair(22, 23), make_pair(23, 24), make_pair(24, 25),
  196. make_pair(25, 26), make_pair(26, 27) // 27
  197. };
  198. /**
  199. * @brief Which card (if any) is unblocked by this card
  200. *
  201. * @param c
  202. * @return * int
  203. */
  204. int Deck::unblocks(int c) {
  205. for (size_t i = 0; i < blocks.size(); ++i) {
  206. if ((blocks.at(i).first == c) || (blocks.at(i).second == c)) {
  207. return i;
  208. }
  209. }
  210. return -1;
  211. }
  212. /*
  213. Layout spacing 1:
  214. 1 2 3 4 5 6
  215. 123456789012345678901234567890123456789012345678901234567890
  216. ░░░░░ ░░░░░ ░░░░░
  217. ░░░░░ ░░░░░ ░░░░░
  218. ▒▒▒▒▒░▒▒▒▒▒ #####░##### #####░#####
  219. ▒▒▒▒▒ ▒▒▒▒▒ ##### ##### ##### #####
  220. ▓▓▓▓▓▒▓▓▓▓▓▒▓▓▓▓▓ #####=#####=##### #####=#####=#####
  221. ▓▓▓▓▓ ▓▓▓▓▓ ▓▓▓▓▓ ##### ##### ##### ##### ##### #####
  222. █████▓█████▓█████▓#####=#####=#####=#####=#####=#####=#####
  223. █████ █████ █████ ##### ##### ##### ##### ##### ##### #####
  224. █████ █████ █████ ##### ##### ##### ##### ##### ##### #####
  225. width = 5 * 10 + (1*9) = 59 OK!
  226. Layout with spacing = 2:
  227. EEEEE
  228. ZZZZZ
  229. yyyyyZZZyyyyy
  230. yyyyy yyyyy
  231. XXXXXyyyXXXXXyyyXXXXX
  232. XXXXX XXXXX XXXXX
  233. width = 5 * 10 + (2 * 9) = 50+18 = 68 ! I could do that!
  234. */
  235. void cardgo(int pos, int space, int h, int &x, int &y, int &level) {
  236. // special cases here
  237. if (pos == 28) {
  238. cardgo(23, space, h, x, y, level);
  239. y += h + 1;
  240. --level;
  241. return;
  242. } else {
  243. if (pos == 29) {
  244. cardgo(22, space, h, x, y, level);
  245. y += h + 1;
  246. --level;
  247. return;
  248. }
  249. }
  250. const int CARD_WIDTH = 5;
  251. int HALF_WIDTH = 3;
  252. // space = 1 or 3
  253. // int space = 1;
  254. // space = 3;
  255. HALF_WIDTH += space / 2;
  256. /*
  257. int levels[4] = {3, 6, 9, 10};
  258. for (level = 0; level < 4; ++level) {
  259. if (pos < levels[level]) {
  260. level++;
  261. // we're here
  262. y = (level -1) * 2 + 1;
  263. } else {
  264. pos -= levels[level];
  265. }
  266. }
  267. */
  268. int between = CARD_WIDTH + space;
  269. if (pos < 3) {
  270. // top
  271. level = 1;
  272. y = (level - 1) * (h - 1) + 1;
  273. x = pos * (between * 3) + between + HALF_WIDTH + space; // 10
  274. return;
  275. } else {
  276. pos -= 3;
  277. }
  278. if (pos < 6) {
  279. level = 2;
  280. y = (level - 1) * (h - 1) + 1;
  281. int group = (pos) / 2;
  282. x = pos * between + (group * between) + CARD_WIDTH + space * 2;
  283. return;
  284. } else {
  285. pos -= 6;
  286. }
  287. if (pos < 9) {
  288. level = 3;
  289. y = (level - 1) * (h - 1) + 1;
  290. x = pos * between + HALF_WIDTH + space;
  291. return;
  292. } else {
  293. pos -= 9;
  294. }
  295. if (pos < 10) {
  296. level = 4;
  297. y = (level - 1) * (h - 1) + 1;
  298. x = (pos)*between + space;
  299. return;
  300. } else {
  301. // something is wrong.
  302. y = -1;
  303. x = -1;
  304. level = -1;
  305. }
  306. }
  307. cards card_shuffle(std::seed_seq &seed, int decks) {
  308. std::mt19937 gen;
  309. // build deck of cards
  310. int size = decks * 52;
  311. std::vector<int> deck;
  312. deck.reserve(size);
  313. for (int x = 0; x < size; ++x) {
  314. deck.push_back(x);
  315. }
  316. // repeatable, but random
  317. gen.seed(seed);
  318. std::shuffle(deck.begin(), deck.end(), gen);
  319. return deck;
  320. }
  321. cards card_states(int decks) {
  322. // auto states = std::unique_ptr<std::vector<int>>(); // (decks * 52, 0)>;
  323. std::vector<int> states;
  324. states.assign(decks * 52, 0);
  325. return states;
  326. }