Monoid

class Monoid a where  mempty :: a  mappend :: a -> a -> a  mconcat :: [a] -> aMonoid（幺半群）是個(gè)類型類。存在單位元mempty，二元結(jié)合操作mappend，以及列表折疊操作mconcat。注：幺半群是群論中的概念。所謂半群是指一個(gè)集合，其中存在一種滿足結(jié)合律的結(jié)合運(yùn)算。所謂幺，是指集合之內(nèi)存在一個(gè)單位元，它與集合中任何元素e結(jié)合（包括左結(jié)合和右結(jié)合）的結(jié)果都是e。比如實(shí)數(shù)的求和以及求積都是幺半群。顯然求和運(yùn)算以及求積運(yùn)算都滿足結(jié)合律。求和的單位元是0，求積的單位元是1，因?yàn)?+e=e+0=e，而1*e=e*1=e。再比如時(shí)鐘也是幺半群。
(<>)
(<>) :: Monoid m => m -> m -> m(<>) = mappend
Monoid的法則
mempty <> x = xx <> mempty = x(x <> y) <> z = x <> (y <> z)幺半群滿足結(jié)合律（半群），存在單位元（幺）。
[a] 是 Monoid
instance Monoid [a] where        mempty  = []        mappend = (++)        mconcat xss = [x | xs <- xss, x <- xs]列表是個(gè)幺半群。二元結(jié)合操作(++)滿足結(jié)合律。單位元為空列表[]。
PRelude> [1,2,3] <> [4,5,6][1,2,3,4,5,6]Prelude> "pang" <> mempty"pang"Prelude> mconcat [[1,2],[3,6],[9]][1,2,3,6,9]
Ordering 是 Monoid
data Ordering = LT | EQ | GTinstance Monoid Ordering where        mempty         = EQ        LT `mappend` _ = LT        EQ `mappend` y = y        GT `mappend` _ = GT排序這個(gè)幺半群用于實(shí)現(xiàn)按字典排序。單位元為相等即EQ。
Prelude> LT <> GTLTPrelude> GT <> LTGTPrelude> mempty <> LTLTPrelude> mempty <> GTGT
Sum 和 Product 都是 Monoid
newtype Sum a = Sum { getSum :: a }newtype Product a = Product {getProduct :: a}instance Num a => Monoid (Sum a) where    mempty = Sum 0    Sum x `mappend` Sum y = Sum (x + y)instance Num a => Monoid (Product a) where    mempty = Product 1    Product x `mappend` Product y = Product (x * y)求和以及求積都是幺半群。顯然都滿足結(jié)合律。求和的單位元為0，求積的單位元為1。
Prelude Data.Monoid> Sum 5 <> Sum 6 <> Sum 10Sum {getSum = 21}Prelude Data.Monoid> getSum . mconcat . fmap Sum $ [5, 6, 10]21Prelude Data.Monoid> Product 5 <> Product 6 <> Product 10Product {getProduct = 300}Prelude Data.Monoid> getProduct . mconcat . fmap Product $ [5, 6, 10]300
Any 和 All 都是 Monoid
newtype Any = Any { getAny :: Bool }newtype All = All { getAll :: Bool }instance Monoid Any where        mempty = Any False        Any x `mappend` Any y = Any (x || y)instance Monoid All where        mempty = All True        All x `mappend` All y = All (x && y)求與以及求或都是幺半群。顯然都滿足結(jié)合律。求與的單位元為True，求或的單位元為False。
Prelude Data.Monoid> Any True <> Any FalseAny {getAny = True}Prelude Data.Monoid> All True <> All FalseAll {getAll = False}Prelude Data.Monoid> getAny . mconcat . map Any $ [False, False, False, True]TruePrelude Data.Monoid> getAll . mconcat . map All $ [False, False, False, True]False
如果 a 是 Monoid，那么 Maybe a 也是 Monoid
instance Monoid a => Monoid (Maybe a) where  mempty = Nothing  Nothing `mappend` m = m  m `mappend` Nothing = m  Just m1 `mappend` Just m2 = Just (m1 `mappend` m2)Maybe a 是幺半群（前提是 a 是幺半群）。單位元是 Nothing。
Prelude Data.Monoid> Nothing <> Just "andy"Just "andy"Prelude Data.Monoid> Just LT <> NothingJust LTPrelude Data.Monoid> Just (Sum 3) <> Just (Sum 4) Just (Sum {getSum = 7})
First 和 Last 都是 Monoid
newtype First a = First { getFirst :: Maybe a }newtype Last a = Last { getLast :: Maybe a }instance Monoid (First a) where        mempty = First Nothing        First Nothing `mappend` r = r        l `mappend` _             = linstance Monoid (Last a) where        mempty = Last Nothing        l `mappend` Last Nothing = l        _ `mappend` r            = r
Prelude Data.Monoid> First (Just 'a') <> First (Just 'b')First {getFirst = Just 'a'}Prelude Data.Monoid> Last (Just 'a') <> Last (Just 'b')Last {getLast = Just 'b'}Prelude Data.Monoid> getFirst . mconcat . map First $ [Nothing, Just 9, Just 10]  Just 9Prelude Data.Monoid> getLast . mconcat . map Last $ [Nothing, Just 9, Just 10]  Just 10