News for hackers. Stuff that matters.
Re:Functional isn't always better by jamwt on Friday October 07, 2011 @12:07PM (#3084577)
Haskell even has sugar for this via list comprehensions:

    Prelude> let pairs = "ABCD"
    Prelude> [(x, y) | x <- pairs, y <- pairs, x < y]
    [('A','B'),('A','C'),('A','D'),('B','C'),('B','D'),('C','D')]
Re:Functional isn't always better by dpatru on Friday October 07, 2011 @12:15PM (#3084629)
This generates the Cartesian product and filters. (x,y) where both x and y are drawn from the original list. The previous solution only generates pairs (x, y) where y is drawn from elements after x.