No, not really:
http://stackoverflow.com/questions/310426/list-comprehension...
No, not really:
http://stackoverflow.com/questions/310426/list-comprehension...
[(1..6),(4..6),(7..9)].comprehension { |a, b, c| a + b + c if a % 2 == 0 }
And if you go to extremes like https://gist.github.com/3356675 you can use Haskell-like syntax: [a + b | a <- ['n','p'..'t'], b <- %w[a i u e o]]
Ruby's blocks and method_missing are very powerful.Just to be clear, I am not the original author. I was impressed with it myself. :)
NB. Correction to my earlier comment elsewhere here about List::Gen & multiple lists because it does provide cross combinators and also gather/take which is a perl6 way of doing complicated (multi) list comprehensions.
Here are the two examples written in perl6 (which do work in Rakudo).
gather for 1..6 X 4..6 X 7..9 -> $a, $b, $c { take $a + $b + $c if $a %% 2 }
gather for ('n', 'p'..'t') X <a i u e o> -> $a, $b { take $a ~ $b }However like the Ruby example this only works on a single list. Which reminds me that I keep meaning to write a port of CL loop in Perl using Devel::Declare.
ref: https://metacpan.org/module/List::Maker | https://metacpan.org/module/List::Gen | https://metacpan.org/module/Devel::Declare