-/*
- * Copyright 2006-2012. The SimGrid Team. All rights reserved.
- *
- * This program is free software; you can redistribute it and/or modify it
- * under the terms of the license (GNU LGPL) which comes with this package.
- */
+/* Copyright (c) 2006-2014. The SimGrid Team.
+ * All rights reserved. */
+
+/* This program is free software; you can redistribute it and/or modify it
+ * under the terms of the license (GNU LGPL) which comes with this package. */
+
package bittorrent;
import java.util.ArrayList;
import java.util.HashMap;
-import java.util.HashSet;
import java.util.Iterator;
import java.util.Map.Entry;
import org.simgrid.msg.Host;
import org.simgrid.msg.Msg;
import org.simgrid.msg.MsgException;
-import org.simgrid.msg.RngStream;
import org.simgrid.msg.Process;
+import org.simgrid.msg.RngStream;
import org.simgrid.msg.Task;
-import bittorrent.Connection;
-
/**
* Main class for peers execution
*/
return;
}
if (true || pieces < 3) {
- int i = 0, peerPiece;
+ int peerPiece;
do {
currentPiece = stream.randInt(0,Common.FILE_PIECES - 1);
- i++;
} while (!(bitfield[currentPiece] == '0' && !currentPieces.contains(currentPiece)));
}
else {
peerChoosed = null;
}
j++;
- } while (peerChoosed == null && j <
- Common.MAXIMUM_PEERS);
+ } while (peerChoosed == null && j < Common.MAXIMUM_PEERS);
}
else {
Connection fastest = null;