forked from I2P_Developers/i2p.i2p

* Code Janitor time! Many fixes and documenting fixes that should be done in the future. for the most part, this is a general code cleanup. * On smaller/embedded systems, the "final" keyword cleanups will have more of an impact than on larger systems. * Document missing hashCode() methods. * Unhide more variables to make code easier to read.
55 lines
1.4 KiB
Java
55 lines
1.4 KiB
Java
package org.klomp.snark;
|
|
|
|
import java.util.Collections;
|
|
import java.util.HashSet;
|
|
import java.util.Set;
|
|
|
|
public class Piece implements Comparable {
|
|
|
|
private int id;
|
|
private Set peers;
|
|
private boolean requested;
|
|
|
|
public Piece(int id) {
|
|
this.id = id;
|
|
this.peers = Collections.synchronizedSet(new HashSet());
|
|
this.requested = false;
|
|
}
|
|
|
|
public int compareTo(Object o) throws ClassCastException {
|
|
return this.peers.size() - ((Piece)o).peers.size();
|
|
}
|
|
|
|
@Override
|
|
public boolean equals(Object o) {
|
|
if (o instanceof Piece) {
|
|
if (o == null) return false;
|
|
try {
|
|
return this.id == ((Piece)o).id;
|
|
} catch (ClassCastException cce) {
|
|
return false;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
@Override
|
|
public int hashCode() {
|
|
int hash = 5;
|
|
hash = 31 * hash + this.id;
|
|
return hash;
|
|
}
|
|
|
|
public int getId() { return this.id; }
|
|
public Set getPeers() { return this.peers; }
|
|
public boolean addPeer(Peer peer) { return this.peers.add(peer.getPeerID()); }
|
|
public boolean removePeer(Peer peer) { return this.peers.remove(peer.getPeerID()); }
|
|
public boolean isRequested() { return this.requested; }
|
|
public void setRequested(boolean requested) { this.requested = requested; }
|
|
|
|
@Override
|
|
public String toString() {
|
|
return String.valueOf(id);
|
|
}
|
|
}
|