我在Haskell中创建了一个纸牌游戏，我需要知道每种花色的纸牌颜色。
现在，我使用cardCombinations构造花色、排名和颜色的所有可能组合，然后使用cardWithColors过滤结果以构造Deck
要求是我希望套装具有正确的关联颜色：方块红桃和黑桃梅花是黑色的。
有没有可能有一种更简洁的方式来表达这种逻辑，而不是先构造所有组合，然后再过滤它们？

module Deck (Suit,Color,Rank,Card,Deck) where

data Color = Red | Black deriving (Eq,Enum,Show,Ord,Bounded)

data Suit = Clubs | Diamonds | Hearts | Spades deriving (Eq,Ord,Enum,Bounded,Show)

data Rank = Two | Three | Four | Five | Six | Seven | Eight | Nine | Ten
          | Jack | Queen | King | Ace deriving (Eq,Ord,Enum,Bounded,Show)  

data Card = Card { rank :: Rank
                 , suit :: Suit
                 , color :: Color } deriving (Eq,Ord,Bounded,Show)

type Deck = [Card]

findColorForSuit :: Suit -> Color 
findColorForSuit suit 
    | any (suit==) [Diamonds, Hearts] = Red
    | any (suit==) [Spades, Clubs] = Black

cardCombinations = [(ranks, suits, colors) | ranks <- [minBound :: Rank .. maxBound :: Rank], suits <- [minBound :: Suit .. maxBound :: Suit], colors <- [minBound :: Color .. maxBound :: Color]]

cardsWithColors = filter (\(_,suit,color) -> (findColorForSuit suit) == color) cardCombinations

makeCard :: (Rank, Suit, Color) -> Card 
makeCard (rank, suit, color) = Card rank suit color 

makeCards :: Deck
makeCards = map makeCard cardsWithColors

我试着创建所有组合，然后根据过滤器 predicate 过滤结果，以确定如何将颜色与套装相关联。