golint fixes #2

bitset/bitset.go

@@ -250,7 +250,7 @@ func (b *Bitset) ByteAt(index int) byte {
 		log.Panicf("Index %d out of range", index)
 	}
 
-	var result byte = 0
+	var result byte
 
 	for i := index; i < index+8 && i < b.numBits; i++ {
 		result <<= 1

reedsolomon/gf_poly_test.go

@@ -75,7 +75,7 @@ func TestGFPolyequals(t *testing.T) {
 	}
 
 	for _, test := range tests {
-		var isEqual bool = test.a.equals(test.b)
+		isEqual := test.a.equals(test.b)
 
 		if isEqual != test.isEqual {
 			t.Errorf("%s and %s equality is %t (got %t)\n", test.a.string(false), test.b.string(false),

reedsolomon/reed_solomon.go

@@ -1,7 +1,7 @@
 // go-qrcode
 // Copyright 2014 Tom Harwood
 
-// Reed-Solomon error correction for QR Code 2005.
+// Package reedsolomon provides error correction encoding for QR Code 2005.
 //
 // QR Code 2005 uses a Reed-Solomon error correcting code to detect and correct
 // errors encountered during decoding.

reedsolomon/reed_solomon_test.go

@@ -73,10 +73,10 @@ func TestEncode(t *testing.T) {
 	}
 
 	for _, test := range tests {
-		var data *bitset.Bitset = bitset.NewFromBase2String(test.data)
-		var rsCode *bitset.Bitset = bitset.NewFromBase2String(test.rsCode)
+		data := bitset.NewFromBase2String(test.data)
+		rsCode := bitset.NewFromBase2String(test.rsCode)
 
-		var result *bitset.Bitset = Encode(data, test.numECBytes)
+		result := Encode(data, test.numECBytes)
 
 		if !rsCode.Equals(result) {
 			t.Errorf("data=%s, numECBytes=%d, encoded=%s, want %s",