So you have two lists and you want to make the intersection of it.
So you think about it for 3 seconds and than you write something like:
a = [1,2,3,4,"B"] b = [2, "B"] c =  for e in a: if e in b: c.append(e)
This works, it seems very idiomatic and you’re done with it.
The problem this is extremely slow.
In other words writing a loop in python is a bad idea.
Why is slow? Because Loops in python are slow. Extremely slow.
However if you have a mixture of object like above, you can just stick with python datastructure and use sets. If you do not have duplicates you’re out of luck…
With sets it will look like:
a = [1,2,3,4,"B"] b = [2, "B"] sa = set(a) sb = set(b) c = sa.intersection(sb)
For yours and my convenience, I’ve written a little gist to time it and plot it.
Let’s see the results: (timings in seconds)
So with 10000 elements, with a list takes ~ 0.48 seconds, and with a set 0.0012 seconds, with a 100000 elements a list takes 49 seconds, and the set operation 0.017.
Two Take Home Messages:
- If you are writing a for loop, you’re doing it wrong
- If you have to intersect or unify list, transform them to sets and use the built-in function.