Safe Haskell	None
Language	Haskell98

Data.HCard

Description

Author : Joe Fredette License : BSD3 Copyright : Joe Fredette

Maintainer : Joe Fredette jfredett.at.gmail.dot.com Stability : Unstable Portability : portable

Synopsis

Documentation

class (Eq s, Eq i, Show s, Show i) => Card s i where Source

The Main class, this is -- effectively -- a type-indexed record. Specifically, it requires two types, one representing the suit, the other representing the index/rank. The suit, index, and construct functions are generic forms of the record accessors.

The bulk of the implementation takes place in generic type instances, supporting equality irrelevant of ordering, ordering, parsing from a "normal form" (index-suit) and enum/bounded

TODO: Write deriving instance?

Minimal complete definition

suit, index, construct

Associated Types

data CardT s i :: * Source

Methods

suit :: CardT s i -> s Source

index :: CardT s i -> i Source

construct :: i -> s -> CardT s i Source

(@@) :: i -> s -> CardT s i Source

Instances

Card Suit Index

type Cards s i = [CardT s i] Source

class Parse a where Source

Parse is just a read instance with read exposed as the MRD. For most types, this will just be Read, but when dealing w/ index types, it can be a pain to parse numbers via read and end up with the expected format of "index-suit"

Methods

parse :: String -> a Source

Instances

Parse Index
Parse Suit
(Parse s, Parse i, Card s i) => Parse (CardT s i)
(Parse s, Parse i, Card s i) => Parse (Hand s i)

newtype Deck s i Source

Separate Deck from Hand, even though the types are isomorphic, we don't want shuffling to be to liberal.

TODO: Make Deck clever enough to support reshuffling when the deck runs out -- it should store cards it has already seen till it runs out of the main deck, reshuffle, redeal.

Constructors

Deck (Cards s i)

Instances