summaryrefslogtreecommitdiff
path: root/benchmark
diff options
context:
space:
mode:
authorDidier 'Ptitjes <ptitjes@free.fr>2009-09-28 18:45:58 +0200
committerDidier 'Ptitjes <ptitjes@free.fr>2009-09-28 19:04:45 +0200
commit1ab9f390c946d64b556de57cdd00208ddd6e54cc (patch)
tree5278a0864894e423e3bc0455de4d2dddc3f802aa /benchmark
parent8a6a137fa900b11da2073f78bd873218e65f5534 (diff)
downloadlibgee-1ab9f390c946d64b556de57cdd00208ddd6e54cc.tar.gz
Make some style consistence enhancements
Diffstat (limited to 'benchmark')
-rw-r--r--benchmark/benchmark.vala10
1 files changed, 5 insertions, 5 deletions
diff --git a/benchmark/benchmark.vala b/benchmark/benchmark.vala
index 444ee3a..0aae1a5 100644
--- a/benchmark/benchmark.vala
+++ b/benchmark/benchmark.vala
@@ -63,7 +63,7 @@ namespace Gee.Benchmark {
public void generate_collection (int size, Collection<int32> collection) {
int variance = (int) Math.sqrt (size);
- for(int i = 0; i < size; i++) {
+ for (int i = 0; i < size; i++) {
collection.add (i + GLib.Random.int_range (0, variance) - variance / 2);
}
}
@@ -80,7 +80,7 @@ namespace Gee.Benchmark {
while (index < size) {
int width = GLib.Random.int_range (0, variance);
int height = GLib.Random.int_range (- variance / 2, variance / 2);
- for(int i = 0; i < width; i++) {
+ for (int i = 0; i < width; i++) {
collection.add (last + height / width);
}
index += width;
@@ -94,7 +94,7 @@ namespace Gee.Benchmark {
public string name { get { return "ReverseSorted"; } }
public void generate_collection (int size, Collection<int32> collection) {
- for(int i = 0; i < size; i++) {
+ for (int i = 0; i < size; i++) {
collection.add (size - i - 1);
}
}
@@ -105,7 +105,7 @@ namespace Gee.Benchmark {
public string name { get { return "Sorted"; } }
public void generate_collection (int size, Collection<int32> collection) {
- for(int i = 0; i < size; i++) {
+ for (int i = 0; i < size; i++) {
collection.add (i);
}
}
@@ -171,7 +171,7 @@ namespace Gee.Benchmark {
for (int i = 0; i < sizes.length; i++) {
int size = sizes[i];
for (int j = 0; j < generators.size; j++) {
- Collection<G> collection = factory.create();
+ Collection<G> collection = factory.create ();
generators[j].generate_collection (size, collection);
for (int k = 0; k < algorithms.size; k++) {