mirrors/Nim
1
0
Fork 0
mirror of https://github.com/nim-lang/Nim.git synced 2025-12-28 17:04:41 +00:00
Code Issues Packages Projects Releases Wiki Activity

Iterate over smaller set when computing intersection (#15497)

Browse Source 
Closes #15496
This commit is contained in:
Benjamin Lee
2020-10-06 04:29:45 -04:00
committed by GitHub
parent aca1fae55a
commit acd71dd6bb
1 changed files with 9 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
lib/pure/collections/sets.nim
View File

@@ -422,8 +422,15 @@ proc intersection*[A](s1, s2: HashSet[A]): HashSet[A] =
assert c == toHashSet(["b"])
result = initHashSet[A](max(min(s1.data.len, s2.data.len), 2))
for item in s1:
if item in s2: incl(result, item)
# iterate over the elements of the smaller set
if s1.data.len < s2.data.len:
for item in s1:
if item in s2: incl(result, item)
else:
for item in s2:
if item in s1: incl(result, item)
proc difference*[A](s1, s2: HashSet[A]): HashSet[A] =
## Returns the difference of the sets `s1` and `s2`.