deck.cpp 7.6 KB

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