code optimization

glob.go

@@ -119,11 +119,7 @@ func NewDot() Token {
 }
 
 func (d dot) Equal(other Token) bool {
-	if d.Type() != other.Type() {
-		return false
-	}
-
-	return true
+	return d.Type() == other.Type()
 }
 
 func (d dot) String() string {

non_empty.go

@@ -150,10 +150,6 @@ func intersectStar(starred, other Glob) bool {
 	}
 
 	// If there was no token following starToken, and everything from other was gobbled, the Globs intersect.
-	if nextToken == nil {
-		return true
-	}
-
-	// If everything from other was gobbles but there was a nextToken to match, they don't intersect.
-	return false
+	//If everything from other was gobbles but there was a nextToken to match, they don't intersect.
+	return nextToken == nil
 }

non_empty_bench_test.go

@@ -85,8 +85,8 @@ func BenchmarkInterspersedStarsEmptyEnd(b *testing.B) {
 	// smallLimit specifies the maximum star count of the smaller of two inputs.
 	// largeLimit specifies the maximum star count of the larger of two inputs.
 	smallLimit, largeLimit := 10, 50
-	inputL := make([]string, largeLimit+1, largeLimit+1)
-	inputR := make([]string, largeLimit+1, largeLimit+1)
+	inputL := make([]string, largeLimit+1)
+	inputR := make([]string, largeLimit+1)
 
 	for i := 1; i <= largeLimit; i++ {
 		inputL[i], inputR[i] = interspersedStars(i - 1)