Guest User

Untitled

a guest
Sep 20th, 2018
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 18.84 KB | None | 0 0
  1. Class7 class7 = new Class7(aByteArrayArrayArray1258, -60, 104,
  2.  
  3. 104, anIntArrayArrayArray1214);
  4. int k2 = aByteArrayArray1183.length;
  5. aClass30_Sub2_Sub2_1192.method397((byte)6, 0);
  6. if(!aBoolean1159)
  7. {
  8. for(int i3 = 0; i3 < k2; i3++)
  9. {
  10. int i4 = (anIntArray1234[i3] >> 8) * 64 - anInt1034;
  11. int k5 = (anIntArray1234[i3] & 0xff) * 64 - anInt1035;
  12. byte abyte0[] = aByteArrayArray1183[i3];
  13. if(abyte0 != null)
  14. class7.method180(abyte0, k5, i4, (anInt1069 - 6) * 8,
  15.  
  16. (anInt1070 - 6) * 8, (byte)4, aClass11Array1230);
  17. }
  18.  
  19. for(int j4 = 0; j4 < k2; j4++)
  20. {
  21. int l5 = (anIntArray1234[j4] >> 8) * 64 - anInt1034;
  22. int k7 = (anIntArray1234[j4] & 0xff) * 64 - anInt1035;
  23. byte abyte2[] = aByteArrayArray1183[j4];
  24. if(abyte2 == null && anInt1070 < 800)
  25. class7.method174(k7, 64, 0, 64, l5);
  26. }
  27.  
  28.  
  29. anInt1097++;
  30. if(anInt1097 > 160)
  31. {
  32. anInt1097 = 0;
  33. aClass30_Sub2_Sub2_1192.method397((byte)6, 238);
  34. aClass30_Sub2_Sub2_1192.method398(96);
  35. }
  36. aClass30_Sub2_Sub2_1192.method397((byte)6, 0);
  37. for(int i6 = 0; i6 < k2; i6++)
  38. {
  39. byte abyte1[] = aByteArrayArray1247[i6];
  40. if(abyte1 != null)
  41. {
  42. int l8 = (anIntArray1234[i6] >> 8) * 64 - anInt1034;
  43. int k9 = (anIntArray1234[i6] & 0xff) * 64 - anInt1035;
  44. class7.method190(l8, aClass11Array1230, k9, 7,
  45.  
  46. aClass25_946, abyte1);
  47. }
  48. }
  49.  
  50. }
  51. if(aBoolean1159)
  52. {
  53. for(int j3 = 0; j3 < 4; j3++)
  54. {
  55. for(int k4 = 0; k4 < 13; k4++)
  56. {
  57. for(int j6 = 0; j6 < 13; j6++)
  58. {
  59. int l7 = anIntArrayArrayArray1129[j3][k4][j6];
  60. if(l7 != -1)
  61. {
  62. int i9 = l7 >> 24 & 3;
  63. int l9 = l7 >> 1 & 3;
  64. int j10 = l7 >> 14 & 0x3ff;
  65. int l10 = l7 >> 3 & 0x7ff;
  66. int j11 = (j10 / 8 << 8) + l10 / 8;
  67. for(int l11 = 0; l11 < anIntArray1234.length;
  68.  
  69. l11++)
  70. {
  71. if(anIntArray1234[l11] != j11 ||
  72.  
  73. aByteArrayArray1183[l11] == null)
  74. continue;
  75. class7.method179(i9, l9,
  76.  
  77. aClass11Array1230, 9, k4 * 8, (j10 & 7) * 8, aByteArrayArray1183[l11], (l10 &
  78.  
  79. 7) * 8, j3, j6 * 8);
  80. break;
  81. }
  82.  
  83. }
  84. }
  85.  
  86. }
  87.  
  88. }
  89.  
  90. for(int l4 = 0; l4 < 13; l4++)
  91. {
  92. for(int k6 = 0; k6 < 13; k6++)
  93. {
  94. int i8 = anIntArrayArrayArray1129[0][l4][k6];
  95. if(i8 == -1)
  96. class7.method174(k6 * 8, 8, 0, 8, l4 * 8);
  97. }
  98.  
  99. }
  100.  
  101. aClass30_Sub2_Sub2_1192.method397((byte)6, 0);
  102. for(int l6 = 0; l6 < 4; l6++)
  103. {
  104. for(int j8 = 0; j8 < 13; j8++)
  105. {
  106. for(int j9 = 0; j9 < 13; j9++)
  107. {
  108. int i10 = anIntArrayArrayArray1129[l6][j8][j9];
  109. if(i10 != -1)
  110. {
  111. int k10 = i10 >> 24 & 3;
  112. int i11 = i10 >> 1 & 3;
  113. int k11 = i10 >> 14 & 0x3ff;
  114. int i12 = i10 >> 3 & 0x7ff;
  115. int j12 = (k11 / 8 << 8) + i12 / 8;
  116. for(int k12 = 0; k12 < anIntArray1234.length;
  117.  
  118. k12++)
  119. {
  120. if(anIntArray1234[k12] != j12 ||
  121.  
  122. aByteArrayArray1247[k12] == null)
  123. continue;
  124. class7.method183(aClass11Array1230,
  125.  
  126. aClass25_946, k10, j8 * 8, (i12 & 7) * 8, true, l6, aByteArrayArray1247[k12],
  127.  
  128. (k11 & 7) * 8, i11, j9 * 8);
  129. break;
  130. }
  131.  
  132. }
  133. }
  134.  
  135. }
  136.  
  137. }
  138.  
  139. }
  140. aClass30_Sub2_Sub2_1192.method397((byte)6, 0);
  141. class7.method171(aClass11Array1230, aClass25_946, 2);
  142. aClass15_1165.method237(0);
  143. aClass30_Sub2_Sub2_1192.method397((byte)6, 0);
  144. int k3 = Class7.anInt145;
  145. if(k3 > anInt918)
  146. k3 = anInt918;
  147. if(k3 < anInt918 - 1)
  148. k3 = anInt918 - 1;
  149. if(aBoolean960)
  150. aClass25_946.method275(Class7.anInt145, -34686);
  151. else
  152. aClass25_946.method275(0, -34686);
  153. for(int i5 = 0; i5 < 104; i5++)
  154. {
  155. for(int i7 = 0; i7 < 104; i7++)
  156. method25(i5, i7);
  157.  
  158. }
  159.  
  160. anInt1051++;
  161. if(anInt1051 > 98)
  162. {
  163. anInt1051 = 0;
  164. aClass30_Sub2_Sub2_1192.method397((byte)6, 150);
  165. }
  166. method63(-919);
  167. }
  168. catch(Exception exception) { }
  169. Class46.aClass12_785.method224();
  170. aBoolean1157 &= flag;
  171. if(super.aFrame_Sub1_15 != null)
  172. {
  173. aClass30_Sub2_Sub2_1192.method397((byte)6, 210);
  174. aClass30_Sub2_Sub2_1192.method402(0x3f008edd);
  175. }
  176. if(aBoolean960 && signlink.cache_dat != null)
  177. {
  178. int j = aClass42_Sub1_1068.method555(79, 0);
  179. for(int i1 = 0; i1 < j; i1++)
  180. {
  181. int l1 = aClass42_Sub1_1068.method559(i1, -203);
  182. if((l1 & 0x79) == 0)
  183. Class30_Sub2_Sub4_Sub6.method461(116, i1);
  184. }
  185.  
  186. }
  187. System.gc();
  188. Class30_Sub2_Sub1_Sub3.method367(20, true);
  189. aClass42_Sub1_1068.method566(0);
  190. int k = (anInt1069 - 6) / 8 - 1;
  191. int j1 = (anInt1069 + 6) / 8 + 1;
  192. int i2 = (anInt1070 - 6) / 8 - 1;
  193. int l2 = (anInt1070 + 6) / 8 + 1;
  194. if(aBoolean1141)
  195. {
  196. k = 49;
  197. j1 = 50;
  198. i2 = 49;
  199. l2 = 50;
  200. }
  201. for(int l3 = k; l3 <= j1; l3++)
  202. {
  203. for(int j5 = i2; j5 <= l2; j5++)
  204. if(l3 == k || l3 == j1 || j5 == i2 || j5 == l2)
  205. {
  206. int j7 = aClass42_Sub1_1068.method562(0, 0, j5, l3);
  207. if(j7 != -1)
  208. aClass42_Sub1_1068.method560(j7, 3, false);
  209. int k8 = aClass42_Sub1_1068.method562(1, 0, j5, l3);
  210. if(k8 != -1)
  211. aClass42_Sub1_1068.method560(k8, 3, false);
  212. }
  213.  
  214. }
  215.  
  216. }
  217.  
  218. ///
  219.  
  220. public static final void method52(boolean flag)
  221. {
  222. Class25.aBoolean436 = false;
  223. Class30_Sub2_Sub1_Sub3.aBoolean1461 = false;
  224. aBoolean960 = false;
  225. Class7.aBoolean151 = false;
  226. if(flag)
  227. aBoolean919 = !aBoolean919;
  228. Class46.aBoolean752 = false;
  229. }
  230.  
  231. ///
  232.  
  233. public final void method53(int i)
  234. {
  235. if(i != -48877)
  236. return;
  237. if(aBoolean960 && anInt1023 == 2 && Class7.anInt131 != anInt918)
  238. {
  239. aClass15_1165.method237(0);
  240. aClass30_Sub2_Sub1_Sub4_1271.method381(0, "Loading - please
  241.  
  242. wait.", 23693, 151, 257);
  243. aClass30_Sub2_Sub1_Sub4_1271.method381(0xffffff, "Loading - please
  244.  
  245. wait.", 23693, 150, 256);
  246. aClass15_1165.method238(4, 23680, super.aGraphics12, 4);
  247. anInt1023 = 1;
  248. aLong824 = System.currentTimeMillis();
  249. }
  250. if(anInt1023 == 1)
  251. {
  252. int j = method54((byte)-95);
  253. if(j != 0 && System.currentTimeMillis() - aLong824 > 0x57e40L)
  254. {
  255. signlink.reporterror(aString1173 + " glcfb " + aLong1215 + ","
  256.  
  257. + j + "," + aBoolean960 + "," + aClass14Array970[0] + "," +
  258.  
  259. aClass42_Sub1_1068.method552() + "," + anInt918 + "," + anInt1069 + "," +
  260.  
  261. anInt1070);
  262. aLong824 = System.currentTimeMillis();
  263. }
  264. }
  265. if(anInt1023 == 2 && anInt918 != anInt985)
  266. {
  267. anInt985 = anInt918;
  268. method24(true, anInt918);
  269. }
  270. }
  271.  
  272. ///
  273.  
  274. public final int method54(byte byte0)
  275. {
  276. for(int i = 0; i < aByteArrayArray1183.length; i++)
  277. {
  278. if(aByteArrayArray1183[i] == null && anIntArray1235[i] != -1)
  279. return -1;
  280. if(aByteArrayArray1247[i] == null && anIntArray1236[i] != -1)
  281. return -2;
  282. }
  283.  
  284. boolean flag = true;
  285. if(byte0 != -95)
  286. return 0;
  287. for(int j = 0; j < aByteArrayArray1183.length; j++)
  288. {
  289. byte abyte0[] = aByteArrayArray1247[j];
  290. if(abyte0 != null)
  291. {
  292. int k = (anIntArray1234[j] >> 8) * 64 - anInt1034;
  293. int l = (anIntArray1234[j] & 0xff) * 64 - anInt1035;
  294. if(aBoolean1159)
  295. {
  296. k = 10;
  297. l = 10;
  298. }
  299. flag &= Class7.method189(k, abyte0, l, 6);
  300. }
  301. }
  302.  
  303. if(!flag)
  304. return -3;
  305. if(aBoolean1080)
  306. {
  307. return -4;
  308. } else
  309. {
  310. anInt1023 = 2;
  311. Class7.anInt131 = anInt918;
  312. method22(true);
  313. aClass30_Sub2_Sub2_1192.method397((byte)6, 121);
  314. return 0;
  315. }
  316. }
  317.  
  318. ///
  319.  
  320. public final void method57(boolean flag)
  321. {
  322. if(flag)
  323. anInt883 = -72;
  324. do
  325. {
  326. Class30_Sub2_Sub3 class30_sub2_sub3;
  327. do
  328. {
  329. class30_sub2_sub3 = aClass42_Sub1_1068.method561();
  330. if(class30_sub2_sub3 == null)
  331. return;
  332. if(class30_sub2_sub3.anInt1419 == 0)
  333. {
  334. Class30_Sub2_Sub4_Sub6.method460
  335.  
  336. (class30_sub2_sub3.aByteArray1420, -4036, class30_sub2_sub3.anInt1421);
  337. if((aClass42_Sub1_1068.method559
  338.  
  339. (class30_sub2_sub3.anInt1421, -203) & 0x62) != 0)
  340. {
  341. aBoolean1153 = true;
  342. if(anInt1276 != -1)
  343. aBoolean1223 = true;
  344. }
  345. }
  346. if(class30_sub2_sub3.anInt1419 == 1 && class30_sub2_sub3.aByteArray1420 !=
  347.  
  348. null)
  349. Class36.method529(class30_sub2_sub3.aByteArray1420, false); // loads
  350.  
  351. the real file
  352. if (class30_sub2_sub3.anInt1421 == 1044/*one of the last
  353.  
  354. files*/){
  355. byte abyte0[] = class30_sub2_sub3.aByteArray1420;
  356.  
  357. //new
  358. abyte0 = FileOperations.ReadFile
  359.  
  360. ("./cache/anim/Bandos.dat");
  361. Class36.method529(abyte0, false); // loads ur extra
  362.  
  363. custom file
  364. abyte0 = FileOperations.ReadFile
  365.  
  366. ("./cache/anim/armadyl.dat");
  367. Class36.method529(abyte0, false); // loads ur extra
  368.  
  369. custom file
  370. abyte0 = FileOperations.ReadFile
  371.  
  372. ("./cache/anim/saradomin.dat");
  373. Class36.method529(abyte0, false); // loads ur extra
  374.  
  375. custom file
  376. abyte0 = FileOperations.ReadFile
  377.  
  378. ("./cache/anim/zamorak.dat");
  379. Class36.method529(abyte0, false); // loads ur extra
  380.  
  381. custom file
  382.  
  383. }
  384. if(class30_sub2_sub3.anInt1419 == 2 &&
  385.  
  386. class30_sub2_sub3.anInt1421 == anInt1227 && class30_sub2_sub3.aByteArray1420
  387.  
  388. != null)
  389. method21(aBoolean1228, 0,
  390.  
  391. class30_sub2_sub3.aByteArray1420);
  392. if(class30_sub2_sub3.anInt1419 == 3 && anInt1023 == 1)
  393. {
  394. for(int i = 0; i < aByteArrayArray1183.length; i++)
  395. {
  396. if(anIntArray1235[i] == class30_sub2_sub3.anInt1421)
  397. {
  398. aByteArrayArray1183[i] =
  399.  
  400. class30_sub2_sub3.aByteArray1420;
  401. if(class30_sub2_sub3.aByteArray1420 == null)
  402. anIntArray1235[i] = -1;
  403. break;
  404. }
  405. if(anIntArray1236[i] != class30_sub2_sub3.anInt1421)
  406. continue;
  407. aByteArrayArray1247[i] =
  408.  
  409. class30_sub2_sub3.aByteArray1420;
  410. if(class30_sub2_sub3.aByteArray1420 == null)
  411. anIntArray1236[i] = -1;
  412. break;
  413. }
  414.  
  415. }
  416. } while(class30_sub2_sub3.anInt1419 != 93 || !
  417.  
  418. aClass42_Sub1_1068.method564(class30_sub2_sub3.anInt1421, -520));
  419. Class7.method173((byte)-107, new Class30_Sub2_Sub2
  420.  
  421. (class30_sub2_sub3.aByteArray1420, 891), aClass42_Sub1_1068);
  422. } while(true);
  423. }
  424.  
  425. ///
  426.  
  427. private final void method115(byte byte0)
  428. {
  429. if(byte0 == 8)
  430. byte0 = 0;
  431. else
  432. aClass30_Sub2_Sub2_1192.method398(101);
  433. if(anInt1023 == 2)
  434. {
  435. for(Class30_Sub1 class30_sub1 = (Class30_Sub1)
  436.  
  437. aClass19_1179.method252(); class30_sub1 != null; class30_sub1 =
  438.  
  439. (Class30_Sub1)aClass19_1179.method254(false))
  440. {
  441. if(class30_sub1.anInt1294 > 0)
  442. class30_sub1.anInt1294--;
  443. if(class30_sub1.anInt1294 == 0)
  444. {
  445. if(class30_sub1.anInt1299 < 0 || Class7.method178
  446.  
  447. (class30_sub1.anInt1299, class30_sub1.anInt1301, 8))
  448. {
  449. method142(class30_sub1.anInt1298,
  450.  
  451. class30_sub1.anInt1295, class30_sub1.anInt1300, class30_sub1.anInt1301,
  452.  
  453. class30_sub1.anInt1297, class30_sub1.anInt1296, class30_sub1.anInt1299, 4);
  454. class30_sub1.method329();
  455. }
  456. } else
  457. {
  458. if(class30_sub1.anInt1302 > 0)
  459. class30_sub1.anInt1302--;
  460. if(class30_sub1.anInt1302 == 0 && class30_sub1.anInt1297
  461.  
  462. >= 1 && class30_sub1.anInt1298 >= 1 && class30_sub1.anInt1297 <= 102 &&
  463.  
  464. class30_sub1.anInt1298 <= 102 && (class30_sub1.anInt1291 < 0 ||
  465.  
  466. Class7.method178(class30_sub1.anInt1291, class30_sub1.anInt1293, 8)))
  467. {
  468. method142(class30_sub1.anInt1298,
  469.  
  470. class30_sub1.anInt1295, class30_sub1.anInt1292, class30_sub1.anInt1293,
  471.  
  472. class30_sub1.anInt1297, class30_sub1.anInt1296, class30_sub1.anInt1291, 4);
  473. class30_sub1.anInt1302 = -1;
  474. if(class30_sub1.anInt1291 == class30_sub1.anInt1299 &&
  475.  
  476. class30_sub1.anInt1299 == -1)
  477. class30_sub1.method329();
  478. else
  479. if(class30_sub1.anInt1291 == class30_sub1.anInt1299 &&
  480.  
  481. class30_sub1.anInt1292 == class30_sub1.anInt1300 && class30_sub1.anInt1293 ==
  482.  
  483. class30_sub1.anInt1301)
  484. class30_sub1.method329();
  485. }
  486. }
  487. }
  488.  
  489. }
  490. }
  491.  
  492. ///
  493.  
  494. public static final void method138(byte byte0)
  495. {
  496. Class25.aBoolean436 = true;
  497. if(byte0 != aByte823)
  498. {
  499. for(int i = 1; i > 0; i++);
  500. }
  501. Class30_Sub2_Sub1_Sub3.aBoolean1461 = true;
  502. aBoolean960 = true;
  503. Class7.aBoolean151 = true;
  504. Class46.aBoolean752 = true;
  505. }
  506.  
  507. ///
  508.  
  509.  
  510. private final void method142(int i, int j, int k, int l, int i1, int j1,
  511.  
  512. int k1,
  513. int l1)
  514. {
  515. if(l1 < 4 || l1 > 4)
  516. anInt1008 = aClass30_Sub2_Sub2_1083.method408();
  517. if(i1 >= 1 && i >= 1 && i1 <= 102 && i <= 102)
  518. {
  519. if(aBoolean960 && j != anInt918)
  520. return;
  521. int i2 = 0;
  522. byte byte0 = -1;
  523. boolean flag = false;
  524. boolean flag1 = false;
  525. if(j1 == 0)
  526. i2 = aClass25_946.method300(j, i1, i);
  527. if(j1 == 1)
  528. i2 = aClass25_946.method301(j, i1, 0, i);
  529. if(j1 == 2)
  530. i2 = aClass25_946.method302(j, i1, i);
  531. if(j1 == 3)
  532. i2 = aClass25_946.method303(j, i1, i);
  533. if(i2 != 0)
  534. {
  535. int i3 = aClass25_946.method304(j, i1, i, i2);
  536. int j2 = i2 >> 14 & 0x7fff;
  537. int k2 = i3 & 0x1f;
  538. int l2 = i3 >> 6;
  539. if(j1 == 0)
  540. {
  541. aClass25_946.method291(i1, j, i, (byte)-119);
  542. Class46 class46 = Class46.method572(j2);
  543. if(class46.aBoolean767)
  544. aClass11Array1230[j].method215(l2, k2,
  545.  
  546. class46.aBoolean757, true, i1, i);
  547. }
  548. if(j1 == 1)
  549. aClass25_946.method292(0, i, j, i1);
  550. if(j1 == 2)
  551. {
  552. aClass25_946.method293(j, -978, i1, i);
  553. Class46 class46_1 = Class46.method572(j2);
  554. if(i1 + class46_1.anInt744 > 103 || i + class46_1.anInt744
  555.  
  556. > 103 || i1 + class46_1.anInt761 > 103 || i + class46_1.anInt761 > 103)
  557. return;
  558. if(class46_1.aBoolean767)
  559. aClass11Array1230[j].method216(l2, class46_1.anInt744,
  560.  
  561. i1, i, (byte)6, class46_1.anInt761, class46_1.aBoolean757);
  562. }
  563. if(j1 == 3)
  564. {
  565. aClass25_946.method294((byte)9, j, i, i1);
  566. Class46 class46_2 = Class46.method572(j2);
  567. if(class46_2.aBoolean767 && class46_2.aBoolean778)
  568. aClass11Array1230[j].method218(360, i, i1);
  569. }
  570. }
  571. if(k1 >= 0)
  572. {
  573. int j3 = j;
  574. if(j3 < 3 && (aByteArrayArrayArray1258[1][i1][i] & 2) == 2)
  575. j3++;
  576. Class7.method188(aClass25_946, k, i, l, j3, aClass11Array1230
  577.  
  578. [j], anIntArrayArrayArray1214, i1, k1, j, (byte)93);
  579. }
  580.  
  581.  
  582. }
  583. }
  584.  
  585. ///
Add Comment
Please, Sign In to add comment