deck.cpp 8.8 KB

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