store-0.4.3.2: Fast binary serialization

Safe Haskell | None
Language | Haskell2010

Data.Store.TypeHash

Contents

- TH for generating HasTypeHash instances

Synopsis

- newtype Tagged a = Tagged {
  - unTagged :: a
  }
- data TypeHash
- class HasTypeHash a where
- mkHasTypeHash :: Type -> Q [Dec]
- mkManyHasTypeHash :: [Q Type] -> Q [Dec]

# Documentation

newtype Tagged a Source #

Constructors

Tagged |

Fields

- unTagged :: a

Instances

Eq a => Eq (Tagged a) Source # |
Methods (==) :: Tagged a -> Tagged a -> Bool # (/=) :: Tagged a -> Tagged a -> Bool #
Data a => Data (Tagged a) Source # |

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 :: (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 # |
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 # |
Methods showsPrec :: Int -> Tagged a -> ShowS # show :: Tagged a -> String # showList :: [Tagged a] -> ShowS #
Generic (Tagged a) Source # |
Associated Types type Rep (Tagged a) :: * -> * # Methods from :: Tagged a -> Rep (Tagged a) x # to :: Rep (Tagged a) x -> Tagged a #
NFData a => NFData (Tagged a) Source # |
Methods rnf :: Tagged a -> () #
(Store a, HasTypeHash a) => Store (Tagged a) Source # |
Methods size :: Size (Tagged a) Source # poke :: Tagged a -> Poke () Source # peek :: Peek (Tagged a) Source #
type Rep (Tagged a) Source # |
type Rep (Tagged a) = D1 (MetaData "Tagged" "Data.Store.TypeHash.Internal" "store-0.4.3.2-IjMJ3gzpDLU338Qgz1YTpr" True) (C1 (MetaCons "Tagged" PrefixI True) (S1 (MetaSel (Just Symbol "unTagged") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))

data TypeHash Source #

Instances

Eq TypeHash Source # |
Methods (==) :: TypeHash -> TypeHash -> Bool # (/=) :: TypeHash -> TypeHash -> Bool #
Data TypeHash Source # |

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 :: (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 # |
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 # |
Methods showsPrec :: Int -> TypeHash -> ShowS # show :: TypeHash -> String # showList :: [TypeHash] -> ShowS #
Generic TypeHash Source # |
Associated Types type Rep TypeHash :: * -> * # Methods from :: TypeHash -> Rep TypeHash x # to :: Rep TypeHash x -> TypeHash #
Lift TypeHash Source # |
Methods lift :: TypeHash -> Q Exp #
NFData TypeHash Source # |
Methods rnf :: TypeHash -> () #
Store TypeHash Source # |
Methods size :: Size TypeHash Source # poke :: TypeHash -> Poke () Source # peek :: Peek TypeHash Source #
type Rep TypeHash Source # |
type Rep TypeHash = D1 (MetaData "TypeHash" "Data.Store.TypeHash.Internal" "store-0.4.3.2-IjMJ3gzpDLU338Qgz1YTpr" True) (C1 (MetaCons "TypeHash" PrefixI True) (S1 (MetaSel (Just Symbol "unTypeHash") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (StaticSize 20 ByteString))))

class HasTypeHash a where Source #

Minimal complete definition

typeHash

Methods

typeHash :: Proxy a -> TypeHash Source #

# TH for generating HasTypeHash instances

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