small optimization

elementat.go

@@ -19,8 +19,10 @@ func ElementAt[T any, E IEnumerable[T]](src E, n int) (def T, err error) {
 // ElementAtOrDefault returns the element at a specified index in a sequence or a default value if the index is out of range.
 func ElementAtOrDefault[T any, E IEnumerable[T]](src E, n int) (T, error) {
 	v, err := ElementAt(src, n)
-	if isOutOfRange(err) {
-		err = nil
+	if err != nil {
+		if isOutOfRange(err) {
+			err = nil
+		}
 	}
 	return v, err
 }

last.go

@@ -21,8 +21,10 @@ func Last[T any, E IEnumerable[T]](src E) (def T, _ error) {
 // LastOrDefault returns the last element of a sequence that satisfies a condition, or a specified default value if no such element is found.
 func LastOrDefault[T any, E IEnumerable[T]](src E, defaultValue T) (T, error) {
 	v, err := Last(src)
-	if isInvalidOperation(err) {
-		return defaultValue, nil
+	if err != nil {
+		if isInvalidOperation(err) {
+			return defaultValue, nil
+		}
 	}
 	return v, err
 }

max.go

@@ -20,9 +20,6 @@ func Max[T constraints.Ordered, E IEnumerable[T]](src E) (def T, _ error) {
 			}
 			return def, err
 		}
-		if err != nil {
-			return def, err
-		}
 		if v > max {
 			max = v
 		}

min.go

@@ -20,9 +20,6 @@ func Min[T constraints.Ordered, E IEnumerable[T]](src E) (def T, _ error) {
 			}
 			return def, err
 		}
-		if err != nil {
-			return def, err
-		}
 		if v < min {
 			min = v
 		}