|
definition:
|
printAllLoadPathPrograms :: ReplState -> IO ()
printAllLoadPathPrograms rst = mapM_ printDirPrograms (loadPaths rst)
where
depthLimit = 10
printDirPrograms dir = do
putStrLn $ "Curry programs in directory '" ++ dir ++ "':"
progs <- getDirPrograms depthLimit "" dir
putStrLn $ unwords $ sort $ progs
putStrLn ""
getDirPrograms dlimit prefix dir = do
exdir <- doesDirectoryExist dir
files <- if exdir && dlimit > 0 then getDirectoryContents dir
else return []
subprogs <- mapM (\d -> getDirPrograms (dlimit - 1) (prefix ++ d ++ ".")
(dir </> d))
(filter (\f -> let c = head f in c>='A' && c<='Z') files)
return $ concat subprogs ++
concatMap (\f -> let (base, sfx) = splitExtension f
in if sfx `elem` [".curry", ".lcurry"] && notNull base
then [prefix ++ base]
else [])
files
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Print all Curry programs in current load path.
--- Programs found in subdirectories are assumed to be hierarchical.
--- To avoid loops in cyclic directory structure, we put a depth limit
--- on the recursive search.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_) |-> _}
|
|
name:
|
printAllLoadPathPrograms
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
REPL.State.ReplState -> Prelude.IO ()
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|