module Distribution.Compat.DList
( DList
, runDList
, empty
, singleton
, fromList
, toList
, snoc
) where
import Distribution.Compat.Prelude hiding (empty, toList)
import Prelude ()
newtype DList a = DList ([a] -> [a])
runDList :: DList a -> [a]
runDList :: forall a. DList a -> [a]
runDList (DList [a] -> [a]
run) = [a] -> [a]
run []
singleton :: a -> DList a
singleton :: forall a. a -> DList a
singleton a
a = ([a] -> [a]) -> DList a
forall a. ([a] -> [a]) -> DList a
DList (a
a a -> [a] -> [a]
forall a. a -> [a] -> [a]
:)
empty :: DList a
empty :: forall a. DList a
empty = ([a] -> [a]) -> DList a
forall a. ([a] -> [a]) -> DList a
DList [a] -> [a]
forall a. a -> a
id
fromList :: [a] -> DList a
fromList :: forall a. [a] -> DList a
fromList [a]
as = ([a] -> [a]) -> DList a
forall a. ([a] -> [a]) -> DList a
DList ([a]
as [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++)
toList :: DList a -> [a]
toList :: forall a. DList a -> [a]
toList = DList a -> [a]
forall a. DList a -> [a]
runDList
snoc :: DList a -> a -> DList a
snoc :: forall a. DList a -> a -> DList a
snoc DList a
xs a
x = DList a
xs DList a -> DList a -> DList a
forall a. Semigroup a => a -> a -> a
<> a -> DList a
forall a. a -> DList a
singleton a
x
instance Monoid (DList a) where
mempty :: DList a
mempty = DList a
forall a. DList a
empty
mappend :: DList a -> DList a -> DList a
mappend = DList a -> DList a -> DList a
forall a. Semigroup a => a -> a -> a
(<>)
instance Semigroup (DList a) where
DList [a] -> [a]
a <> :: DList a -> DList a -> DList a
<> DList [a] -> [a]
b = ([a] -> [a]) -> DList a
forall a. ([a] -> [a]) -> DList a
DList ([a] -> [a]
a ([a] -> [a]) -> ([a] -> [a]) -> [a] -> [a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [a] -> [a]
b)