| Safe Haskell | None |
|---|
Distribution.Utils.NubList
- data NubList a
- toNubList :: Ord a => [a] -> NubList a
- fromNubList :: NubList a -> [a]
- overNubList :: Ord a => ([a] -> [a]) -> NubList a -> NubList a
- data NubListR a
- toNubListR :: Ord a => [a] -> NubListR a
- fromNubListR :: NubListR a -> [a]
- overNubListR :: Ord a => ([a] -> [a]) -> NubListR a -> NubListR a
Documentation
data NubList a
NubList : A de-duplicated list that maintains the original order.
Instances
| Eq a => Eq (NubList a) | |
| (Ord a, Read a) => Read (NubList a) | |
| Show a => Show (NubList a) | |
| Ord a => Monoid (NubList a) | Monoid operations on NubLists. For a valid Monoid instance we need to satistfy the required monoid laws; identity, associativity and closure. Identity : by inspection:
mempty Associativity : by inspection:
(NubList xs Closure : appending two lists of type a and removing duplicates obviously does not change the type. |
fromNubList :: NubList a -> [a]
overNubList :: Ord a => ([a] -> [a]) -> NubList a -> NubList a
Lift a function over lists to a function over NubLists.
data NubListR a
NubListR : A right-biased version of NubList. That is toNubListR
[-XNoFoo, -XFoo, -XNoFoo] will result in [-XFoo, -XNoFoo],
unlike the normal NubList, which is left-biased. Built on top of
ordNubRight and listUnionRight.
toNubListR :: Ord a => [a] -> NubListR a
Smart constructor for the NubListR type.
fromNubListR :: NubListR a -> [a]
overNubListR :: Ord a => ([a] -> [a]) -> NubListR a -> NubListR a
Lift a function over lists to a function over NubListRs.