|
definition:
|
makeAllPublic :: CurryProg -> CurryProg
makeAllPublic (CurryProg modname imports dfltdecl clsdecls instdecls
typedecls functions opdecls) =
CurryProg modname stimports dfltdecl clsdecls instdecls
typedecls publicFunctions opdecls
where
stimports = if generatorModule `elem` imports &&
searchTreeModule `notElem` imports
then searchTreeModule : imports -- just to be safe if module
-- contains generator definitions
else imports
publicFunctions = map makePublic $ map ignoreComment functions
-- since we create a copy of the module, we can ignore unnecessary data
ignoreComment :: CFuncDecl -> CFuncDecl
ignoreComment (CmtFunc _ name arity visibility typeExpr rules) =
CFunc name arity visibility typeExpr rules
ignoreComment x@(CFunc _ _ _ _ _) = x
makePublic :: CFuncDecl -> CFuncDecl
makePublic (CFunc name arity _ typeExpr rules) =
CFunc name arity Public typeExpr rules
makePublic (CmtFunc cmt name arity _ typeExpr rules) =
CmtFunc cmt name arity Public typeExpr rules
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-------------------------------------------------------------------------
-- Turn all functions into public ones.
-- This ensures that all tests can be executed.
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
name:
|
makeAllPublic
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{CurryProg}
|
|
signature:
|
AbstractCurry.Types.CurryProg -> AbstractCurry.Types.CurryProg
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|