API tools faq
paste
Advertisement
Guest User

getRect.cpp

a guest
Jan 22nd, 2017
99
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 6.71 KB | None | 0 0
raw download clone embed print report
  1. #include <iostream>
  2. #include <SFML/Graphics.hpp>
  3. #include <SFML/Audio.hpp>
  4. #include <SFML/System.hpp>
  5. #include <SFML/Window.hpp>
  6. #include <fstream>
  7. #include <vector>
  8. #include <limits>
  9. #include <string>
  10. #include <stdio.h>
  11. #include <windows.h>
  12. #include "connector.hpp"
  13. using namespace std;
  14. using namespace sf;
  15. sf::IntRect getRect(bool isEntity, bool x, bool fire, int type, int one2or3 = 0){
  16. if(isEntity){
  17. switch(type){
  18. case 1 :
  19. return IntRect(0, 0, 15, 23);
  20. case 11 :
  21. return IntRect(16, 0, 15, 23);
  22. case 12 :
  23. return IntRect(32, 0, 15, 23);
  24. case 13 :
  25. return IntRect(0, 96, 17, 23);
  26. case 2 :
  27. return IntRect(0, 24, 15, 23);
  28. case 21 :
  29. return IntRect(16, 24, 15, 23);
  30. case 22 :
  31. return IntRect(32, 24, 15, 23);
  32. case 23 :
  33. return IntRect(35, 96, 15, 23);
  34. case 3 :
  35. return IntRect(0, 48, 17, 23);
  36. case 31 :
  37. return IntRect(18, 48, 16, 23);
  38. case 32 :
  39. return IntRect(35, 48, 15, 23);
  40. case 33 :
  41. return IntRect(18, 96, 16, 23);
  42. case 4 :
  43. return IntRect(0, 72, 17, 23);
  44. case 41 :
  45. return IntRect(18, 72, 16, 23);
  46. case 42 :
  47. return IntRect(35, 72, 15, 23);
  48. case 43 :
  49. return IntRect(51, 96, 15, 23);
  50. case 5 :
  51. return IntRect(0, 120, 17, 23);
  52. case 51 :
  53. return IntRect(18, 120, 19, 24);
  54. case 52 :
  55. return IntRect(38, 120, 23, 25);
  56. case 53 :
  57. return IntRect(62, 120, 28, 21);
  58. case 6 :
  59. return IntRect(48, 0, 12, 14);
  60. default :
  61. break;
  62. }
  63. }else if(x){
  64. switch(type){
  65. case 1 :
  66. return IntRect(34, 102, 16, 16);
  67. case 2 :
  68. return IntRect(34, 85, 16, 16);
  69. case 3 :
  70. return IntRect(34, 68, 16, 16);
  71. case 4 :
  72. return IntRect(0, 51, 16, 16);
  73. case 5 :
  74. return IntRect(68, 51, 16, 16);
  75. case 6 :
  76. return IntRect(0, 68, 16, 16);
  77. case 7 :
  78. return IntRect(68, 68, 16, 16);
  79. case 8 :
  80. return IntRect(0, 102, 16, 16);
  81. case 9 :
  82. return IntRect(68, 102, 16, 16);
  83. case 0 :
  84. if(one2or3 == 1){
  85. return IntRect(0, 119, 16, 16);
  86. }
  87. else{
  88. return IntRect(68, 119, 16, 16);
  89. }
  90. default :
  91. break;
  92. }
  93. }else if(fire){
  94. switch(type){ //case = part, one2or3 = strength
  95. /// 2
  96. /// 1
  97. /// 4 3 7 3 6
  98. /// 1
  99. /// 5
  100. case 1 :
  101. if(one2or3 == 1){
  102. return IntRect(34, 0, 16, 16);
  103. }else if(one2or3 == 2){
  104. return IntRect(17, 0, 16, 16);
  105. }else if(one2or3 == 0){
  106. return IntRect(51, 0, 16, 16);
  107. }else{
  108. return IntRect(0, 0, 16, 16);
  109. }
  110. case 2 :
  111. if(one2or3 == 1){
  112. return IntRect(34, 17, 16, 16);
  113. }else if(one2or3 == 2){
  114. return IntRect(17, 17, 16, 16);
  115. }else if(one2or3 == 0){
  116. return IntRect(51, 17, 16, 16);
  117. }else{
  118. return IntRect(0, 17, 16, 16);
  119. }
  120. case 3 :
  121. if(one2or3 == 1){
  122. return IntRect(102, 0, 16, 16);
  123. }else if(one2or3 == 2){
  124. return IntRect(85, 0, 16, 16);
  125. }else if(one2or3 == 0){
  126. return IntRect(119, 0, 16, 16);
  127. }else{
  128. return IntRect(68, 0, 16, 16);
  129. }
  130. case 4 :
  131. if(one2or3 == 1){
  132. return IntRect(102, 34, 16, 16);
  133. }else if(one2or3 == 2){
  134. return IntRect(85, 34, 16, 16);
  135. }else if(one2or3 == 0){
  136. return IntRect(119, 34, 16, 16);
  137. }else{
  138. return IntRect(68, 34, 16, 16);
  139. }
  140. case 5 :
  141. if(one2or3 == 1){
  142. return IntRect(34, 34, 16, 16);
  143. }else if(one2or3 == 2){
  144. return IntRect(17, 34, 16, 16);
  145. }else if(one2or3 == 0){
  146. return IntRect(51, 34, 16, 16);
  147. }else{
  148. return IntRect(0, 34, 16, 16);
  149. }
  150. case 6 :
  151. if(one2or3 == 1){
  152. return IntRect(102, 17, 16, 16);
  153. }else if(one2or3 == 2){
  154. return IntRect(85, 17, 16, 16);
  155. }else if(one2or3 == 0){
  156. return IntRect(119, 17, 16, 16);
  157. }else{
  158. return IntRect(68, 17, 16, 16);
  159. }
  160. case 7 :
  161. if(one2or3 == 1){
  162. return IntRect(119, 119, 16, 16);
  163. }else if(one2or3 == 2){
  164. return IntRect(102, 119, 16, 16);
  165. }else if(one2or3 == 0){
  166. return IntRect(136, 119, 16, 16);
  167. }else{
  168. return IntRect(85, 119, 16, 16);
  169. }
  170. ///
  171. case 8 :
  172. return IntRect(136, 102, 16, 16);
  173. case 9 :
  174. return IntRect(136, 85, 16, 16);
  175. case 10 :
  176. return IntRect(136, 68, 16, 16);
  177. case 11 :
  178. return IntRect(136, 51, 16, 16);
  179. case 12 :
  180. return IntRect(136, 34, 16, 16);
  181. case 13 :
  182. return IntRect(136, 17, 16, 16);
  183. case 14 :
  184. return IntRect(136, 0, 16, 16);
  185. default :
  186. break;
  187. }
  188. }else{
  189. switch(type){
  190. case 1 :
  191. return IntRect(34, 68, 16, 16);
  192. case 2 :
  193. return IntRect(34, 51, 16, 16);
  194. case 3 :
  195. return IntRect(17, 51, 16, 16);
  196. case 4 :
  197. return IntRect(51, 51, 16, 16);
  198. case 5 :
  199. if(one2or3 == 1){
  200. return IntRect(51, 68, 16, 16);
  201. }else if(one2or3 == 2){
  202. return IntRect(51, 85, 16, 16);
  203. }else{
  204. return IntRect(51, 101, 16, 16);
  205. }
  206. case 6 :
  207. return IntRect(59, 119, 16, 16);
  208. case 7 :
  209. return IntRect(34, 119, 16, 16);
  210. case 8 :
  211. return IntRect(17, 119, 16, 16);
  212. case 9 :
  213. return IntRect(17, 85, 16, 16);
  214. default :
  215. break;
  216. }
  217. }
  218. cout << "ERROR:" << isEntity << ' ' << x << ' ' << fire << ' ' << type << ' ' << one2or3 << endl;
  219. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!