{-# LANGUAGE Trustworthy #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE PolyKinds #-}
module Data.Proxy
(
Proxy(..), asProxyTypeOf
, KProxy(..)
) where
import GHC.Base
import GHC.Show
import GHC.Read
import GHC.Enum
import GHC.Arr
data Proxy t = Proxy deriving ( Bounded
, Read
)
data KProxy (t :: Type) = KProxy
instance Eq (Proxy s) where
Proxy s
_ == :: Proxy s -> Proxy s -> Bool
== Proxy s
_ = Bool
True
instance Ord (Proxy s) where
compare :: Proxy s -> Proxy s -> Ordering
compare Proxy s
_ Proxy s
_ = Ordering
EQ
instance Show (Proxy s) where
showsPrec :: Int -> Proxy s -> ShowS
showsPrec Int
_ Proxy s
_ = String -> ShowS
showString String
"Proxy"
instance Enum (Proxy s) where
succ :: Proxy s -> Proxy s
succ Proxy s
_ = String -> Proxy s
forall a. String -> a
errorWithoutStackTrace String
"Proxy.succ"
pred :: Proxy s -> Proxy s
pred Proxy s
_ = String -> Proxy s
forall a. String -> a
errorWithoutStackTrace String
"Proxy.pred"
fromEnum :: Proxy s -> Int
fromEnum Proxy s
_ = Int
0
toEnum :: Int -> Proxy s
toEnum Int
0 = Proxy s
forall k (t :: k). Proxy t
Proxy
toEnum Int
_ = String -> Proxy s
forall a. String -> a
errorWithoutStackTrace String
"Proxy.toEnum: 0 expected"
enumFrom :: Proxy s -> [Proxy s]
enumFrom Proxy s
_ = [Proxy s
forall k (t :: k). Proxy t
Proxy]
enumFromThen :: Proxy s -> Proxy s -> [Proxy s]
enumFromThen Proxy s
_ Proxy s
_ = [Proxy s
forall k (t :: k). Proxy t
Proxy]
enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s]
enumFromThenTo Proxy s
_ Proxy s
_ Proxy s
_ = [Proxy s
forall k (t :: k). Proxy t
Proxy]
enumFromTo :: Proxy s -> Proxy s -> [Proxy s]
enumFromTo Proxy s
_ Proxy s
_ = [Proxy s
forall k (t :: k). Proxy t
Proxy]
instance Ix (Proxy s) where
range :: (Proxy s, Proxy s) -> [Proxy s]
range (Proxy s, Proxy s)
_ = [Proxy s
forall k (t :: k). Proxy t
Proxy]
index :: (Proxy s, Proxy s) -> Proxy s -> Int
index (Proxy s, Proxy s)
_ Proxy s
_ = Int
0
inRange :: (Proxy s, Proxy s) -> Proxy s -> Bool
inRange (Proxy s, Proxy s)
_ Proxy s
_ = Bool
True
rangeSize :: (Proxy s, Proxy s) -> Int
rangeSize (Proxy s, Proxy s)
_ = Int
1
unsafeIndex :: (Proxy s, Proxy s) -> Proxy s -> Int
unsafeIndex (Proxy s, Proxy s)
_ Proxy s
_ = Int
0
unsafeRangeSize :: (Proxy s, Proxy s) -> Int
unsafeRangeSize (Proxy s, Proxy s)
_ = Int
1
instance Semigroup (Proxy s) where
Proxy s
_ <> :: Proxy s -> Proxy s -> Proxy s
<> Proxy s
_ = Proxy s
forall k (t :: k). Proxy t
Proxy
sconcat :: NonEmpty (Proxy s) -> Proxy s
sconcat NonEmpty (Proxy s)
_ = Proxy s
forall k (t :: k). Proxy t
Proxy
stimes :: b -> Proxy s -> Proxy s
stimes b
_ Proxy s
_ = Proxy s
forall k (t :: k). Proxy t
Proxy
instance Monoid (Proxy s) where
mempty :: Proxy s
mempty = Proxy s
forall k (t :: k). Proxy t
Proxy
mconcat :: [Proxy s] -> Proxy s
mconcat [Proxy s]
_ = Proxy s
forall k (t :: k). Proxy t
Proxy
instance Functor Proxy where
fmap :: (a -> b) -> Proxy a -> Proxy b
fmap a -> b
_ Proxy a
_ = Proxy b
forall k (t :: k). Proxy t
Proxy
{-# INLINE fmap #-}
instance Applicative Proxy where
pure :: a -> Proxy a
pure a
_ = Proxy a
forall k (t :: k). Proxy t
Proxy
{-# INLINE pure #-}
Proxy (a -> b)
_ <*> :: Proxy (a -> b) -> Proxy a -> Proxy b
<*> Proxy a
_ = Proxy b
forall k (t :: k). Proxy t
Proxy
{-# INLINE (<*>) #-}
instance Alternative Proxy where
empty :: Proxy a
empty = Proxy a
forall k (t :: k). Proxy t
Proxy
{-# INLINE empty #-}
Proxy a
_ <|> :: Proxy a -> Proxy a -> Proxy a
<|> Proxy a
_ = Proxy a
forall k (t :: k). Proxy t
Proxy
{-# INLINE (<|>) #-}
instance Monad Proxy where
Proxy a
_ >>= :: Proxy a -> (a -> Proxy b) -> Proxy b
>>= a -> Proxy b
_ = Proxy b
forall k (t :: k). Proxy t
Proxy
{-# INLINE (>>=) #-}
instance MonadPlus Proxy
asProxyTypeOf :: a -> proxy a -> a
asProxyTypeOf :: a -> proxy a -> a
asProxyTypeOf = a -> proxy a -> a
forall a b. a -> b -> a
const
{-# INLINE asProxyTypeOf #-}