API tools faq
paste
Advertisement
fr1sk

Untitled

fr1sk
Jun 6th, 2017
98
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 6.55 KB | None | 0 0
raw download clone embed print report
  1. void Square::algCheck(){
  2. qInfo() << "ALG CHECK CALLED";
  3. int j, k, l;
  4. int cnt = 0;
  5. int array[35];
  6. //========================= horizontalno +1 ===============================
  7. for(int i=0; i<SquaresList::squares.length(); i++){
  8. //qInfo() << "vrednost na i: " << SquaresList::squares[i]->getValue() << " a i je: " << i;
  9. j = i + 5;
  10. k = i;
  11. l = i % 5;
  12. array[cnt++] = k;
  13. while(j<=SquaresList::squares.length()-5+1+l && SquaresList::squares[j]->getValue() - SquaresList::squares[k]->getValue() == 1){
  14. array[cnt++] = j;
  15. j = j + 5;
  16. k = k + 5;
  17. }
  18. if(j>SquaresList::squares.length()-5+1+l){
  19. if(cnt>=3){
  20. for(int z=0; z<cnt; z++){
  21. qInfo() << "PUCAJ" << array[z];
  22. }
  23. qInfo() << "=================";
  24. memset(array, -1, sizeof(array));
  25. cnt = 0;
  26. //i = - 1;
  27. } else {
  28. memset(array, -1, sizeof(array));
  29. cnt = 0;
  30. }
  31. } else {
  32. if(cnt>=3){
  33. for(int z=0; z<cnt; z++){
  34. qInfo() << "PUCAJ" << array[z];
  35. }
  36. qInfo() << "=================";
  37. memset(array, -1, sizeof(array));
  38. cnt = 0;
  39. //i = - 1;
  40.  
  41. } else {
  42. memset(array, -1, sizeof(array));
  43. cnt = 0;
  44. //i = j-1;
  45. }
  46. }
  47. }
  48. //========================= horizontalno -1 ===============================
  49. memset(array, -1, sizeof(array));
  50. cnt = 0;
  51. for(int i=0; i<SquaresList::squares.length(); i++){
  52. //qInfo() << "vrednost na i: " << SquaresList::squares[i]->getValue() << " a i je: " << i;
  53. j = i + 5;
  54. k = i;
  55. l = i % 5;
  56. array[cnt++] = k;
  57. while(j<=SquaresList::squares.length()-5+1+l && SquaresList::squares[j]->getValue() - SquaresList::squares[k]->getValue() == -1){
  58. array[cnt++] = j;
  59. j = j + 5;
  60. k = k + 5;
  61. }
  62. if(j>SquaresList::squares.length()-5+1+l){
  63. if(cnt>=3){
  64. for(int z=0; z<cnt; z++){
  65. qInfo() << "PUCAJ" << array[z];
  66. }
  67. qInfo() << "=================";
  68. memset(array, -1, sizeof(array));
  69. cnt = 0;
  70. //i = - 1;
  71. } else {
  72. memset(array, -1, sizeof(array));
  73. cnt = 0;
  74. }
  75. } else {
  76. if(cnt>=3){
  77. for(int z=0; z<cnt; z++){
  78. qInfo() << "PUCAJ" << array[z];
  79. }
  80. qInfo() << "=================";
  81. memset(array, -1, sizeof(array));
  82. cnt = 0;
  83. //i = - 1;
  84.  
  85. } else {
  86. memset(array, -1, sizeof(array));
  87. cnt = 0;
  88. //i = j-1;
  89. }
  90. }
  91. }
  92. //========================= vertikalno +1 ===============================
  93. memset(array, -1, sizeof(array));
  94. cnt = 0;
  95. for (int i=0;i<SquaresList::squares.length();i++){
  96. j=i+1;
  97. k=i;
  98. cnt = 0;
  99. array[cnt++]=k;
  100. while (j <= (i+5-(i%5)-1) && SquaresList::squares[j]->getValue() - SquaresList::squares[k]->getValue() == 1){
  101. array[cnt++]=j;
  102. j=j+1;
  103. k=k+1;
  104. }
  105. if (j > (i+5-(i%5)-1)){ //dosli smo do dole do kraja
  106. if (cnt >= 3){ //da li ima dovoljno za pucanje
  107. //pucaju svi indeksi iz niza
  108. //prazni se niz
  109. for(int z=0; z<cnt; z++){
  110. qInfo() << "PUCAJ" << array[z];
  111. }
  112. qInfo() << "=================";
  113. memset(array, -1, sizeof(array));
  114. cnt = 0;
  115. //i = -1; krece iz pocekta, ili 0 ili -1, kada zaista puknu
  116. }
  117. else { //nema dovoljno u nizu a dosli do kraja, samo praznimo niz nista se ne desava
  118. memset(array, -1, sizeof(array));
  119. cnt = 0;
  120. }
  121.  
  122. } else { //razlika izmedju dva vise nije 1
  123. if (cnt >= 3) {
  124. //pucaju svi iz niza
  125. //praznimo niz
  126. for(int z=0; z<cnt; z++){
  127. qInfo() << "PUCAJ" << array[z];
  128. }
  129. qInfo() << "=================";
  130. memset(array, -1, sizeof(array));
  131. cnt = 0;
  132. //i = -1; kada zaista puknu
  133. } else {
  134. //praznimo niz
  135. memset(array, -1, sizeof(array));
  136. cnt = 0;
  137. }
  138.  
  139. }
  140. }
  141. //========================= vertikalno -1 ===============================
  142. memset(array, -1, sizeof(array));
  143. cnt = 0;
  144. for (int i=0;i<SquaresList::squares.length();i++){
  145. j=i+1;
  146. k=i;
  147. cnt = 0;
  148. array[cnt++]=k;
  149. while (j <= (i+5-(i%5)-1) && SquaresList::squares[j]->getValue() - SquaresList::squares[k]->getValue() == -1){
  150. array[cnt++]=j;
  151. j=j+1;
  152. k=k+1;
  153. }
  154. if (j > (i+5-(i%5)-1)){ //dosli smo do dole do kraja
  155. if (cnt >= 3){ //da li ima dovoljno za pucanje
  156. //pucaju svi indeksi iz niza
  157. //prazni se niz
  158. for(int z=0; z<cnt; z++){
  159. qInfo() << "PUCAJ" << array[z];
  160. }
  161. qInfo() << "=================";
  162. memset(array, -1, sizeof(array));
  163. cnt = 0;
  164. //i = -1; krece iz pocekta, ili 0 ili -1, kada zaista puknu
  165. }
  166. else { //nema dovoljno u nizu a dosli do kraja, samo praznimo niz nista se ne desava
  167. memset(array, -1, sizeof(array));
  168. cnt = 0;
  169. }
  170.  
  171. } else { //razlika izmedju dva vise nije 1
  172. if (cnt >= 3) {
  173. //pucaju svi iz niza
  174. //praznimo niz
  175. for(int z=0; z<cnt; z++){
  176. qInfo() << "PUCAJ" << array[z];
  177. }
  178. qInfo() << "=================";
  179. memset(array, -1, sizeof(array));
  180. cnt = 0;
  181. //i = -1; kada zaista puknu
  182. } else {
  183. //praznimo niz
  184. memset(array, -1, sizeof(array));
  185. cnt = 0;
  186. }
  187.  
  188. }
  189. }
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!