Possible optimization for list comprehension using map?

[catc...@bromberger.com]

Sorry if this counts as a cross-post, but I have some more information.

I have been using list comprehensions of the form

bar(g, a) = [Pair(x, g) for x in a]

but recently evaluated 

foo(g, a) = map(x->Pair(x, g), a)as an alternative.

It turns out that the list comprehension is slower (and, from the code_native, more complex) than the map.

output here: https://gist.github.com/sbromberger/b5656189bcece492ffd9

Are these two functions equivalent?

[catc...@bromberger.com]

Closing this out in favor of the discussion at https://groups.google.com/d/msg/julia-users/QMEvSThtXGI/RJlKuIsThl8J. Sorry for the noise.