Safe Haskell	None
Language	Haskell2010

Data.Store.TypeHash.Internal

Synopsis

newtype Tagged a = Tagged {
- unTagged :: a
}
newtype TypeHash = TypeHash {
- unTypeHash :: StaticSize 20 ByteString
}
reifyManyTyDecls :: ((Name, Info) -> Q (Bool, [Name])) -> [Name] -> Q [(Name, Info)]
typeHashForNames :: [Name] -> Q Exp
hashOfType :: Type -> Q Exp
getTypeInfosRecursively :: [Name] -> Q [(Name, Info)]
getConNames :: Data a => a -> [Name]
getVarNames :: Data a => a -> [Name]
class HasTypeHash a where
- typeHash :: Proxy a -> TypeHash
mkHasTypeHash :: Type -> Q [Dec]
mkManyHasTypeHash :: [Q Type] -> Q [Dec]
combineTypeHashes :: [TypeHash] -> TypeHash

Documentation

newtype Tagged a Source #

Constructors

Tagged
Fields unTagged :: a

Instances

Instances details

Eq a => Eq (Tagged a) Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods (==) :: Tagged a -> Tagged a -> Bool # (/=) :: Tagged a -> Tagged a -> Bool #
Data a => Data (Tagged a) Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Tagged a -> c (Tagged a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Tagged a) # toConstr :: Tagged a -> Constr # dataTypeOf :: Tagged a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Tagged a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Tagged a)) # gmapT :: (forall b. Data b => b -> b) -> Tagged a -> Tagged a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Tagged a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Tagged a -> r # gmapQ :: (forall d. Data d => d -> u) -> Tagged a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Tagged a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Tagged a -> m (Tagged a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Tagged a -> m (Tagged a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Tagged a -> m (Tagged a) #
Ord a => Ord (Tagged a) Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods compare :: Tagged a -> Tagged a -> Ordering # (<) :: Tagged a -> Tagged a -> Bool # (<=) :: Tagged a -> Tagged a -> Bool # (>) :: Tagged a -> Tagged a -> Bool # (>=) :: Tagged a -> Tagged a -> Bool # max :: Tagged a -> Tagged a -> Tagged a # min :: Tagged a -> Tagged a -> Tagged a #
Show a => Show (Tagged a) Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods showsPrec :: Int -> Tagged a -> ShowS # show :: Tagged a -> String # showList :: [Tagged a] -> ShowS #
Generic (Tagged a) Source #
Instance details Defined in Data.Store.TypeHash.Internal Associated Types type Rep (Tagged a) :: Type -> Type # Methods from :: Tagged a -> Rep (Tagged a) x # to :: Rep (Tagged a) x -> Tagged a #
NFData a => NFData (Tagged a) Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods rnf :: Tagged a -> () #
(Store a, HasTypeHash a) => Store (Tagged a) Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods size :: Size (Tagged a) Source # poke :: Tagged a -> Poke () Source # peek :: Peek (Tagged a) Source #
type Rep (Tagged a) Source #
Instance details Defined in Data.Store.TypeHash.Internal type Rep (Tagged a) = D1 ('MetaData "Tagged" "Data.Store.TypeHash.Internal" "store-0.7.16-9P42B0EGl5KBJgUkBjPz77" 'True) (C1 ('MetaCons "Tagged" 'PrefixI 'True) (S1 ('MetaSel ('Just "unTagged") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

newtype TypeHash Source #

Constructors

TypeHash
Fields unTypeHash :: StaticSize 20 ByteString

Instances

Instances details

Eq TypeHash Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods (==) :: TypeHash -> TypeHash -> Bool # (/=) :: TypeHash -> TypeHash -> Bool #
Data TypeHash Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TypeHash -> c TypeHash # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TypeHash # toConstr :: TypeHash -> Constr # dataTypeOf :: TypeHash -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TypeHash) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeHash) # gmapT :: (forall b. Data b => b -> b) -> TypeHash -> TypeHash # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TypeHash -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TypeHash -> r # gmapQ :: (forall d. Data d => d -> u) -> TypeHash -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TypeHash -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TypeHash -> m TypeHash # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeHash -> m TypeHash # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeHash -> m TypeHash #
Ord TypeHash Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods compare :: TypeHash -> TypeHash -> Ordering # (<) :: TypeHash -> TypeHash -> Bool # (<=) :: TypeHash -> TypeHash -> Bool # (>) :: TypeHash -> TypeHash -> Bool # (>=) :: TypeHash -> TypeHash -> Bool # max :: TypeHash -> TypeHash -> TypeHash # min :: TypeHash -> TypeHash -> TypeHash #
Show TypeHash Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods showsPrec :: Int -> TypeHash -> ShowS # show :: TypeHash -> String # showList :: [TypeHash] -> ShowS #
Generic TypeHash Source #
Instance details Defined in Data.Store.TypeHash.Internal Associated Types type Rep TypeHash :: Type -> Type # Methods from :: TypeHash -> Rep TypeHash x # to :: Rep TypeHash x -> TypeHash #
NFData TypeHash Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods rnf :: TypeHash -> () #
Store TypeHash Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods size :: Size TypeHash Source # poke :: TypeHash -> Poke () Source # peek :: Peek TypeHash Source #
Lift TypeHash Source #
Instance details Defined in Data.Store.TypeHash.Internal Methods lift :: TypeHash -> Q Exp # liftTyped :: TypeHash -> Q (TExp TypeHash) #
type Rep TypeHash Source #
Instance details Defined in Data.Store.TypeHash.Internal type Rep TypeHash = D1 ('MetaData "TypeHash" "Data.Store.TypeHash.Internal" "store-0.7.16-9P42B0EGl5KBJgUkBjPz77" 'True) (C1 ('MetaCons "TypeHash" 'PrefixI 'True) (S1 ('MetaSel ('Just "unTypeHash") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (StaticSize 20 ByteString))))

reifyManyTyDecls :: ((Name, Info) -> Q (Bool, [Name])) -> [Name] -> Q [(Name, Info)] Source #

typeHashForNames :: [Name] -> Q Exp Source #

At compiletime, this yields a hash of the specified datatypes. Not only does this cover the datatypes themselves, but also all transitive dependencies.

The resulting expression is a literal of type TypeHash.

hashOfType :: Type -> Q Exp Source #

At compiletime, this yields a cryptographic hash of the specified Type, including the definition of things it references (transitively).

The resulting expression is a literal of type TypeHash.

getTypeInfosRecursively :: [Name] -> Q [(Name, Info)] Source #

getConNames :: Data a => a -> [Name] Source #

getVarNames :: Data a => a -> [Name] Source #

class HasTypeHash a where Source #

Methods

typeHash :: Proxy a -> TypeHash Source #

mkHasTypeHash :: Type -> Q [Dec] Source #

Deprecated: Use of Data.Store.TypeHash isn't recommended, as the hashes are too unstable for most uses. Please instead consider using Data.Store.Version. See https://github.com/fpco/store/issues/53

mkManyHasTypeHash :: [Q Type] -> Q [Dec] Source #

Deprecated: Use of Data.Store.TypeHash isn't recommended, as the hashes are too unstable for most uses. Please instead consider using Data.Store.Version. See https://github.com/fpco/store/issues/53

combineTypeHashes :: [TypeHash] -> TypeHash Source #