directory-tree 0.1 → 0.1.1
raw patch · 2 files changed
+6/−6 lines, 2 filesdep +directorydep +filepath
Dependencies added: directory, filepath
Files
- System/Directory/Tree.hs +4/−4
- directory-tree.cabal +2/−2
System/Directory/Tree.hs view
@@ -71,7 +71,6 @@ import Data.Function (on) import Data.List (sort, (\\))-import Control.Monad (liftM, filterM, liftM2, ap) import Control.Applicative import qualified Data.Traversable as T@@ -118,7 +117,7 @@ instance T.Traversable DirTree where traverse f (Dir n cs) = Dir n <$> T.traverse (T.traverse f) cs traverse f (File n a) = File n <$> f a- traverse f (Failed n e) = pure (Failed n e)+ traverse _ (Failed n e) = pure (Failed n e) @@ -256,12 +255,12 @@ zipPaths (b :/ t) = zipP b t where zipP p (File n a) = File n (p</>n , a) zipP p (Dir n cs) = Dir n $ map (zipP $ p</>n) cs- zipP p (Failed n e) = Failed n e+ zipP _ (Failed n e) = Failed n e -- extracting pathnames and base names:+topDir, baseDir :: FilePath -> FilePath topDir = last . splitDirectories - baseDir = joinPath . init . splitDirectories @@ -283,6 +282,7 @@ ----- and getDirectoryContents fails epically on "" -- prepares the directory contents list. we sort so that we can be sure of -- a consistent fold/traversal order on the same directory:+getDirsFiles :: String -> IO [FilePath] getDirsFiles cs = do let cs' = if null cs then "." else cs dfs <- getDirectoryContents cs' return $ sort $ dfs \\ [".",".."]
directory-tree.cabal view
@@ -1,5 +1,5 @@ name: directory-tree-version: 0.1+version: 0.1.1 homepage: http://coder.bsimmons.name/blog/2009/05/directory-tree-module-released/ synopsis: A simple directory-like tree datatype, with useful IO functions description: A simple directory-like tree datatype, with useful IO functions and Foldable and Traversable instance @@ -56,5 +56,5 @@ library exposed-modules: System.Directory.Tree- build-depends: base+ build-depends: base, filepath, directory ghc-options: -Wall