Distribution.Utils.NubList

Documentation

data NubList a

NubList : A de-duplicated list that maintains the original order.

Instances

Eq a => Eq (NubList a)

Methods

(==) :: NubList a -> NubList a -> Bool

(/=) :: NubList a -> NubList a -> Bool

(Ord a, Read a) => Read (NubList a)

Methods

readsPrec :: Int -> ReadS (NubList a)

readList :: ReadS [NubList a]

readPrec :: ReadPrec (NubList a)

readListPrec :: ReadPrec [NubList a]

Show a => Show (NubList a)

Methods

showsPrec :: Int -> NubList a -> ShowS

show :: NubList a -> String

showList :: [NubList a] -> ShowS

Ord a => Semigroup (NubList a)

Methods

(<>) :: NubList a -> NubList a -> NubList a

sconcat :: NonEmpty (NubList a) -> NubList a

stimes :: Integral b => b -> NubList a -> 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 mappend NubList xs == NubList xs mappend mempty

Associativity : by inspection: (NubList xs mappend NubList ys) mappend NubList zs == NubList xs mappend (NubList ys mappend NubList zs)

Closure : appending two lists of type a and removing duplicates obviously does not change the type.

Methods

mempty :: NubList a

mappend :: NubList a -> NubList a -> NubList a

mconcat :: [NubList a] -> NubList a

(Ord a, Binary a) => Binary (NubList a)

Binary instance for 'NubList a' is the same as for '[a]'. For put, we just pull off constructor and put the list. For get, we get the list and make a NubList out of it using toNubList.

Methods

put :: NubList a -> Put

get :: Get (NubList a)

putList :: [NubList a] -> Put

toNubList :: Ord a => [a] -> NubList a

Smart constructor for the NubList 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.

Instances

Eq a => Eq (NubListR a)

Methods

(==) :: NubListR a -> NubListR a -> Bool

(/=) :: NubListR a -> NubListR a -> Bool

(Ord a, Read a) => Read (NubListR a)

Methods

readsPrec :: Int -> ReadS (NubListR a)

readList :: ReadS [NubListR a]

readPrec :: ReadPrec (NubListR a)

readListPrec :: ReadPrec [NubListR a]

Show a => Show (NubListR a)

Methods

showsPrec :: Int -> NubListR a -> ShowS

show :: NubListR a -> String

showList :: [NubListR a] -> ShowS

Ord a => Semigroup (NubListR a)

Methods

(<>) :: NubListR a -> NubListR a -> NubListR a

sconcat :: NonEmpty (NubListR a) -> NubListR a

stimes :: Integral b => b -> NubListR a -> NubListR a

Ord a => Monoid (NubListR a)

Methods

mempty :: NubListR a

mappend :: NubListR a -> NubListR a -> NubListR a

mconcat :: [NubListR a] -> NubListR a

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.