A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
jaceP2P.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Correction of some bugs and performance enhancement.
[jaceP2P.git]
/
src
/
jaceP2P
/
BackupsManager.java
diff --git
a/src/jaceP2P/BackupsManager.java
b/src/jaceP2P/BackupsManager.java
index
429fce3
..
a9ce334
100644
(file)
--- a/
src/jaceP2P/BackupsManager.java
+++ b/
src/jaceP2P/BackupsManager.java
@@
-1,6
+1,7
@@
package jaceP2P;
package jaceP2P;
-import java.util.Vector;
+import java.util.ArrayList;
+
public class BackupsManager {
final int MAX_COUNT_NOT_ALIVE = 3;
public class BackupsManager {
final int MAX_COUNT_NOT_ALIVE = 3;
@@
-8,8
+9,8
@@
public class BackupsManager {
// attributes
public static BackupsManager Instance;
public int myRank = -1;
// attributes
public static BackupsManager Instance;
public int myRank = -1;
- public
Vector<Backup> liste = new Vector
<Backup>();
- public
Vector<Backup> liste_Convg = new Vector
<Backup>();
+ public
ArrayList<Backup> liste = new ArrayList
<Backup>();
+ public
ArrayList<Backup> liste_Convg = new ArrayList
<Backup>();
// constructors
private BackupsManager() {
// constructors
private BackupsManager() {
@@
-175,7
+176,7
@@
public class BackupsManager {
int isIn = existBackupTaskOfRank(t.getTaskRank(), tag);
if (isIn == -1) { // si elle y est pas on l'isere
int isIn = existBackupTaskOfRank(t.getTaskRank(), tag);
if (isIn == -1) { // si elle y est pas on l'isere
- liste.add
Element(t)
;
+ liste.add
( t )
;
}
}
@@
-187,7
+188,7
@@
public class BackupsManager {
int isIn = existBackupTaskOfRank(t.getTaskRank(), tag);
if (isIn == -1) {
int isIn = existBackupTaskOfRank(t.getTaskRank(), tag);
if (isIn == -1) {
- liste_Convg.add
Element(t)
;
+ liste_Convg.add
( t )
;
} else
liste_Convg.set(isIn, t);
}
} else
liste_Convg.set(isIn, t);
}
@@
-221,7
+222,7
@@
public class BackupsManager {
int ite;
int lastIte = -1;
int lastBackupRank = -1;
int ite;
int lastIte = -1;
int lastBackupRank = -1;
-
Vector<?
> v;
+
ArrayList<Integer
> v;
int timeStep;
int lastStep = -1;
boolean ack = false;
int timeStep;
int lastStep = -1;
boolean ack = false;
@@
-284,7
+285,7
@@
public class BackupsManager {
int lastBackupRank = -1;
boolean ack = false;
int count;
int lastBackupRank = -1;
boolean ack = false;
int count;
-
Vector<?
> v;
+
ArrayList<Integer
> v;
int timeStep;
int lastStep = -1;
// ask for ite number of Backups of all my Backup Nodes
int timeStep;
int lastStep = -1;
// ask for ite number of Backups of all my Backup Nodes