stable-marriage-0.1.2.0: algorithms around stable marriage
StableMarriage.GaleShapley
class Men m where Source #
Minimal complete definition
loves, forget
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 #
acceptable, compare
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
Instances
minBound :: Ordering #
maxBound :: Ordering #
succ :: Ordering -> Ordering #
pred :: Ordering -> Ordering #
toEnum :: Int -> Ordering #
fromEnum :: Ordering -> Int #
enumFrom :: Ordering -> [Ordering] #
enumFromThen :: Ordering -> Ordering -> [Ordering] #
enumFromTo :: Ordering -> Ordering -> [Ordering] #
enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering] #
(==) :: Ordering -> Ordering -> Bool #
(/=) :: Ordering -> Ordering -> Bool #
readsPrec :: Int -> ReadS Ordering #
readList :: ReadS [Ordering] #
readPrec :: ReadPrec Ordering #
readListPrec :: ReadPrec [Ordering] #
showsPrec :: Int -> Ordering -> ShowS #
show :: Ordering -> String #
showList :: [Ordering] -> ShowS #
mempty :: Ordering #
mappend :: Ordering -> Ordering -> Ordering #
mconcat :: [Ordering] -> Ordering #