set: no extra slice required

1 files changed, 3 insertions, 3 deletions

diff --git a/skate/set/set.go b/skate/set/set.go
index b762cb8..7e06a1b 100644
--- a/skate/set/set.go
+++ b/skate/set/set.go
@@ -65,9 +65,9 @@ func (s Set) Contains(v string) bool {
 // Intersection returns a new set containing all elements found in both sets.
 func (s Set) Intersection(t Set) Set {
 	u := New()
-	for _, v := range s.Slice() {
-		if t.Contains(v) {
-			u.Add(v)
+	for k := range s {
+		if t.Contains(k) {
+			u.Add(k)
 		}
 	}
 	return u