Safe Haskell | Safe-Infered |
---|
Main
- fst3 :: (a, b, c) -> a
- argDirsToFiles :: IO (FilePath, [(FilePath, FilePath)])
- main :: IO ()
- bootf :: FilePath -> FilePath
- ordered :: (Eq a, Eq b) => (b -> a) -> (b -> [a]) -> (a -> Maybe b) -> [b] -> [[b]]
- cyclicDeps :: Eq a => (b -> a) -> (b -> [a]) -> (a -> Maybe b) -> [b] -> [[b]]
- lookupWith :: Eq a => (b -> a) -> a -> [b] -> Maybe b
- targetNamespace :: Element i -> String
- xsdSchema :: QName
Documentation
fst3 :: (a, b, c) -> a
argDirsToFiles :: IO (FilePath, [(FilePath, FilePath)])
ordered :: (Eq a, Eq b) => (b -> a) -> (b -> [a]) -> (a -> Maybe b) -> [b] -> [[b]]
Calculate dependency ordering of modules, least dependent first. Cyclic groups may occur, suitably placed in the ordering.
cyclicDeps :: Eq a => (b -> a) -> (b -> [a]) -> (a -> Maybe b) -> [b] -> [[b]]
Find cyclic dependencies between modules.
lookupWith :: Eq a => (b -> a) -> a -> [b] -> Maybe b
A variation on the standard lookup function.
targetNamespace :: Element i -> String
What is the targetNamespace of the unique top-level element?