Correction of some bugs and performance enhancement.

[jaceP2P.git] / src / jaceP2P / UpdateRegisterThread.java

diff --git a/src/jaceP2P/UpdateRegisterThread.java b/src/jaceP2P/UpdateRegisterThread.java
index df8c036..1e352af 100644 (file)
--- a/src/jaceP2P/UpdateRegisterThread.java
+++ b/src/jaceP2P/UpdateRegisterThread.java
@@ -1,6 +1,6 @@
 package jaceP2P;
 
-import java.util.Vector;
+import java.util.ArrayList;
 
 class UpdateRegisterThread extends Thread {
        // Register reg = Register.Instance();
@@ -44,7 +44,7 @@ class UpdateRegisterThread extends Thread {
                        // Node node = Register.Instance().getNodeAt(index);
                        // Node node = reg.getNodeAt(index);
                        // Node voisin=reg.getNodeAt((index+1)%reg.getSize());
-                       Vector<Integer> dependencies = getDependencies(index, listOfTasks.getSize());
+                       ArrayList<Integer> dependencies = getDependencies(index, listOfTasks.getSize());
                        // System.out.println("la liste des voisins de : "+index);
                        // for(int z=0;z<dependencies.size();z++)
                        // System.out.print(((Integer)dependencies.elementAt(z)).intValue()+" ");
@@ -59,7 +59,7 @@ class UpdateRegisterThread extends Thread {
                        // g.setVersion(reg.getVersion());
                        for (int j = 0; j < dependencies.size(); j++) {
                                TaskId id = listOfTasks.getTaskIdOfRank(((Integer) dependencies
-                                               .elementAt(j)).intValue());
+                                               .get(j)).intValue());
                                // System.out.println("got id of :"+((Integer)dependencies.elementAt(j)).intValue());
                                newListOfTasks.addTask(id);
                                if (id.getHostStub() != null) {
@@ -137,9 +137,9 @@ class UpdateRegisterThread extends Thread {
 
        }
 
-       private Vector<Integer> getDependencies(int id, int jaceSize) {
+       private ArrayList<Integer> getDependencies(int id, int jaceSize) {
                // get computing dependencies
-               Vector<Integer> neighbors = new Vector<Integer>();
+               ArrayList<Integer> neighbors = new ArrayList<Integer>();
                int[] dep = null;
                // try{
                // if(tache==null)