Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
deriveUniverseSome :: DeriveUniverseSome a => a -> DecsQuniverse-some Data.Universe.Some.TH No documentation available.
deriveAnnotation :: Derivator -> Q Type -> Q [Dec]clash-prelude Clash.Annotations.BitRepresentation.Deriving No documentation available.
deriveBitPack :: Q Type -> Q [Dec]clash-prelude Clash.Annotations.BitRepresentation.Deriving Derives BitPack instances for given type. Will account for custom bit representation annotations in the module where the splice is ran. Note that the generated instance might conflict with existing implementations (for example, an instance for Maybe a exists, yielding conflicts for any alternative implementations). Usage:
data Color = R | G | B {-# ANN module (DataReprAnn $(liftQ [t|Color|]) 2 [ ConstrRepr 'R 0b11 0b00 [] , ConstrRepr 'G 0b11 0b01 [] , ConstrRepr 'B 0b11 0b10 [] ]) #-} deriveBitPack [t| Color |] data MaybeColor = JustColor Color | NothingColor deriving (Generic,BitPack)NB: Because of the way template haskell works the order here matters, if you try to derive MaybeColor before deriveBitPack Color it will complain about missing an instance BitSize Color.deriveBlueSpecAnnotation :: Q Type -> Q [Dec]clash-prelude Clash.Annotations.BitRepresentation.Deriving Derives bit representation corresponding to the default manner in which BlueSpec stores types.
deriveDefaultAnnotation :: Q Type -> Q [Dec]clash-prelude Clash.Annotations.BitRepresentation.Deriving Derives bit representation corresponding to the default manner in which Clash stores types.
derivePackedAnnotation :: Q Type -> Q [Dec]clash-prelude Clash.Annotations.BitRepresentation.Deriving No documentation available.
derivePackedMaybeAnnotation :: DataReprAnn -> Q [Dec]clash-prelude Clash.Annotations.BitRepresentation.Deriving Derive a compactly represented version of Maybe a.
deriveAutoReg :: Name -> DecsQclash-prelude Clash.Class.AutoReg Automatically derives an AutoReg instance for a product type Usage:
data Pair a b = MkPair { getA :: a, getB :: b } deriving (Generic, NFDataX) data Tup3 a b c = MkTup3 { getAB :: Pair a b, getC :: c } deriving (Generic, NFDataX) deriveAutoReg ''Pair deriveAutoReg ''Tup3NB: Because of the way template haskell works the order here matters, if you try to deriveAutoReg ''Tup3 before Pair it will complain about missing an instance AutoReg (Pair a b).deriveAutoReg :: Name -> DecsQclash-prelude Clash.Class.AutoReg.Internal Automatically derives an AutoReg instance for a product type Usage:
data Pair a b = MkPair { getA :: a, getB :: b } deriving (Generic, NFDataX) data Tup3 a b c = MkTup3 { getAB :: Pair a b, getC :: c } deriving (Generic, NFDataX) deriveAutoReg ''Pair deriveAutoReg ''Tup3NB: Because of the way template haskell works the order here matters, if you try to deriveAutoReg ''Tup3 before Pair it will complain about missing an instance AutoReg (Pair a b).deriveAutoRegTuples :: [Int] -> DecsQclash-prelude Clash.Class.AutoReg.Internal No documentation available.