API tools faq
paste
Guest User

Untitled

a guest
Oct 16th, 2017
62
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 10.05 KB | None | 0 0
raw download clone embed print report
  1. public int myHolder = -1;
  2. public int myInt = -1;
  3. public void method123()
  4. {
  5. int i1;
  6. int i2;
  7. int j;
  8. int n;
  9. int i;
  10. int k;
  11. int m;
  12. if (System.currentTimeMillis() - this.aLong1267 > 50L)
  13. {
  14. i = 0;
  15. if ((this.anInt1175 != 0) && (this.anInt1162 == 0))
  16. this.anInt1162 = 1;
  17. if (this.anInt1162 > 0)
  18. {
  19. j = this.anInt31 - (anInt1291 - (anInt1291 / 2 + 234));
  20. k = this.anInt32 - (anInt1292 / 2 - 139);
  21. if ((j >= 0) && (k >= 0) && (j < 468) && (k < 262))
  22. {
  23. if ((j > 216) && (k > 30) && (j < 462) && (k < 235))
  24. {
  25. m = (j - 217) / 49 + (k - 31) / 34 * 5;
  26. if ((m >= 0) && (m < this.anInt979))
  27. {
  28. n = 0;
  29. i1 = 0;
  30. i2 = this.anIntArray980[m];
  31. drawInputOffer();
  32. if (Class3.method236(i2).aBoolean807)
  33. {
  34. if (i == 0)
  35. super.method121(Class13.method344(12186), 3, 0);
  36. i = 1;
  37. }
  38. int i3;
  39. if (i == 0)
  40. for (i3 = 0; i3 < this.anInt1243; i3++)
  41. {
  42. if (this.anIntArray1244[i3] != i2)
  43. continue;
  44. if (Class3.method236(i2).method304()) //if item is stackable
  45. for (int i4 = 0; i4 < this.anInt1162; i4++)
  46. {
  47. if (this.anIntArray1245[i3] < this.anIntArray981[m])
  48. {
  49. this.anIntArray1245[i3] += this.myInt;
  50. }
  51. if (this.anIntArray1245[i3] > this.anIntArray981[m])
  52. {
  53.  
  54. }
  55. n = 1;
  56. }
  57. else
  58. i1++;
  59. }
  60. if ((i == 0) && (super.method58(i2) <= i1))
  61. n = 1;
  62. if ((i == 0) && (n == 0) && (this.anInt1243 < 12))
  63. {
  64. this.anIntArray1244[this.anInt1243] = i2;
  65. this.anIntArray1245[this.anInt1243] = this.myInt;
  66. this.anInt1243 += 1;
  67. n = 1;
  68. }
  69. if ((i == 0) && (n != 0))
  70. {
  71. this.aLong1267 = System.currentTimeMillis();
  72. this.aClass33_Sub1_767.method558(42);
  73. this.aClass33_Sub1_767.method542(this.anInt1243);
  74. for (i3 = 0; i3 < this.anInt1243; i3++)
  75. {
  76. this.aClass33_Sub1_767.method546(this.anIntArray1244[i3]);
  77. this.aClass33_Sub1_767.method544(this.anIntArray1245[i3]);
  78. }
  79. this.aClass33_Sub1_767.method541();
  80. this.aBoolean997 = false;
  81. this.aBoolean998 = false;
  82. }
  83. }
  84. }
  85. if ((i == 0) && (j > 8) && (k > 30) && (j < 205) && (k < 133))
  86. {
  87. m = (j - 9) / 49 + (k - 31) / 34 * 4;
  88. if ((m >= 0) && (m < this.anInt1243))
  89. {
  90. n = this.anIntArray1244[m];
  91. for (i1 = 0; i1 < this.anInt1162; i1++)
  92. if ((Class3.method236(n).method304()) && (this.anIntArray1245[m] > 1))
  93. {
  94. drawInputRemove();
  95. this.anIntArray1245[m] -= this.myInt;
  96. }
  97. else
  98. {
  99. this.anInt1243 -= 1;
  100. this.anInt1161 = 0;
  101. for (i2 = m; i2 < this.anInt1243; i2++)
  102. {
  103. this.anIntArray1244[i2] = this.anIntArray1244[(i2 + 1)];
  104. this.anIntArray1245[i2] = this.anIntArray1245[(i2 + 1)];
  105. }
  106. break;
  107. }
  108. this.aLong1267 = System.currentTimeMillis();
  109. this.aClass33_Sub1_767.method558(42);
  110. this.aClass33_Sub1_767.method542(this.anInt1243);
  111. for (i1 = 0; i1 < this.anInt1243; i1++)
  112. {
  113. this.aClass33_Sub1_767.method546(this.anIntArray1244[i1]);
  114. this.aClass33_Sub1_767.method544(this.anIntArray1245[i1]);
  115. }
  116. this.aClass33_Sub1_767.method541();
  117. this.aBoolean997 = false;
  118. this.aBoolean998 = false;
  119. }
  120. }
  121. if ((j >= 217) && (k >= 238) && (j <= 286) && (k <= 259))
  122. {
  123. this.aLong1267 = System.currentTimeMillis();
  124. this.aBoolean998 = true;
  125. this.aClass33_Sub1_767.method558(39);
  126. this.aClass33_Sub1_767.method541();
  127. }
  128. if ((j >= 394) && (k >= 238) && (j < 463) && (k < 259))
  129. {
  130. this.aBoolean1236 = false;
  131. this.aClass33_Sub1_767.method558(41);
  132. this.aClass33_Sub1_767.method541();
  133. }
  134. }
  135. else if (this.anInt1175 != 0)
  136. {
  137. this.aBoolean1236 = false;
  138. this.aClass33_Sub1_767.method558(41);
  139. this.aClass33_Sub1_767.method541();
  140. }
  141. this.anInt1175 = 0;
  142. this.anInt1162 = 0;
  143. }
  144. }
  145. if (!this.aBoolean1236)
  146. return;
  147. i = anInt1291 / 2 - 234;
  148. j = anInt1292 / 2 - 140;
  149. this.aClass26_Sub1_1195.method428(i, j, 468, 12, 192);
  150. k = 10000536;
  151. super.method76(i, j + 12, 468, 18, k, 160);
  152. super.method76(i, j + 30, 8, 248, k, 160);
  153. super.method76(i + 205, j + 30, 11, 248, k, 160);
  154. super.method76(i + 462, j + 30, 6, 248, k, 160);
  155. super.method76(i + 8, j + 133, 197, 22, k, 160);
  156. super.method76(i + 8, j + 258, 197, 20, k, 160);
  157. super.method76(i + 216, j + 235, 246, 43, k, 160);
  158. m = 13684944;
  159. super.method76(i + 8, j + 30, 197, 103, m, 160);
  160. super.method76(i + 8, j + 155, 197, 103, m, 160);
  161. super.method76(i + 216, j + 30, 246, 205, m, 160);
  162. for (n = 0; n < 4; n++)
  163. super.method77(i + 8, j + 30 + n * 34, 197, 0);
  164. for (n = 0; n < 4; n++)
  165. super.method77(i + 8, j + 155 + n * 34, 197, 0);
  166. for (n = 0; n < 7; n++)
  167. super.method77(i + 216, j + 30 + n * 34, 246, 0);
  168. for (n = 0; n < 6; n++)
  169. {
  170. if (n < 5)
  171. super.method78(i + 8 + n * 49, j + 30, 103, 0);
  172. if (n < 5)
  173. super.method78(i + 8 + n * 49, j + 155, 103, 0);
  174. super.method78(i + 216 + n * 49, j + 30, 205, 0);
  175. }
  176. super.method80(Class13.method344(12760) + this.aString1254, i + 1, j + 10, 1, 16777215);
  177. super.method80(Class13.method344(12775), i + 9, j + 27, 4, 16777215);
  178. super.method80(Class13.method344(12786), i + 9, j + 152, 4, 16777215);
  179. super.method80(Class13.method344(12286), i + 216, j + 27, 4, 16777215);
  180. if (!this.aBoolean998)
  181. this.aClass26_Sub1_1195.method438(i + 217, j + 238, 2025);
  182. this.aClass26_Sub1_1195.method438(i + 394, j + 238, 2026);
  183. if (this.aBoolean997)
  184. {
  185. super.method79(Class13.method344(12345), i + 341, j + 246, 1, 16777215);
  186. super.method79(Class13.method344(12358), i + 341, j + 256, 1, 16777215);
  187. }
  188. if (this.aBoolean998)
  189. {
  190. super.method79(Class13.method344(12371), i + 217 + 35, j + 246, 1, 16777215);
  191. super.method79(Class13.method344(12383), i + 217 + 35, j + 256, 1, 16777215);
  192. }
  193. for (n = 0; n < this.anInt979; n++)
  194. {
  195. i1 = 217 + i + n % 5 * 49;
  196. i2 = 31 + j + n / 5 * 34;
  197. this.aClass26_Sub1_1195.method452(i1, i2, 48, 32, 2150 + Class3.method236(this.anIntArray980[n]).method302(), Class3.method236(this.anIntArray980[n]).method306(), 0, 0, false);
  198. if (!Class3.method236(this.anIntArray980[n]).method304())
  199. continue;
  200. super.method80(super.method69(String.valueOf(this.anIntArray981[n])), i1 + 1, i2 + 10, 1, 16776960);
  201. }
  202. for (n = 0; n < this.anInt1243; n++)
  203. {
  204. i1 = 9 + i + n % 4 * 49;
  205. i2 = 31 + j + n / 4 * 34;
  206. this.aClass26_Sub1_1195.method452(i1, i2, 48, 32, 2150 + Class3.method236(this.anIntArray1244[n]).method302(), Class3.method236(this.anIntArray1244[n]).method306(), 0, 0, false);
  207. if (Class3.method236(this.anIntArray1244[n]).method304())
  208. super.method80(super.method69("" + String.valueOf(this.anIntArray1245[n])), i1 + 1, i2 + 10, 1, 16776960);
  209. if ((this.anInt31 <= i1) || (this.anInt31 >= i1 + 48) || (this.anInt32 <= i2) || (this.anInt32 >= i2 + 32))
  210. continue;
  211. super.method80(Class3.method236(this.anIntArray1244[n]).method292() + Class13.method344(9152) + Class3.method236(this.anIntArray1244[n]).method293(), i + 8, j + 273, 1, 16776960);
  212. }
  213. for (n = 0; n < this.anInt1183; n++)
  214. {
  215. i1 = 9 + i + n % 4 * 49;
  216. i2 = 156 + j + n / 4 * 34;
  217. this.aClass26_Sub1_1195.method452(i1, i2, 48, 32, 2150 + Class3.method236(this.anIntArray1184[n]).method302(), Class3.method236(this.anIntArray1184[n]).method306(), 0, 0, false);
  218. if (Class3.method236(this.anIntArray1184[n]).method304())
  219. super.method80(super.method69("" + String.valueOf(this.anIntArray1185[n])), i1 + 1, i2 + 10, 1, 16776960);
  220. if ((this.anInt31 <= i1) || (this.anInt31 >= i1 + 48) || (this.anInt32 <= i2) || (this.anInt32 >= i2 + 32))
  221. continue;
  222. super.method80(Class3.method236(this.anIntArray1184[n]).method292() + Class13.method344(9152) + Class3.method236(this.anIntArray1184[n]).method293(), i + 8, j + 273, 1, 16776960);
  223. }
  224. }
  225.  
  226. public void drawInputRemove() {
  227. {
  228. String s = "Please enter the number of items to remove";
  229. this.myInt = askuserInt(s);
  230. }
  231. }
  232.  
  233. public void drawInputOffer() {
  234. {
  235. String s = "Please enter the number of items to offer";
  236. this.myInt = askuserInt(s);
  237. }
  238. }
Add Comment
Please, Sign In to add comment
Public Pastes
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!