gofmt -s

collision/rtree_test.go

@@ -279,7 +279,7 @@ func TestAdjustTreeNoPreviousSplit(t *testing.T) {
 	r10 := entry{bb: mustRect(floatgeom.Point3{1, 0}, [3]float64{1, 1, 1}).Location}
 	entries := []entry{r00, r01, r10}
 	n := node{rt.root, false, entries, 1}
-	rt.root.entries = []entry{entry{bb: floatgeom.Point3{0, 0}.ToRect(0), child: &n}}
+	rt.root.entries = []entry{{bb: floatgeom.Point3{0, 0}.ToRect(0), child: &n}}
 
 	rt.adjustTree(&n, nil)
 
@@ -753,9 +753,9 @@ func TestSortEntries(t *testing.T) {
 		mustRect(floatgeom.Point3{3, 3}, [3]float64{1, 1}),
 	}
 	entries := []entry{
-		entry{objs[2].Location, nil, objs[2]},
-		entry{objs[1].Location, nil, objs[1]},
-		entry{objs[0].Location, nil, objs[0]},
+		{objs[2].Location, nil, objs[2]},
+		{objs[1].Location, nil, objs[1]},
+		{objs[0].Location, nil, objs[0]},
 	}
 	sorted, dists := sortEntries(floatgeom.Point3{0, 0}, entries)
 	if sorted[0] != entries[2] || sorted[1] != entries[1] || sorted[2] != entries[0] {

shape/outline.go

@@ -91,7 +91,7 @@ func toOutline(shape Shape, dirInc int, sizes ...int) ([]intgeom.Point2, error)
 	x := sx
 	y := sy
 
-	outline := []intgeom.Point2{intgeom.Point2{x, y}}
+	outline := []intgeom.Point2{{x, y}}
 
 	direction := topright
 	for i := 1; i < dirInc; i++ {