template-haskell-compat-v0208-0.1.2.1/0000755000000000000000000000000013604611520015327 5ustar0000000000000000template-haskell-compat-v0208-0.1.2.1/Setup.hs0000644000000000000000000000005613604611520016764 0ustar0000000000000000import Distribution.Simple main = defaultMain template-haskell-compat-v0208-0.1.2.1/LICENSE0000644000000000000000000000204213604611520016332 0ustar0000000000000000Copyright (c) 2016, Nikita Volkov Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. template-haskell-compat-v0208-0.1.2.1/template-haskell-compat-v0208.cabal0000644000000000000000000000276413604611520023616 0ustar0000000000000000name: template-haskell-compat-v0208 version: 0.1.2.1 category: TemplateHaskell, Compatibility synopsis: A backwards compatibility layer for Template Haskell newer than 2.8 homepage: https://github.com/nikita-volkov/template-haskell-compat-v0208 bug-reports: https://github.com/nikita-volkov/template-haskell-compat-v0208/issues author: Nikita Volkov maintainer: Nikita Volkov copyright: (c) 2016, Nikita Volkov license: MIT license-file: LICENSE build-type: Simple cabal-version: >=1.10 source-repository head type: git location: git://github.com/nikita-volkov/template-haskell-compat-v0208.git library hs-source-dirs: library default-extensions: Arrows, BangPatterns, ConstraintKinds, DataKinds, DefaultSignatures, DeriveDataTypeable, DeriveFoldable, DeriveFunctor, DeriveGeneric, DeriveTraversable, EmptyDataDecls, FlexibleContexts, FlexibleInstances, FunctionalDependencies, GADTs, GeneralizedNewtypeDeriving, LambdaCase, LiberalTypeSynonyms, MagicHash, MultiParamTypeClasses, MultiWayIf, NoImplicitPrelude, NoMonomorphismRestriction, OverloadedStrings, PatternGuards, ParallelListComp, QuasiQuotes, RankNTypes, RecordWildCards, ScopedTypeVariables, StandaloneDeriving, TemplateHaskell, TupleSections, TypeFamilies, TypeOperators, UnboxedTuples default-language: Haskell2010 exposed-modules: TemplateHaskell.Compat.V0208 other-modules: TemplateHaskell.Compat.V0208.Prelude build-depends: base >=4.6 && <5, template-haskell >=2.8 && <3 template-haskell-compat-v0208-0.1.2.1/library/0000755000000000000000000000000013604611520016773 5ustar0000000000000000template-haskell-compat-v0208-0.1.2.1/library/TemplateHaskell/0000755000000000000000000000000013604611520022052 5ustar0000000000000000template-haskell-compat-v0208-0.1.2.1/library/TemplateHaskell/Compat/0000755000000000000000000000000013604611520023275 5ustar0000000000000000template-haskell-compat-v0208-0.1.2.1/library/TemplateHaskell/Compat/V0208.hs0000644000000000000000000000217713604611520024357 0ustar0000000000000000{-# LANGUAGE CPP #-} module TemplateHaskell.Compat.V0208 where import TemplateHaskell.Compat.V0208.Prelude import Language.Haskell.TH classP :: Name -> [Type] -> Pred #if MIN_VERSION_template_haskell(2,10,0) classP n tl = foldl AppT (ConT n) tl #else classP = ClassP #endif instanceD :: Cxt -> Type -> [Dec] -> Dec #if MIN_VERSION_template_haskell(2,11,0) instanceD = InstanceD Nothing #else instanceD = InstanceD #endif dataD :: Cxt -> Name -> [TyVarBndr] -> [Con] -> [Name] -> Dec dataD cxt name varBndrs cons derivingNames = #if MIN_VERSION_template_haskell(2,12,0) DataD cxt name varBndrs Nothing cons (pure (DerivClause Nothing (map ConT derivingNames))) #elif MIN_VERSION_template_haskell(2,11,0) DataD cxt name varBndrs Nothing cons (map ConT derivingNames) #else DataD cxt name varBndrs cons derivingNames #endif notStrict :: Strict notStrict = #if MIN_VERSION_template_haskell(2,11,0) unsafePerformIO (runQ (bang noSourceUnpackedness noSourceStrictness)) #else NotStrict #endif tupE :: [Exp] -> Exp #if MIN_VERSION_template_haskell(2,16,0) tupE = \ case [a] -> a a -> TupE (map Just a) #else tupE = TupE #endif template-haskell-compat-v0208-0.1.2.1/library/TemplateHaskell/Compat/V0208/0000755000000000000000000000000013604611520024014 5ustar0000000000000000template-haskell-compat-v0208-0.1.2.1/library/TemplateHaskell/Compat/V0208/Prelude.hs0000644000000000000000000000564713604611520025764 0ustar0000000000000000module TemplateHaskell.Compat.V0208.Prelude ( module Exports, ) where -- base ------------------------- import Control.Applicative as Exports import Control.Arrow as Exports hiding (first, second) import Control.Category as Exports import Control.Concurrent as Exports import Control.Exception as Exports import Control.Monad as Exports hiding (fail, mapM_, sequence_, forM_, msum, mapM, sequence, forM) import Control.Monad.Fix as Exports hiding (fix) import Control.Monad.ST as Exports import Data.Bifunctor as Exports import Data.Bits as Exports import Data.Bool as Exports import Data.Char as Exports import Data.Coerce as Exports import Data.Complex as Exports import Data.Data as Exports import Data.Dynamic as Exports import Data.Either as Exports import Data.Fixed as Exports import Data.Foldable as Exports hiding (toList) import Data.Function as Exports hiding (id, (.)) import Data.Functor as Exports import Data.Functor.Identity as Exports import Data.Int as Exports import Data.IORef as Exports import Data.Ix as Exports import Data.List as Exports hiding (sortOn, isSubsequenceOf, uncons, concat, foldr, foldl1, maximum, minimum, product, sum, all, and, any, concatMap, elem, foldl, foldr1, notElem, or, find, maximumBy, minimumBy, mapAccumL, mapAccumR, foldl') import Data.Maybe as Exports import Data.Monoid as Exports hiding (Last(..), First(..), (<>)) import Data.Ord as Exports import Data.Proxy as Exports import Data.Ratio as Exports import Data.STRef as Exports import Data.String as Exports import Data.Traversable as Exports import Data.Tuple as Exports import Data.Unique as Exports import Data.Version as Exports import Data.Word as Exports import Debug.Trace as Exports import Foreign.ForeignPtr as Exports import Foreign.Ptr as Exports import Foreign.StablePtr as Exports import Foreign.Storable as Exports hiding (sizeOf, alignment) import GHC.Conc as Exports hiding (withMVar, threadWaitWriteSTM, threadWaitWrite, threadWaitReadSTM, threadWaitRead) import GHC.Exts as Exports (lazy, inline, sortWith, groupWith, IsList(..)) import GHC.Generics as Exports (Generic, Generic1) import GHC.IO.Exception as Exports import Numeric as Exports import Prelude as Exports hiding (fail, concat, foldr, mapM_, sequence_, foldl1, maximum, minimum, product, sum, all, and, any, concatMap, elem, foldl, foldr1, notElem, or, mapM, sequence, id, (.)) import System.Environment as Exports import System.Exit as Exports import System.IO as Exports import System.IO.Error as Exports import System.IO.Unsafe as Exports import System.Mem as Exports import System.Mem.StableName as Exports import System.Timeout as Exports import Text.ParserCombinators.ReadP as Exports (ReadP, ReadS, readP_to_S, readS_to_P) import Text.ParserCombinators.ReadPrec as Exports (ReadPrec, readPrec_to_P, readP_to_Prec, readPrec_to_S, readS_to_Prec) import Text.Printf as Exports (printf, hPrintf) import Text.Read as Exports (Read(..), readMaybe, readEither) import Unsafe.Coerce as Exports