directory-contents 0.2.0.2 → 0.2.0.3

raw patch · 2 files changed

+9/−9 lines, 2 filesdep ~basedep ~containersdep ~filepathPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base, containers, filepath, witherable

API changes (from Hackage documentation)

Files

• directory-contents.cabal +5/−5
• src/System/Directory/Contents.hs +4/−4

@@ -1,6 +1,6 @@ cabal-version:      >=1.10 name:               directory-contents-version:            0.2.0.2+version:            0.2.0.3 synopsis:           Recursively build, navigate, and operate on a tree of directory contents. description:   Like the linux tree command, this library recursively constructs a tree of directory contents while detecting and avoiding symlink cycles. It also provides functions for operating on and navigating the contents.@@ -24,13 +24,13 @@                     System.Directory.Contents.Types                     System.Directory.Contents.Zipper   build-depends:-      base         >=4.12 && <4.20-    , containers   >=0.6  && <0.8+      base         >=4.12 && <5+    , containers   >=0.6  && <0.9     , directory    >=1.3  && <1.4-    , filepath     >=1.4  && <1.5+    , filepath     >=1.4  && <1.6     , text         >=1.2  && <2.2     , transformers >=0.5  && <0.7-    , witherable   >=0.3  && <0.5+    , witherable   >=0.5  && <0.6    hs-source-dirs:   src   default-language: Haskell2010

@@ -19,7 +19,7 @@ See 'System.Directory.Contents.Zipper.DirZipper' for zipper-based navigation.  -}-module System.Directory.Contents +module System.Directory.Contents   (   -- * Directory hierarchy tree     DirTree(..)@@ -70,9 +70,9 @@ import Data.Text (Text) import qualified Data.Text as T import Data.Tree as DataTree-import Data.Witherable import System.Directory import System.FilePath+import Witherable  import System.Directory.Contents.Types import System.Directory.Contents.Zipper@@ -352,9 +352,9 @@ catMaybesDirTree :: DirTree (Maybe a) -> Maybe (DirTree a) catMaybesDirTree = withDirTreeMaybe catMaybes --- | 'Data.Witherable.filter' for 'DirTree'. See 'witherDirTree'.+-- | 'Witherable.filter' for 'DirTree'. See 'witherDirTree'. filterDirTree :: (a -> Bool) -> DirTree a -> Maybe (DirTree a)-filterDirTree = withDirTreeMaybe . Data.Witherable.filter+filterDirTree = withDirTreeMaybe . Witherable.filter  -- | Remove empty directories from the 'DirTree' pruneDirTree :: DirTree a -> Maybe (DirTree a)