cleanup: remove redundant cast
This commit is contained in:
@@ -423,7 +423,7 @@ public class BCrypt {
|
||||
if ((int) x < 0 || (int) x > index_64.length) {
|
||||
return -1;
|
||||
}
|
||||
return index_64[(int) x];
|
||||
return index_64[x];
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -566,8 +566,8 @@ public class BCrypt {
|
||||
* Initialise the Blowfish key schedule
|
||||
*/
|
||||
private void init_key() {
|
||||
P = (int[]) P_orig.clone();
|
||||
S = (int[]) S_orig.clone();
|
||||
P = P_orig.clone();
|
||||
S = S_orig.clone();
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -797,7 +797,7 @@ public class BCrypt {
|
||||
hashed = B.crypt_raw(passwordb, saltb, rounds,
|
||||
minor == 'x', // true for sign extension bug ('2x')
|
||||
minor == 'a' ? 0x10000 : 0, // safety factor for '2a'
|
||||
(int[])bf_crypt_ciphertext.clone());
|
||||
bf_crypt_ciphertext.clone());
|
||||
|
||||
rs.append("$2");
|
||||
if (minor >= 'a') {
|
||||
|
||||
@@ -19,9 +19,6 @@
|
||||
*/
|
||||
package tools;
|
||||
|
||||
import java.awt.geom.Line2D;
|
||||
import java.util.ArrayList;
|
||||
import java.util.List;
|
||||
import net.server.audit.locks.MonitoredLockType;
|
||||
import net.server.audit.locks.MonitoredReadLock;
|
||||
import net.server.audit.locks.MonitoredReentrantReadWriteLock;
|
||||
@@ -29,6 +26,10 @@ import net.server.audit.locks.MonitoredWriteLock;
|
||||
import net.server.audit.locks.factory.MonitoredReadLockFactory;
|
||||
import net.server.audit.locks.factory.MonitoredWriteLockFactory;
|
||||
|
||||
import java.awt.geom.Line2D;
|
||||
import java.util.ArrayList;
|
||||
import java.util.List;
|
||||
|
||||
/**
|
||||
*
|
||||
* @author Ronan
|
||||
@@ -65,7 +66,7 @@ public class IntervalBuilder {
|
||||
newLimitX2 = newTo;
|
||||
}
|
||||
|
||||
intervalLimits.add(st, new Line2D.Float((float) newLimitX1, 0, (float) newLimitX2, 0));
|
||||
intervalLimits.add(st, new Line2D.Float(newLimitX1, 0, newLimitX2, 0));
|
||||
}
|
||||
|
||||
private int bsearchInterval(int point) {
|
||||
|
||||
@@ -450,9 +450,9 @@ public class MaplePacketCreator {
|
||||
List<Item> equippedCash = new ArrayList<>(equippedC.size());
|
||||
for (Item item : equippedC) {
|
||||
if (item.getPosition() <= -100) {
|
||||
equippedCash.add((Item) item);
|
||||
equippedCash.add(item);
|
||||
} else {
|
||||
equipped.add((Item) item);
|
||||
equipped.add(item);
|
||||
}
|
||||
}
|
||||
for (Item item : equipped) { // equipped doesn't actually need sorting, thanks Pllsz
|
||||
|
||||
Reference in New Issue
Block a user