Safe Haskell	None
Language	Haskell2010

ADP.Fusion.Core.SynVar.Split.Type

Description

NOTE highly experimental

Synopsis

pattern ElmSplitITbl :: !(Proxy uId) -> !(CalcSplitType splitType x) -> !(RunningIndex i) -> !(Elm ls i) -> !i -> Elm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i
pattern ElmSplitBtITbl :: !(Proxy uId) -> !(CalcSplitType splitType (x, [r])) -> !(RunningIndex i) -> !(Elm ls i) -> !i -> Elm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i
class SplitIxCol (uId :: Symbol) (b :: Bool) e where
- type SplitIxTy uId b e :: *
- splitIxCol :: Proxy uId -> Proxy b -> e -> SplitIxTy uId b e
class Zconcat x y where
- type Zpp x y :: *
- zconcat :: x -> y -> Zpp x y
type family OR a b where ...
type family SameSid uId elm :: Bool where ...
newtype Split (uId :: Symbol) (splitType :: SplitType) synVar = Split {
- getSplit :: synVar
}
type family ArgTy argTy where ...
type family CalcSplitType splitType varTy where ...
data SplitType
- = Fragment
- | Final
split :: Proxy (uId :: Symbol) -> Proxy (splitType :: SplitType) -> synVar -> Split uId splitType synVar
collectIx :: forall uId ls i. SplitIxCol uId (SameSid uId (Elm ls i)) (Elm ls i) => Proxy uId -> Elm ls i -> SplitIxTy uId (SameSid uId (Elm ls i)) (Elm ls i)
data Proxy (t :: k) :: forall k. k -> Type = Proxy

Documentation

pattern ElmSplitITbl :: !(Proxy uId) -> !(CalcSplitType splitType x) -> !(RunningIndex i) -> !(Elm ls i) -> !i -> Elm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i Source #

pattern ElmSplitBtITbl :: !(Proxy uId) -> !(CalcSplitType splitType (x, [r])) -> !(RunningIndex i) -> !(Elm ls i) -> !i -> Elm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i Source #

class SplitIxCol (uId :: Symbol) (b :: Bool) e where Source #

Actually collect split indices based on if we managed to find the right Split synvar (based on the right symbol).

TODO this is not completely right, or? Since we should consider inside/outside?

TODO splitIxCol will need the index type i to combine running index and index into the actual lookup part.

Associated Types

type SplitIxTy uId b e :: * Source #

Methods

splitIxCol :: Proxy uId -> Proxy b -> e -> SplitIxTy uId b e Source #

Instances

(SplitIxCol uId (SameSid uId (Elm ls i)) (Elm ls i), Zconcat (SplitIxTy uId (SameSid uId (Elm ls i)) (Elm ls i)) (SplitIxTy uId (SameSid uId (TermSymbol a b)) (TermSymbol a b))) => SplitIxCol uId True (Elm (ls :!: TermSymbol a b) i) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types type SplitIxTy uId True (Elm (ls :!: TermSymbol a b) i) :: Type Source # Methods splitIxCol :: Proxy uId -> Proxy True -> Elm (ls :!: TermSymbol a b) i -> SplitIxTy uId True (Elm (ls :!: TermSymbol a b) i) Source #
SplitIxCol uId (SameSid uId (Elm ls i)) (Elm ls i) => SplitIxCol uId True (Elm (ls :!: Split sId splitType (TwITblBt b s arr c j x mF mB r)) i) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types type SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITblBt b s arr c j x mF mB r)) i) :: Type Source # Methods splitIxCol :: Proxy uId -> Proxy True -> Elm (ls :!: Split sId splitType (TwITblBt b s arr c j x mF mB r)) i -> SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITblBt b s arr c j x mF mB r)) i) Source #
SplitIxCol uId (SameSid uId (Elm ls i)) (Elm ls i) => SplitIxCol uId True (Elm (ls :!: Split sId splitType (TwITbl b s m arr c j x)) i) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types type SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITbl b s m arr c j x)) i) :: Type Source # Methods splitIxCol :: Proxy uId -> Proxy True -> Elm (ls :!: Split sId splitType (TwITbl b s m arr c j x)) i -> SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITbl b s m arr c j x)) i) Source #
(SplitIxCol uId (SameSid uId (Elm ls i)) (Elm ls i), Element (ls :!: l) i, RecElm (ls :!: l) i ~ Elm ls i) => SplitIxCol uId False (Elm (ls :!: l) i) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types type SplitIxTy uId False (Elm (ls :!: l) i) :: Type Source # Methods splitIxCol :: Proxy uId -> Proxy False -> Elm (ls :!: l) i -> SplitIxTy uId False (Elm (ls :!: l) i) Source #
SplitIxCol uId b (Elm S i) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types type SplitIxTy uId b (Elm S i) :: Type Source # Methods splitIxCol :: Proxy uId -> Proxy b -> Elm S i -> SplitIxTy uId b (Elm S i) Source #

class Zconcat x y where Source #

x ++ y but for inductive tuples.

TODO move to PrimitiveArray

Associated Types

type Zpp x y :: * Source #

Methods

zconcat :: x -> y -> Zpp x y Source #

Instances

Zconcat x Z Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types type Zpp x Z :: Type Source # Methods zconcat :: x -> Z -> Zpp x Z Source #
Zconcat x z => Zconcat x (z :. y) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types type Zpp x (z :. y) :: Type Source # Methods zconcat :: x -> (z :. y) -> Zpp x (z :. y) Source #

type family OR a b where ... Source #

Type-level (||)

Equations

OR False False = False
OR a b = True

type family SameSid uId elm :: Bool where ... Source #

Closed type family that gives us a (type) function for type symbol equality.

Equations

SameSid uId (Elm (ls :!: Split sId splitType synVar) i) = uId == sId
SameSid uId (Elm (ls :!: TermSymbol a b) i) = SameSid uId (TermSymbol a b)
SameSid uId M = False
SameSid uId (TermSymbol a (Split sId splitType synVar)) = OR (uId == sId) (SameSid uId a)
SameSid uId (Elm (ls :!: l) i) = False

newtype Split (uId :: Symbol) (splitType :: SplitType) synVar Source #

Wraps a normal non-terminal and attaches a type-level unique identier and z-ordering (with the unused Z at 0).

TODO attach empty/non-empty stuff (or get from non-splitted synvar?)

TODO re-introduce z-ordering later (once we have a sort fun)

Constructors

Split
Fields getSplit :: synVar

Instances

SplitIxCol uId (SameSid uId (Elm ls i)) (Elm ls i) => SplitIxCol uId True (Elm (ls :!: Split sId splitType (TwITblBt b s arr c j x mF mB r)) i) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types type SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITblBt b s arr c j x mF mB r)) i) :: Type Source # Methods splitIxCol :: Proxy uId -> Proxy True -> Elm (ls :!: Split sId splitType (TwITblBt b s arr c j x mF mB r)) i -> SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITblBt b s arr c j x mF mB r)) i) Source #
SplitIxCol uId (SameSid uId (Elm ls i)) (Elm ls i) => SplitIxCol uId True (Elm (ls :!: Split sId splitType (TwITbl b s m arr c j x)) i) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types type SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITbl b s m arr c j x)) i) :: Type Source # Methods splitIxCol :: Proxy uId -> Proxy True -> Elm (ls :!: Split sId splitType (TwITbl b s m arr c j x)) i -> SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITbl b s m arr c j x)) i) Source #
Element ls i => Element (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types data Elm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i :: Type Source # type RecElm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i :: Type Source # type Arg (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) :: Type Source # Methods getArg :: Elm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i -> Arg (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) Source # getIdx :: Elm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i -> RunningIndex i Source # getElm :: Elm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i -> RecElm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i Source #
Element ls i => Element (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types data Elm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i :: Type Source # type RecElm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i :: Type Source # type Arg (ls :!: Split uId splitType (TwITbl b s m arr c j x)) :: Type Source # Methods getArg :: Elm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i -> Arg (ls :!: Split uId splitType (TwITbl b s m arr c j x)) Source # getIdx :: Elm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i -> RunningIndex i Source # getElm :: Elm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i -> RecElm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i Source #
Build (Split uId splitType synVar) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type Associated Types type Stack (Split uId splitType synVar) :: Type Source # Methods build :: Split uId splitType synVar -> Stack (Split uId splitType synVar) Source #
type SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITblBt b s arr c j x mF mB r)) i) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type type SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITblBt b s arr c j x mF mB r)) i) = SplitIxTy uId (SameSid uId (Elm ls i)) (Elm ls i) :. i
type SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITbl b s m arr c j x)) i) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type type SplitIxTy uId True (Elm (ls :!: Split sId splitType (TwITbl b s m arr c j x)) i) = SplitIxTy uId (SameSid uId (Elm ls i)) (Elm ls i) :. i
data Elm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type data Elm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i = ElmSplitBtITbl !(Proxy uId) !(CalcSplitType splitType (x, [r])) !(RunningIndex i) !(Elm ls i) !i
data Elm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type data Elm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i = ElmSplitITbl !(Proxy uId) !(CalcSplitType splitType x) !(RunningIndex i) !(Elm ls i) !i
type Arg (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type type Arg (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) = Arg ls :. CalcSplitType splitType (x, [r])
type Arg (ls :!: Split uId splitType (TwITbl b s m arr c j x)) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type type Arg (ls :!: Split uId splitType (TwITbl b s m arr c j x)) = Arg ls :. CalcSplitType splitType x
type RecElm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type type RecElm (ls :!: Split uId splitType (TwITblBt b s arr c j x mF mB r)) i = Elm ls i
type RecElm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type type RecElm (ls :!: Split uId splitType (TwITbl b s m arr c j x)) i = Elm ls i
type Stack (Split uId splitType synVar) Source #
Instance details Defined in ADP.Fusion.Core.SynVar.Split.Type type Stack (Split uId splitType synVar) = S :!: Split uId splitType synVar

type family ArgTy argTy where ... Source #

Should never fail?

Equations

ArgTy (z :. x) = x

type family CalcSplitType splitType varTy where ... Source #

The Arg synVar means that we probably need to rewrite the internal type resolution now!

Equations

CalcSplitType Fragment varTy = ()
CalcSplitType Final varTy = varTy

data SplitType Source #

Constructors

Fragment
Final

split :: Proxy (uId :: Symbol) -> Proxy (splitType :: SplitType) -> synVar -> Split uId splitType synVar Source #

TODO Here, we probably want to default to a NonEmpty condition. Or at least have different versions of split.

collectIx :: forall uId ls i. SplitIxCol uId (SameSid uId (Elm ls i)) (Elm ls i) => Proxy uId -> Elm ls i -> SplitIxTy uId (SameSid uId (Elm ls i)) (Elm ls i) Source #

collectIx gobbles up indices that are tagged with the same symbolic identifier.

data Proxy (t :: k) :: forall k. k -> Type #

Proxy is a type that holds no data, but has a phantom parameter of arbitrary type (or even kind). Its use is to provide type information, even though there is no value available of that type (or it may be too costly to create one).

Historically, Proxy :: Proxy a is a safer alternative to the 'undefined :: a' idiom.

>>> Proxy :: Proxy (Void, Int -> Int)
Proxy

Proxy can even hold types of higher kinds,

>>> Proxy :: Proxy Either
Proxy

>>> Proxy :: Proxy Functor
Proxy

>>> Proxy :: Proxy complicatedStructure
Proxy

Constructors

Proxy

Instances

Generic1 (Proxy :: k -> Type)
Instance details Defined in GHC.Generics Associated Types type Rep1 Proxy :: k -> Type # Methods from1 :: Proxy a -> Rep1 Proxy a # to1 :: Rep1 Proxy a -> Proxy a #
Monad (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b # (>>) :: Proxy a -> Proxy b -> Proxy b # return :: a -> Proxy a # fail :: String -> Proxy a #
Functor (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods fmap :: (a -> b) -> Proxy a -> Proxy b # (<$) :: a -> Proxy b -> Proxy a #
Applicative (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods pure :: a -> Proxy a # (<>) :: Proxy (a -> b) -> Proxy a -> Proxy b # liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # (>) :: Proxy a -> Proxy b -> Proxy b # (<*) :: Proxy a -> Proxy b -> Proxy a #
Foldable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # toList :: Proxy a -> [a] # null :: Proxy a -> Bool # length :: Proxy a -> Int # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # sum :: Num a => Proxy a -> a # product :: Num a => Proxy a -> a #
Traversable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) # sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) # mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) # sequence :: Monad m => Proxy (m a) -> m (Proxy a) #
Representable (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Rep Associated Types type Rep Proxy :: Type # Methods tabulate :: (Rep Proxy -> a) -> Proxy a # index :: Proxy a -> Rep Proxy -> a #
Alternative (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods empty :: Proxy a # (<\|>) :: Proxy a -> Proxy a -> Proxy a # some :: Proxy a -> Proxy [a] # many :: Proxy a -> Proxy [a] #
MonadPlus (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods mzero :: Proxy a # mplus :: Proxy a -> Proxy a -> Proxy a #
Eq1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Proxy a -> Proxy b -> Bool #
Ord1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Proxy a -> Proxy b -> Ordering #
Read1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Proxy a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Proxy a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Proxy a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Proxy a] #
Show1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Proxy a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Proxy a] -> ShowS #
NFData1 (Proxy :: Type -> Type)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Proxy a -> () #
Hashable1 (Proxy :: Type -> Type)
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Proxy a -> Int #
Bounded (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods minBound :: Proxy t # maxBound :: Proxy t #
Enum (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods succ :: Proxy s -> Proxy s # pred :: Proxy s -> Proxy s # toEnum :: Int -> Proxy s # fromEnum :: Proxy s -> Int # enumFrom :: Proxy s -> [Proxy s] # enumFromThen :: Proxy s -> Proxy s -> [Proxy s] # enumFromTo :: Proxy s -> Proxy s -> [Proxy s] # enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s] #
Eq (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (==) :: Proxy s -> Proxy s -> Bool # (/=) :: Proxy s -> Proxy s -> Bool #
Data t => Data (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Proxy t -> c (Proxy t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Proxy t) # toConstr :: Proxy t -> Constr # dataTypeOf :: Proxy t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Proxy t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Proxy t)) # gmapT :: (forall b. Data b => b -> b) -> Proxy t -> Proxy t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQ :: (forall d. Data d => d -> u) -> Proxy t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Proxy t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) #
Ord (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods compare :: Proxy s -> Proxy s -> Ordering # (<) :: Proxy s -> Proxy s -> Bool # (<=) :: Proxy s -> Proxy s -> Bool # (>) :: Proxy s -> Proxy s -> Bool # (>=) :: Proxy s -> Proxy s -> Bool # max :: Proxy s -> Proxy s -> Proxy s # min :: Proxy s -> Proxy s -> Proxy s #
Read (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods readsPrec :: Int -> ReadS (Proxy t) # readList :: ReadS [Proxy t] # readPrec :: ReadPrec (Proxy t) # readListPrec :: ReadPrec [Proxy t] #
Show (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods showsPrec :: Int -> Proxy s -> ShowS # show :: Proxy s -> String # showList :: [Proxy s] -> ShowS #
Ix (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods range :: (Proxy s, Proxy s) -> [Proxy s] # index :: (Proxy s, Proxy s) -> Proxy s -> Int # unsafeIndex :: (Proxy s, Proxy s) -> Proxy s -> Int inRange :: (Proxy s, Proxy s) -> Proxy s -> Bool # rangeSize :: (Proxy s, Proxy s) -> Int # unsafeRangeSize :: (Proxy s, Proxy s) -> Int
Generic (Proxy t)
Instance details Defined in GHC.Generics Associated Types type Rep (Proxy t) :: Type -> Type # Methods from :: Proxy t -> Rep (Proxy t) x # to :: Rep (Proxy t) x -> Proxy t #
Semigroup (Proxy s)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods (<>) :: Proxy s -> Proxy s -> Proxy s # sconcat :: NonEmpty (Proxy s) -> Proxy s # stimes :: Integral b => b -> Proxy s -> Proxy s #
Monoid (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods mempty :: Proxy s # mappend :: Proxy s -> Proxy s -> Proxy s # mconcat :: [Proxy s] -> Proxy s #
NFData (Proxy a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Proxy a -> () #
Hashable (Proxy a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Proxy a -> Int # hash :: Proxy a -> Int #
type Rep1 (Proxy :: k -> Type)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep1 (Proxy :: k -> Type) = D1 (MetaData "Proxy" "Data.Proxy" "base" False) (C1 (MetaCons "Proxy" PrefixI False) (U1 :: k -> Type))
type Rep (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Rep type Rep (Proxy :: Type -> Type) = Void
type Rep (Proxy t)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep (Proxy t) = D1 (MetaData "Proxy" "Data.Proxy" "base" False) (C1 (MetaCons "Proxy" PrefixI False) (U1 :: Type -> Type))