Improve performance a little bit

b97tsk · Jan 30, 2024 · 7b44fa7 · 7b44fa7
1 parent 5ff38be
commit 7b44fa7
Show file tree

Hide file tree

Showing 6 changed files with 6 additions and 6 deletions.
diff --git a/difference.go b/difference.go
@@ -15,7 +15,7 @@ func Difference[E Elem[E]](z, x, y Set[E]) Set[E] {
 	inv := false
 
 	for {
-		if len(x) < len(y) {
+		if len(x) == 0 {
 			x, y = y, x
 			inv = !inv
 		}

diff --git a/intersection.go b/intersection.go
@@ -13,7 +13,7 @@ func Intersection[E Elem[E]](z, x, y Set[E]) Set[E] {
 	z = z[:0]
 
 	for {
-		if len(x) < len(y) {
+		if len(x) == 0 {
 			x, y = y, x
 		}
 

diff --git a/issubsetof.go b/issubsetof.go
@@ -7,7 +7,7 @@ func (x Set[E]) IsSubsetOf(y Set[E]) bool {
 	inv := false
 
 	for {
-		if len(x) < len(y) {
+		if len(x) == 0 {
 			x, y = y, x
 			inv = !inv
 		}

diff --git a/overlap.go b/overlap.go
@@ -5,7 +5,7 @@ import "sort"
 // Overlaps reports whether the intersection of x and y is not empty.
 func (x Set[E]) Overlaps(y Set[E]) bool {
 	for {
-		if len(x) < len(y) {
+		if len(x) == 0 {
 			x, y = y, x
 		}
 

diff --git a/symdiff.go b/symdiff.go
@@ -15,7 +15,7 @@ func SymmetricDifference[E Elem[E]](z, x, y Set[E]) Set[E] {
 	z = z[:0]
 
 	for {
-		if len(x) < len(y) {
+		if len(x) == 0 {
 			x, y = y, x
 		}
 

diff --git a/union.go b/union.go
@@ -13,7 +13,7 @@ func Union[E Elem[E]](z, x, y Set[E]) Set[E] {
 	z = z[:0]
 
 	for {
-		if len(x) < len(y) {
+		if len(x) == 0 {
 			x, y = y, x
 		}