stable-marriage-0.2.0.0: algorithms around stable marriage
Safe HaskellNone
LanguageHaskell2010

StableMarriage.GaleShapley

Documentation

class Men m where Source #

Associated Types

type W m :: * Source #

Methods

loves :: m -> [W m] Source #

forget :: m -> m Source #

class (Ord w, Men m, w ~ W m) => Women m w where Source #

Minimal complete definition

acceptable, compare

Methods

acceptable :: w -> m -> Bool Source #

compare :: w -> m -> m -> Ordering Source #

limit :: w -> [m] -> Int Source #

type World w m = (Men m, Women m w, w ~ W m) => ([(w, [m])], [m]) Source #

meets :: (Men m, Women m w, w ~ W m) => [m] -> [w] -> World w m Source #

data Ordering Source #

Constructors

LT 
EQ 
GT 
NC 

Instances

Instances details
Bounded Ordering Source # 
Instance details

Defined in Data.Poset.Internal

Enum Ordering Source # 
Instance details

Defined in Data.Poset.Internal

Eq Ordering Source # 
Instance details

Defined in Data.Poset.Internal

Methods

(==) :: Ordering -> Ordering -> Bool

(/=) :: Ordering -> Ordering -> Bool

Read Ordering Source # 
Instance details

Defined in Data.Poset.Internal

Methods

readsPrec :: Int -> ReadS Ordering

readList :: ReadS [Ordering]

readPrec :: ReadPrec Ordering

readListPrec :: ReadPrec [Ordering]

Show Ordering Source # 
Instance details

Defined in Data.Poset.Internal

Methods

showsPrec :: Int -> Ordering -> ShowS

show :: Ordering -> String

showList :: [Ordering] -> ShowS

Semigroup Ordering Source # 
Instance details

Defined in Data.Poset.Internal

Methods

(<>) :: Ordering -> Ordering -> Ordering

sconcat :: NonEmpty Ordering -> Ordering

stimes :: Integral b => b -> Ordering -> Ordering

Monoid Ordering Source # 
Instance details

Defined in Data.Poset.Internal