gofmt -r 'α[β:len(α)] -> α[β:]' -w src/cmd src/pkg

R=r, gri
CC=golang-dev
http://codereview.appspot.com/156115

2 files changed, 8 insertions, 8 deletions

diff --git a/src/pkg/image/png/reader.go b/src/pkg/image/png/reader.go
index ac35df810..96528af0d 100644
--- a/src/pkg/image/png/reader.go
+++ b/src/pkg/image/png/reader.go
@@ -216,8 +216,8 @@ func (d *decoder) idatReader(idat io.Reader) os.Error {
 		}
 
 		// Apply the filter.
-		cdat := cr[1:len(cr)];
-		pdat := pr[1:len(pr)];
+		cdat := cr[1:];
+		pdat := pr[1:];
 		switch cr[0] {
 		case ftNone:
 			// No-op.
diff --git a/src/pkg/image/png/writer.go b/src/pkg/image/png/writer.go
index 08d09f135..9ec2544d0 100644
--- a/src/pkg/image/png/writer.go
+++ b/src/pkg/image/png/writer.go
@@ -137,12 +137,12 @@ func filter(cr [][]byte, pr []byte, bpp int) int {
 	// This is the same heuristic that libpng uses, although the filters are attempted in order of
 	// estimated most likely to be minimal (ftUp, ftPaeth, ftNone, ftSub, ftAverage), rather than
 	// in their enumeration order (ftNone, ftSub, ftUp, ftAverage, ftPaeth).
-	cdat0 := cr[0][1:len(cr[0])];
-	cdat1 := cr[1][1:len(cr[1])];
-	cdat2 := cr[2][1:len(cr[2])];
-	cdat3 := cr[3][1:len(cr[3])];
-	cdat4 := cr[4][1:len(cr[4])];
-	pdat := pr[1:len(pr)];
+	cdat0 := cr[0][1:];
+	cdat1 := cr[1][1:];
+	cdat2 := cr[2][1:];
+	cdat3 := cr[3][1:];
+	cdat4 := cr[4][1:];
+	pdat := pr[1:];
 	n := len(cdat0);
 
 	// The up filter.