Say I have code like immutabe T x::Int y::Int end
Q=fill(T(1,2),10000) I want to essentially construct W = [t.y for t in Q] The list comprehension method seems inefficient, since W is really just a strided view of Q with a stride and offset of 64 bits. Is there any convenient syntax to construct W that takes advantage of that fact?
