import Language.Haskell.TH.Ppr
import Language.Haskell.TH.Syntax
import Prelude hiding ( concat, concatMap, exp, filter
- , foldl, foldr, foldl1, foldr1, null)
+ , foldl, foldr, foldl1, foldr1
+ , lookup, null
+ )
import Prelude.Unicode
type Deriver = Q Cxt → Q Type → Q Exp → Q Exp → Q Dec
= return (wrapperTy, deriveFoldable)
| classTy ≡ ''Collection
= return (wrapperTy, deriveCollection)
+ | classTy ≡ ''Set
+ = return (wrapperTy, deriveSet)
| classTy ≡ ''SortingCollection
= return (wrapperTy, deriveSortingCollection)
inspectInstance (AppT (AppT (AppT (ConT classTy) wrapperTy) _) _)
| classTy ≡ ''Indexed
= return (wrapperTy, deriveIndexed)
+ | classTy ≡ ''Map
+ = return (wrapperTy, deriveMap)
inspectInstance ty
= fail $ "deriveInstance: unsupported type: " ⧺ pprint ty
| otherwise
= fail $ "deriveIndexed: unknown method: " ⧺ pprint name
+deriveMap ∷ Q Cxt → Q Type → Q Exp → Q Exp → Q Dec
+deriveMap c ty wrap unwrap
+ = do names ← methodNames ''Map
+ instanceD c ty $ concatMap (pointfreeMethod exp) names
+ where
+ exp ∷ Name → Q Exp
+ exp name
+ | name ≡ 'delete
+ = [| ($wrap ∘) ∘ (∘ $unwrap) ∘ delete |]
+ | name ≡ 'member
+ = [| (∘ $unwrap) ∘ member |]
+ | name ≡ 'union
+ = [| ($wrap ∘) ∘ (∘ $unwrap) ∘ union ∘ $unwrap |]
+ | name ≡ 'intersection
+ = [| ($wrap ∘) ∘ (∘ $unwrap) ∘ intersection ∘ $unwrap |]
+ | name ≡ 'difference
+ = [| ($wrap ∘) ∘ (∘ $unwrap) ∘ difference ∘ $unwrap |]
+ | name ≡ 'isSubset
+ = [| (∘ $unwrap) ∘ isSubset ∘ $unwrap |]
+ | name ≡ 'isProperSubset
+ = [| (∘ $unwrap) ∘ isProperSubset ∘ $unwrap |]
+ | name ≡ 'lookup
+ = [| (∘ $unwrap) ∘ lookup |]
+ | name ≡ 'alter
+ = [| (($wrap ∘) ∘) ∘ flip flip $unwrap ∘ ((∘) ∘) ∘ alter |]
+ | name ≡ 'insertWith
+ = [| ((($wrap ∘) ∘) ∘) ∘ flip flip $unwrap ∘ ((flip ∘ ((∘) ∘)) ∘) ∘ insertWith |]
+ | name ≡ 'fromFoldableWith
+ = [| ($wrap ∘) ∘ fromFoldableWith |]
+ | name ≡ 'foldGroups
+ = [| (($wrap ∘) ∘) ∘ foldGroups |]
+ | name ≡ 'mapWithKey
+ = [| ($wrap ∘) ∘ (∘ $unwrap) ∘ mapWithKey |]
+ | name ≡ 'unionWith
+ = [| (($wrap ∘) ∘) ∘ flip flip $unwrap ∘ ((∘) ∘) ∘ (∘ $unwrap) ∘ unionWith |]
+ | name ≡ 'intersectionWith
+ = [| (($wrap ∘) ∘) ∘ flip flip $unwrap ∘ ((∘) ∘) ∘ (∘ $unwrap) ∘ intersectionWith |]
+ | name ≡ 'differenceWith
+ = [| (($wrap ∘) ∘) ∘ flip flip $unwrap ∘ ((∘) ∘) ∘ (∘ $unwrap) ∘ differenceWith |]
+ | name ≡ 'isSubmapBy
+ = [| flip flip $unwrap ∘ ((∘) ∘) ∘ (∘ $unwrap) ∘ isSubmapBy |]
+ | name ≡ 'isProperSubmapBy
+ = [| flip flip $unwrap ∘ ((∘) ∘) ∘ (∘ $unwrap) ∘ isProperSubmapBy |]
+ | otherwise
+ = fail $ "deriveMap: unknown method: " ⧺ pprint name
+
+deriveSet ∷ Q Cxt → Q Type → Q Exp → Q Exp → Q Dec
+deriveSet c ty _ _
+ = do names ← methodNames ''Set
+ instanceD c ty $ concatMap (pointfreeMethod exp) names
+ where
+ exp ∷ Name → Q Exp
+ exp name
+ | name ≡ 'haddock_candy
+ = [| haddock_candy |]
+ | otherwise
+ = fail $ "deriveSet: unknown method: " ⧺ pprint name
+
deriveSortingCollection ∷ Q Cxt → Q Type → Q Exp → Q Exp → Q Dec
deriveSortingCollection c ty wrap unwrap
= do names ← methodNames ''SortingCollection