Q1 - Is the following a set() of a generator expression or a set comprehension? (Or are they same? If so, are list & dict comprehensions also corresponding type-cast on generators?)
my_set = {x for x in range(10)}
Q2 - Does the evaluation consider duplicate values & then remove them by applying set()?
dup_set = {x for x in [0, 1, 2, 0, 1, 2]}
Does the comprehension perform (speed-wise) better than regular for loops?
Update - I tried using timeit for speed comparisons. Am not sure if I am being just (fair) about it.
C:\>python -m timeit "s = set()" "for x in range(10):" "
s.add(x)"
100000 loops, best of 3: 2.3 usec per loop
C:\>python -m timeit "s = {x for x in range(10)}"
1000000 loops, best of 3: 1.68 usec per loop
Now, using some conditionals
C:\>python -m timeit "s = set()" "for x in range(10):" "
if x%2: s.add(x)"
100000 loops, best of 3: 2.27 usec per loop
C:\>python -m timeit "s = {x for x in range(10) if x%2}"
1000000 loops, best of 3: 1.83 usec per loop
So, there is quite some difference, is it due to the functionality being hardcoded in c?