package peer;
import java.util.Hashtable;
import util.Log;
import junit.framework.TestCase;
public class DumbStrategyTest extends TestCase {
PeerHash myMap = new PeerHash();
DumbStrategy dumb;
protected void setUp() throws Exception {
super.setUp();
dumb = new DumbStrategy();
myMap.set(new Peer("key1",0,0));
myMap.set(new Peer("key2",0,0));
myMap.set(new Peer("key3",0,0));
}
public void testRemoveAllNodes() {
dumb.removeDeadNodes(myMap, new Log());
assertTrue(myMap.getHashtable().size() == 3);
}
public void testGetNearestPeers() {
PeerHash nearestPeers = dumb.getNearestPeers(myMap, new Log());
assertTrue(myMap.getHashtable().size() == 3);
assertTrue(myMap.getHashtable().containsKey("key1"));
assertTrue(myMap.getHashtable().containsKey("key2"));
assertTrue(myMap.getHashtable().containsKey("key3"));
}
}