{-# LANGUAGE CPP #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE TemplateHaskell #-}
module Yesod.Routes.TH.Internal where
import Prelude hiding (exp)
import Data.List (foldl')
import Data.Maybe (mapMaybe)
import Language.Haskell.TH.Syntax hiding (newName)
import Language.Haskell.TH.Syntax.Compat (Quote(..))
import Web.PathPieces (fromPathPiece, fromPathMultiPiece)
import Yesod.Routes.TH.Types
conPCompat :: Name -> [Pat] -> Pat
conPCompat :: Name -> [Pat] -> Pat
conPCompat Name
n [Pat]
pats = Name -> [Type] -> [Pat] -> Pat
ConP Name
n
#if MIN_VERSION_template_haskell(2,18,0)
[]
#endif
[Pat]
pats
instanceD :: Cxt -> Type -> [Dec] -> Dec
instanceD :: [Type] -> Type -> [Dec] -> Dec
instanceD = Maybe Overlap -> [Type] -> Type -> [Dec] -> Dec
InstanceD Maybe Overlap
forall a. Maybe a
Nothing
mkTupE :: [Exp] -> Exp
mkTupE :: [Exp] -> Exp
mkTupE =
[Maybe Exp] -> Exp
TupE
#if MIN_VERSION_template_haskell(2,16,0)
([Maybe Exp] -> Exp) -> ([Exp] -> [Maybe Exp]) -> [Exp] -> Exp
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Exp -> Maybe Exp) -> [Exp] -> [Maybe Exp]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Exp -> Maybe Exp
forall a. a -> Maybe a
Just
#endif
parentArgsExprFromExps :: [Exp] -> Exp
parentArgsExprFromExps :: [Exp] -> Exp
parentArgsExprFromExps [] = Name -> Exp
ConE '()
parentArgsExprFromExps [Exp
e] = Exp
e
parentArgsExprFromExps [Exp]
es = [Exp] -> Exp
mkTupE [Exp]
es
parentArgsExpr :: [Name] -> Exp
parentArgsExpr :: [Name] -> Exp
parentArgsExpr = [Exp] -> Exp
parentArgsExprFromExps ([Exp] -> Exp) -> ([Name] -> [Exp]) -> [Name] -> Exp
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Name -> Exp) -> [Name] -> [Exp]
forall a b. (a -> b) -> [a] -> [b]
map Name -> Exp
VarE
parentArgsPat :: [Name] -> Pat
parentArgsPat :: [Name] -> Pat
parentArgsPat [] = Pat
WildP
parentArgsPat [Name
a] = Name -> Pat
VarP Name
a
parentArgsPat [Name]
as = [Pat] -> Pat
TupP ((Name -> Pat) -> [Name] -> [Pat]
forall a b. (a -> b) -> [a] -> [b]
map Name -> Pat
VarP [Name]
as)
parentArgsType :: [Type] -> Type
parentArgsType :: [Type] -> Type
parentArgsType [] = Name -> Type
ConT ''()
parentArgsType [Type
t] = Type
t
parentArgsType [Type]
ts = (Type -> Type -> Type) -> Type -> [Type] -> Type
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl' Type -> Type -> Type
AppT (Int -> Type
TupleT ([Type] -> Int
forall a. [a] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length [Type]
ts)) [Type]
ts
typeArity :: Name -> Q Int
typeArity :: Name -> Q Int
typeArity Name
typeName = do
info <- Name -> Q Info
reify Name
typeName
pure $ case info of
TyConI (DataD [Type]
_ Name
_ [TyVarBndr BndrVis]
vs Maybe Type
_ [Con]
_ [DerivClause]
_) -> [TyVarBndr BndrVis] -> Int
forall a. [a] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length [TyVarBndr BndrVis]
vs
TyConI (NewtypeD [Type]
_ Name
_ [TyVarBndr BndrVis]
vs Maybe Type
_ Con
_ [DerivClause]
_) -> [TyVarBndr BndrVis] -> Int
forall a. [a] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length [TyVarBndr BndrVis]
vs
TyConI (TySynD Name
_ [TyVarBndr BndrVis]
vs Type
_) -> [TyVarBndr BndrVis] -> Int
forall a. [a] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length [TyVarBndr BndrVis]
vs
Info
_ -> Int
0
fullyApplyType :: Name -> Q Type
fullyApplyType :: Name -> Q Type
fullyApplyType Name
typeName = do
arity <- Name -> Q Int
typeArity Name
typeName
vars <- mapM (\Int
i -> Name -> Type
VarT (Name -> Type) -> Q Name -> Q Type
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> String -> Q Name
forall (m :: * -> *). Quote m => String -> m Name
newName (String
"a" String -> String -> String
forall a. [a] -> [a] -> [a]
++ Int -> String
forall a. Show a => a -> String
show Int
i)) [1..arity]
pure $ foldl' AppT (ConT typeName) vars
data RouteCon = RouteCon
{ RouteCon -> String
rcName :: String
, RouteCon -> Maybe Name
rcResolved :: Maybe Name
}
resolveRouteCon :: String -> Q RouteCon
resolveRouteCon :: String -> Q RouteCon
resolveRouteCon String
name = String -> Maybe Name -> RouteCon
RouteCon String
name (Maybe Name -> RouteCon) -> Q (Maybe Name) -> Q RouteCon
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> String -> Q (Maybe Name)
lookupTypeName String
name
nestedInstanceExists :: Name -> RouteCon -> Q Bool
nestedInstanceExists :: Name -> RouteCon -> Q Bool
nestedInstanceExists Name
klass RouteCon
rc =
case RouteCon -> Maybe Name
rcResolved RouteCon
rc of
Maybe Name
Nothing -> Bool -> Q Bool
forall a. a -> Q a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Bool
False
Just Name
typeName -> do
appliedT <- Name -> Q Type
fullyApplyType Name
typeName
isInstance klass [appliedT]
appliedRouteTypeCon :: RouteCon -> TyArgs -> Q Type
appliedRouteTypeCon :: RouteCon -> TyArgs -> Q Type
appliedRouteTypeCon RouteCon
rc TyArgs
tyargs =
case (RouteCon -> Maybe Name
rcResolved RouteCon
rc, TyArgs
tyargs) of
(Just Name
typeName, TyArgs
NoTyArgs) -> Name -> Q Type
fullyApplyType Name
typeName
(Just Name
typeName, SomeTyArgs{}) -> Type -> Q Type
forall a. a -> Q a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Type -> Q Type) -> Type -> Q Type
forall a b. (a -> b) -> a -> b
$ Type -> TyArgs -> Type
applyTyArgs (Name -> Type
ConT Name
typeName) TyArgs
tyargs
(Maybe Name
Nothing, TyArgs
_) -> Type -> Q Type
forall a. a -> Q a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Type -> Q Type) -> Type -> Q Type
forall a b. (a -> b) -> a -> b
$ Type -> TyArgs -> Type
applyTyArgs (Name -> Type
ConT (String -> Name
mkName (RouteCon -> String
rcName RouteCon
rc))) TyArgs
tyargs
appliedRouteTypeNamed :: String -> TyArgs -> Q Type
appliedRouteTypeNamed :: String -> TyArgs -> Q Type
appliedRouteTypeNamed String
routeName TyArgs
tyargs = do
rc <- String -> Q RouteCon
resolveRouteCon String
routeName
appliedRouteTypeCon rc tyargs
newtype SubsiteName = SubsiteName String deriving (SubsiteName -> SubsiteName -> Bool
(SubsiteName -> SubsiteName -> Bool)
-> (SubsiteName -> SubsiteName -> Bool) -> Eq SubsiteName
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: SubsiteName -> SubsiteName -> Bool
== :: SubsiteName -> SubsiteName -> Bool
$c/= :: SubsiteName -> SubsiteName -> Bool
/= :: SubsiteName -> SubsiteName -> Bool
Eq, Int -> SubsiteName -> String -> String
[SubsiteName] -> String -> String
SubsiteName -> String
(Int -> SubsiteName -> String -> String)
-> (SubsiteName -> String)
-> ([SubsiteName] -> String -> String)
-> Show SubsiteName
forall a.
(Int -> a -> String -> String)
-> (a -> String) -> ([a] -> String -> String) -> Show a
$cshowsPrec :: Int -> SubsiteName -> String -> String
showsPrec :: Int -> SubsiteName -> String -> String
$cshow :: SubsiteName -> String
show :: SubsiteName -> String
$cshowList :: [SubsiteName] -> String -> String
showList :: [SubsiteName] -> String -> String
Show)
newtype RouteName = RouteName String deriving (RouteName -> RouteName -> Bool
(RouteName -> RouteName -> Bool)
-> (RouteName -> RouteName -> Bool) -> Eq RouteName
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: RouteName -> RouteName -> Bool
== :: RouteName -> RouteName -> Bool
$c/= :: RouteName -> RouteName -> Bool
/= :: RouteName -> RouteName -> Bool
Eq, Int -> RouteName -> String -> String
[RouteName] -> String -> String
RouteName -> String
(Int -> RouteName -> String -> String)
-> (RouteName -> String)
-> ([RouteName] -> String -> String)
-> Show RouteName
forall a.
(Int -> a -> String -> String)
-> (a -> String) -> ([a] -> String -> String) -> Show a
$cshowsPrec :: Int -> RouteName -> String -> String
showsPrec :: Int -> RouteName -> String -> String
$cshow :: RouteName -> String
show :: RouteName -> String
$cshowList :: [RouteName] -> String -> String
showList :: [RouteName] -> String -> String
Show)
newtype SubsiteArity = SubsiteArity Int deriving (SubsiteArity -> SubsiteArity -> Bool
(SubsiteArity -> SubsiteArity -> Bool)
-> (SubsiteArity -> SubsiteArity -> Bool) -> Eq SubsiteArity
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: SubsiteArity -> SubsiteArity -> Bool
== :: SubsiteArity -> SubsiteArity -> Bool
$c/= :: SubsiteArity -> SubsiteArity -> Bool
/= :: SubsiteArity -> SubsiteArity -> Bool
Eq, Int -> SubsiteArity -> String -> String
[SubsiteArity] -> String -> String
SubsiteArity -> String
(Int -> SubsiteArity -> String -> String)
-> (SubsiteArity -> String)
-> ([SubsiteArity] -> String -> String)
-> Show SubsiteArity
forall a.
(Int -> a -> String -> String)
-> (a -> String) -> ([a] -> String -> String) -> Show a
$cshowsPrec :: Int -> SubsiteArity -> String -> String
showsPrec :: Int -> SubsiteArity -> String -> String
$cshow :: SubsiteArity -> String
show :: SubsiteArity -> String
$cshowList :: [SubsiteArity] -> String -> String
showList :: [SubsiteArity] -> String -> String
Show)
newtype RouteArity = RouteArity Int deriving (RouteArity -> RouteArity -> Bool
(RouteArity -> RouteArity -> Bool)
-> (RouteArity -> RouteArity -> Bool) -> Eq RouteArity
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: RouteArity -> RouteArity -> Bool
== :: RouteArity -> RouteArity -> Bool
$c/= :: RouteArity -> RouteArity -> Bool
/= :: RouteArity -> RouteArity -> Bool
Eq, Int -> RouteArity -> String -> String
[RouteArity] -> String -> String
RouteArity -> String
(Int -> RouteArity -> String -> String)
-> (RouteArity -> String)
-> ([RouteArity] -> String -> String)
-> Show RouteArity
forall a.
(Int -> a -> String -> String)
-> (a -> String) -> ([a] -> String -> String) -> Show a
$cshowsPrec :: Int -> RouteArity -> String -> String
showsPrec :: Int -> RouteArity -> String -> String
$cshow :: RouteArity -> String
show :: RouteArity -> String
$cshowList :: [RouteArity] -> String -> String
showList :: [RouteArity] -> String -> String
Show)
data ArityMismatch = ArityMismatch
{ ArityMismatch -> SubsiteName
amSubsiteName :: SubsiteName
, ArityMismatch -> RouteName
amRouteName :: RouteName
, ArityMismatch -> SubsiteArity
amSubsiteArity :: SubsiteArity
, ArityMismatch -> RouteArity
amRouteArity :: RouteArity
} deriving (ArityMismatch -> ArityMismatch -> Bool
(ArityMismatch -> ArityMismatch -> Bool)
-> (ArityMismatch -> ArityMismatch -> Bool) -> Eq ArityMismatch
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: ArityMismatch -> ArityMismatch -> Bool
== :: ArityMismatch -> ArityMismatch -> Bool
$c/= :: ArityMismatch -> ArityMismatch -> Bool
/= :: ArityMismatch -> ArityMismatch -> Bool
Eq, Int -> ArityMismatch -> String -> String
[ArityMismatch] -> String -> String
ArityMismatch -> String
(Int -> ArityMismatch -> String -> String)
-> (ArityMismatch -> String)
-> ([ArityMismatch] -> String -> String)
-> Show ArityMismatch
forall a.
(Int -> a -> String -> String)
-> (a -> String) -> ([a] -> String -> String) -> Show a
$cshowsPrec :: Int -> ArityMismatch -> String -> String
showsPrec :: Int -> ArityMismatch -> String -> String
$cshow :: ArityMismatch -> String
show :: ArityMismatch -> String
$cshowList :: [ArityMismatch] -> String -> String
showList :: [ArityMismatch] -> String -> String
Show)
checkNestedSubArity
:: SubsiteName
-> RouteName
-> SubsiteArity
-> RouteArity
-> Maybe ArityMismatch
checkNestedSubArity :: SubsiteName
-> RouteName -> SubsiteArity -> RouteArity -> Maybe ArityMismatch
checkNestedSubArity SubsiteName
subName RouteName
routeName (SubsiteArity Int
subArgs) (RouteArity Int
nestedArity)
| Int
subArgs Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
nestedArity = Maybe ArityMismatch
forall a. Maybe a
Nothing
| Bool
otherwise = ArityMismatch -> Maybe ArityMismatch
forall a. a -> Maybe a
Just (ArityMismatch -> Maybe ArityMismatch)
-> ArityMismatch -> Maybe ArityMismatch
forall a b. (a -> b) -> a -> b
$ SubsiteName
-> RouteName -> SubsiteArity -> RouteArity -> ArityMismatch
ArityMismatch SubsiteName
subName RouteName
routeName (Int -> SubsiteArity
SubsiteArity Int
subArgs) (Int -> RouteArity
RouteArity Int
nestedArity)
data ArityCallSite
= SubsiteCall
| TopLevelCall
deriving (ArityCallSite -> ArityCallSite -> Bool
(ArityCallSite -> ArityCallSite -> Bool)
-> (ArityCallSite -> ArityCallSite -> Bool) -> Eq ArityCallSite
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: ArityCallSite -> ArityCallSite -> Bool
== :: ArityCallSite -> ArityCallSite -> Bool
$c/= :: ArityCallSite -> ArityCallSite -> Bool
/= :: ArityCallSite -> ArityCallSite -> Bool
Eq, Int -> ArityCallSite -> String -> String
[ArityCallSite] -> String -> String
ArityCallSite -> String
(Int -> ArityCallSite -> String -> String)
-> (ArityCallSite -> String)
-> ([ArityCallSite] -> String -> String)
-> Show ArityCallSite
forall a.
(Int -> a -> String -> String)
-> (a -> String) -> ([a] -> String -> String) -> Show a
$cshowsPrec :: Int -> ArityCallSite -> String -> String
showsPrec :: Int -> ArityCallSite -> String -> String
$cshow :: ArityCallSite -> String
show :: ArityCallSite -> String
$cshowList :: [ArityCallSite] -> String -> String
showList :: [ArityCallSite] -> String -> String
Show)
assertNestedSubArity :: ArityCallSite -> SubsiteName -> SubsiteArity -> RouteCon -> Q ()
assertNestedSubArity :: ArityCallSite -> SubsiteName -> SubsiteArity -> RouteCon -> Q ()
assertNestedSubArity ArityCallSite
callSite SubsiteName
subName SubsiteArity
subArity RouteCon
rc =
case RouteCon -> Maybe Name
rcResolved RouteCon
rc of
Maybe Name
Nothing -> () -> Q ()
forall a. a -> Q a
forall (f :: * -> *) a. Applicative f => a -> f a
pure ()
Just Name
tyname -> do
nestedArity <- Name -> Q Int
typeArity Name
tyname
maybe (pure ()) (fail . arityMismatchMessage callSite) $
checkNestedSubArity subName (RouteName (rcName rc)) subArity (RouteArity nestedArity)
arityMismatchMessage :: ArityCallSite -> ArityMismatch -> String
arityMismatchMessage :: ArityCallSite -> ArityMismatch -> String
arityMismatchMessage ArityCallSite
callSite (ArityMismatch (SubsiteName String
subName) (RouteName String
routeName) (SubsiteArity Int
subArgs) (RouteArity Int
nestedArity)) =
[String] -> String
forall (t :: * -> *) a. Foldable t => t [a] -> [a]
concat
[ String
prefix, String
": the nested route datatype `", String
routeName
, String
"` has ", Int -> String
forall a. Show a => a -> String
show Int
nestedArity, String
" type parameter(s), but the ", String
term, String
" `"
, String
subName, String
"` has ", Int -> String
forall a. Show a => a -> String
show Int
subArgs
, String
". The subroute datatypes must carry exactly the ", String
term, String
"'s type "
, String
"parameter(s) — generate the ", String
term, String
"'s routes with "
, String
"`mkYesodSubDataOpts (setParameterizedSubroute True defaultOpts) ...` "
, String
"so a parameterized ", String
term, String
" gets parameterized subroutes."
]
where
(String
prefix, String
term) = case ArityCallSite
callSite of
ArityCallSite
SubsiteCall -> (String
"mkYesodSubDispatchInstance", String
"subsite")
ArityCallSite
TopLevelCall -> (String
"mkYesod", String
"site")
handlePieceM :: Quote m => Piece a -> m (Pat, Maybe Name)
handlePieceM :: forall (m :: * -> *) a. Quote m => Piece a -> m (Pat, Maybe Name)
handlePieceM (Static String
str) = (Pat, Maybe Name) -> m (Pat, Maybe Name)
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Lit -> Pat
LitP (Lit -> Pat) -> Lit -> Pat
forall a b. (a -> b) -> a -> b
$ String -> Lit
StringL String
str, Maybe Name
forall a. Maybe a
Nothing)
handlePieceM (Dynamic a
_) = Name -> (Pat, Maybe Name)
mk (Name -> (Pat, Maybe Name)) -> m Name -> m (Pat, Maybe Name)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> String -> m Name
forall (m :: * -> *). Quote m => String -> m Name
newName String
"dyn"
where
mk :: Name -> (Pat, Maybe Name)
mk Name
x = (Exp -> Pat -> Pat
ViewP (Name -> Exp
VarE 'fromPathPiece) (Name -> [Pat] -> Pat
conPCompat 'Just [Name -> Pat
VarP Name
x]), Name -> Maybe Name
forall a. a -> Maybe a
Just Name
x)
handlePiecesNames :: Quote m => [Piece a] -> m ([Pat], [Name])
handlePiecesNames :: forall (m :: * -> *) a. Quote m => [Piece a] -> m ([Pat], [Name])
handlePiecesNames =
([(Pat, Maybe Name)] -> ([Pat], [Name]))
-> m [(Pat, Maybe Name)] -> m ([Pat], [Name])
forall a b. (a -> b) -> m a -> m b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (\[(Pat, Maybe Name)]
pps -> (((Pat, Maybe Name) -> Pat) -> [(Pat, Maybe Name)] -> [Pat]
forall a b. (a -> b) -> [a] -> [b]
map (Pat, Maybe Name) -> Pat
forall a b. (a, b) -> a
fst [(Pat, Maybe Name)]
pps, ((Pat, Maybe Name) -> Maybe Name) -> [(Pat, Maybe Name)] -> [Name]
forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe (Pat, Maybe Name) -> Maybe Name
forall a b. (a, b) -> b
snd [(Pat, Maybe Name)]
pps)) (m [(Pat, Maybe Name)] -> m ([Pat], [Name]))
-> ([Piece a] -> m [(Pat, Maybe Name)])
-> [Piece a]
-> m ([Pat], [Name])
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Piece a -> m (Pat, Maybe Name))
-> [Piece a] -> m [(Pat, Maybe Name)]
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> [a] -> f [b]
traverse Piece a -> m (Pat, Maybe Name)
forall (m :: * -> *) a. Quote m => Piece a -> m (Pat, Maybe Name)
handlePieceM
handlePiecesM :: Quote m => [Piece a] -> m ([Pat], [Exp])
handlePiecesM :: forall (m :: * -> *) a. Quote m => [Piece a] -> m ([Pat], [Exp])
handlePiecesM =
(([Pat], [Name]) -> ([Pat], [Exp]))
-> m ([Pat], [Name]) -> m ([Pat], [Exp])
forall a b. (a -> b) -> m a -> m b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (\([Pat]
pats, [Name]
names) -> ([Pat]
pats, (Name -> Exp) -> [Name] -> [Exp]
forall a b. (a -> b) -> [a] -> [b]
map Name -> Exp
VarE [Name]
names)) (m ([Pat], [Name]) -> m ([Pat], [Exp]))
-> ([Piece a] -> m ([Pat], [Name]))
-> [Piece a]
-> m ([Pat], [Exp])
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Piece a] -> m ([Pat], [Name])
forall (m :: * -> *) a. Quote m => [Piece a] -> m ([Pat], [Name])
handlePiecesNames
applyConPieces :: String -> [Exp] -> Exp
applyConPieces :: String -> [Exp] -> Exp
applyConPieces String
name = (Exp -> Exp -> Exp) -> Exp -> [Exp] -> Exp
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl' Exp -> Exp -> Exp
AppE (Name -> Exp
ConE (String -> Name
mkName String
name))
composeE :: Exp -> Exp -> Exp
composeE :: Exp -> Exp -> Exp
composeE Exp
f Exp
g = Maybe Exp -> Exp -> Maybe Exp -> Exp
InfixE (Exp -> Maybe Exp
forall a. a -> Maybe a
Just Exp
f) (Name -> Exp
VarE '(.)) (Exp -> Maybe Exp
forall a. a -> Maybe a
Just Exp
g)
consE :: Exp -> Exp -> Exp
consE :: Exp -> Exp -> Exp
consE Exp
x Exp
xs = Maybe Exp -> Exp -> Maybe Exp -> Exp
InfixE (Exp -> Maybe Exp
forall a. a -> Maybe a
Just Exp
x) (Name -> Exp
ConE '(:)) (Exp -> Maybe Exp
forall a. a -> Maybe a
Just Exp
xs)
data PathTail
= EndExact
| EndRest Name
| EndWild
| EndMulti Name
pathTailPat :: PathTail -> Pat
pathTailPat :: PathTail -> Pat
pathTailPat PathTail
EndExact = Name -> [Pat] -> Pat
conPCompat '[] []
pathTailPat (EndRest Name
n) = Name -> Pat
VarP Name
n
pathTailPat PathTail
EndWild = Pat
WildP
pathTailPat (EndMulti Name
n) = Exp -> Pat -> Pat
ViewP (Name -> Exp
VarE 'fromPathMultiPiece) (Name -> [Pat] -> Pat
conPCompat 'Just [Name -> Pat
VarP Name
n])
mkPathPat :: PathTail -> [Pat] -> Pat
mkPathPat :: PathTail -> [Pat] -> Pat
mkPathPat PathTail
tl = (Pat -> Pat -> Pat) -> Pat -> [Pat] -> Pat
forall a b. (a -> b -> b) -> b -> [a] -> b
forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr (\Pat
x Pat
y -> Name -> [Pat] -> Pat
conPCompat '(:) [Pat
x, Pat
y]) (PathTail -> Pat
pathTailPat PathTail
tl)
mkLambda :: String -> (Name -> Q Exp) -> Q Exp
mkLambda :: String -> (Name -> Q Exp) -> Q Exp
mkLambda String
hint Name -> Q Exp
mkBody = do
n <- String -> Q Name
forall (m :: * -> *). Quote m => String -> m Name
newName String
hint
bdy <- mkBody n
pure $ LamE [VarP n] bdy
findNestedRoute :: String -> [ResourceTree a] -> Maybe ([Piece a], [ResourceTree a])
findNestedRoute :: forall a.
String -> [ResourceTree a] -> Maybe ([Piece a], [ResourceTree a])
findNestedRoute String
_ [] = Maybe ([Piece a], [ResourceTree a])
forall a. Maybe a
Nothing
findNestedRoute String
target (ResourceTree a
res : [ResourceTree a]
ress) =
case ResourceTree a
res of
ResourceLeaf Resource a
_ ->
String -> [ResourceTree a] -> Maybe ([Piece a], [ResourceTree a])
forall a.
String -> [ResourceTree a] -> Maybe ([Piece a], [ResourceTree a])
findNestedRoute String
target [ResourceTree a]
ress
ResourceParent String
name Bool
_overlap Set String
_attrs [Piece a]
pieces [ResourceTree a]
children -> do
if String
name String -> String -> Bool
forall a. Eq a => a -> a -> Bool
== String
target
then ([Piece a], [ResourceTree a])
-> Maybe ([Piece a], [ResourceTree a])
forall a. a -> Maybe a
Just ([Piece a]
pieces, [ResourceTree a]
children)
else
let mresult :: Maybe ([Piece a], [ResourceTree a])
mresult = String -> [ResourceTree a] -> Maybe ([Piece a], [ResourceTree a])
forall a.
String -> [ResourceTree a] -> Maybe ([Piece a], [ResourceTree a])
findNestedRoute String
target [ResourceTree a]
children
in
case Maybe ([Piece a], [ResourceTree a])
mresult of
Maybe ([Piece a], [ResourceTree a])
Nothing -> do
String -> [ResourceTree a] -> Maybe ([Piece a], [ResourceTree a])
forall a.
String -> [ResourceTree a] -> Maybe ([Piece a], [ResourceTree a])
findNestedRoute String
target [ResourceTree a]
ress
Just ([Piece a]
typs, [ResourceTree a]
childRoute) -> do
([Piece a], [ResourceTree a])
-> Maybe ([Piece a], [ResourceTree a])
forall a. a -> Maybe a
Just ([Piece a]
pieces [Piece a] -> [Piece a] -> [Piece a]
forall a. Semigroup a => a -> a -> a
<> [Piece a]
typs, [ResourceTree a]
childRoute)