Rename IDGCA to IGDCA

It's incremental grid density clustering algorithm (IGDCA)
jagandecapri · May 29, 2018 · 8df0354 · 8df0354
1 parent 5dfd60e
commit 8df0354
Show file tree

Hide file tree

Showing 4 changed files with 6 additions and 6 deletions.
diff --git a/logs/IDGCA_benchmark_29_05_2018.log → logs/IGDCA_benchmark_29_05_2018.log b/logs/IDGCA_benchmark_29_05_2018.log → logs/IGDCA_benchmark_29_05_2018.log
diff --git a/tree/IDGCA.go → tree/IGDCA.go b/tree/IDGCA.go → tree/IGDCA.go
diff --git a/tree/IDGCA_benchmark_test.go → tree/IGDCA_benchmark_test.go b/tree/IDGCA_benchmark_test.go → tree/IGDCA_benchmark_test.go
@@ -56,10 +56,10 @@ func BenchmarkIGDCAVaryPoints(b *testing.B){
 			min := int(math.Pow(10.0, float64(j)))
 			max := int(math.Pow(10.0, float64(j+1)))
 			b.Run(fmt.Sprintf("%v/min-max=%d-%d/num_grids=%d", test.name, min, max, num_grids), func(b *testing.B){
+				b.StopTimer()
+				grids, min_dense_points, min_cluster_points := setupGrids(min, max, 8)
+				b.StartTimer()
 				for n := 0; n < b.N; n++{
-					b.StopTimer()
-					grids, min_dense_points, min_cluster_points := setupGrids(min, max, 8)
-					b.StartTimer()
 					test.fun(b, grids, min_dense_points, min_cluster_points)
 				}
 			})
@@ -83,10 +83,10 @@ func BenchmarkIGDCAVarySubspaces(b *testing.B){
 			min := 10
 			max := 100
 			b.Run(fmt.Sprintf("%v/min-max=%d-%d/num_grids=%d", test.name, min, max, num_grids), func(b *testing.B){
+				b.StopTimer()
+				grids, min_dense_points, min_cluster_points := setupGrids(10, 100,  num_grids)
+				b.StartTimer()
 				for n := 0; n < b.N; n++{
-					b.StopTimer()
-					grids, min_dense_points, min_cluster_points := setupGrids(10, 100,  num_grids)
-					b.StartTimer()
 					test.fun(b, grids, min_dense_points, min_cluster_points)
 				}
 			})

diff --git a/tree/IDGCA_test.go → tree/IGDCA_test.go b/tree/IDGCA_test.go → tree/IGDCA_test.go