case (maybeUnfoldingTemplate.getIdUnfolding) v of
Just e -> if isCon e then snd $ cprAnalExpr rho e
else ids_inf
- _other -> ids_inf
- _other -> ids_inf
+ zz_other -> ids_inf
+ zz_other -> ids_inf
-- Return constructor with decorated arguments. If constructor
-- has product type then this is a manifest constructor (hooray!)
addCpr = (setIdCprInfo v).absToCprInfo
v_type = varType v
-- Split argument types and result type from v's type
- (_, argtys, _result_type) = splitTypeToFunArgAndRes v_type
+ (_, argtys, zz_result_type) = splitTypeToFunArgAndRes v_type
v_is_fn = argtys /= []
-- val_binders are the explicit lambdas at the head of the expression
- (binders,_stripped_exp) = collectBinders e
+ (binders,zz_stripped_exp) = collectBinders e
val_binders = filter (not.isTyVar) binders
filterAbsTuple :: (AbsVal, Type) -> AbsVal
read_con_comprehensions
= map read_con (tyConDataCons tycon)
in
- mk_easy_FunMonoBind tycon_loc readsPrec_RDR [_a_Pat, b_Pat] [] (
+ mk_easy_FunMonoBind tycon_loc readsPrec_RDR [zz_a_Pat, b_Pat] [] (
foldr1 append_Expr read_con_comprehensions
)
where
read_paren_arg -- parens depend on precedence...
| nullary_con = false_Expr -- it's optional.
- | otherwise = HsPar (genOpApp _a_Expr gt_RDR (HsLit (HsInt paren_prec_limit)))
+ | otherwise = HsPar (genOpApp zz_a_Expr gt_RDR (HsLit (HsInt paren_prec_limit)))
\end{code}
%************************************************************************
qual_orig_name n = nameRdrName (getName n)
varUnqual n = mkSrcUnqual varName n
-_a_RDR = varUnqual SLIT("_a")
+zz_a_RDR = varUnqual SLIT("_a")
a_RDR = varUnqual SLIT("a")
b_RDR = varUnqual SLIT("b")
c_RDR = varUnqual SLIT("c")
mkHsString s = HsString (_PK_ s)
-_a_Expr = HsVar _a_RDR
+zz_a_Expr = HsVar zz_a_RDR
a_Expr = HsVar a_RDR
b_Expr = HsVar b_RDR
c_Expr = HsVar c_RDR
con2tag_Expr tycon = HsVar (con2tag_RDR tycon)
wildPat = WildPatIn
-_a_Pat = VarPatIn _a_RDR
+zz_a_Pat = VarPatIn zz_a_RDR
a_Pat = VarPatIn a_RDR
b_Pat = VarPatIn b_RDR
c_Pat = VarPatIn c_RDR