improved csv implementation

src/test/java/it/unibz/inf/isochrone/network/AlgorithmRuntimeTest.java

@@ -18,6 +18,7 @@ import java.util.Calendar;
 import java.util.GregorianCalendar;
 import java.util.HashMap;
 import java.util.HashSet;
+import java.util.Iterator;
 import java.util.LinkedHashMap;
 import java.util.List;
 import java.util.Map;
@@ -228,6 +229,8 @@ public final class AlgorithmRuntimeTest {
 	}
 
 	private static void writeMapToCSV(final File file, final Set<Entry<String, Map<String, Long>>> resultSet, final int repeatCount) {
+		final String separator = ";";
+
 		BufferedWriter fw = null;
 		try {
 			fw = new BufferedWriter(new PrintWriter(file, RESULTFILE_ENCODING));
@@ -238,8 +241,12 @@ public final class AlgorithmRuntimeTest {
 				if (isFirstLine) {
 					fw.write("Runtime;");
 					final Set<String> algorithms = results.keySet();
-					for (String algorithmName : algorithms) {
-						fw.write(algorithmName + ";");
+					final Iterator<String> iter = algorithms.iterator();
+					while (iter.hasNext()) {
+						fw.write(iter.next());
+						if (iter.hasNext()) {
+							fw.write(separator);
+						}
 					}
 					fw.newLine();
 					isFirstLine = false;
@@ -247,8 +254,12 @@ public final class AlgorithmRuntimeTest {
 
 				fw.write(time + ";");
 				final Set<Entry<String, Long>> timeSet = results.entrySet();
-				for (Entry<String, Long> entry : timeSet) {
-					fw.write((entry.getValue().longValue() / repeatCount) + ";");
+				final Iterator<Entry<String, Long>> iter = timeSet.iterator();
+				while (iter.hasNext()) {
+					fw.write(String.valueOf(iter.next().getValue().longValue() / repeatCount));
+					if (iter.hasNext()) {
+						fw.write(separator);
+					}
 				}
 				fw.newLine();
 			}