Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/obsidiansystems/directory-contents
Recursively build a tree of directory contents, avoiding symlink cycles
https://github.com/obsidiansystems/directory-contents
haskell
Last synced: 3 days ago
JSON representation
Recursively build a tree of directory contents, avoiding symlink cycles
- Host: GitHub
- URL: https://github.com/obsidiansystems/directory-contents
- Owner: obsidiansystems
- License: bsd-3-clause
- Created: 2020-12-08T09:41:50.000Z (almost 4 years ago)
- Default Branch: master
- Last Pushed: 2024-01-30T19:43:40.000Z (9 months ago)
- Last Synced: 2024-08-03T15:06:27.311Z (3 months ago)
- Topics: haskell
- Language: Haskell
- Size: 45.9 KB
- Stars: 10
- Watchers: 20
- Forks: 1
- Open Issues: 3
-
Metadata Files:
- Readme: README.lhs
- Changelog: CHANGELOG.md
- License: LICENSE
Awesome Lists containing this project
README
directory-contents
==================
[](https://haskell.org) [](https://hackage.haskell.org/package/directory-contents) [](https://matrix.hackage.haskell.org/#/package/directory-contents) [](https://github.com/obsidiansystems/directory-contents/actions) [](https://github.com/obsidiansystems/directory-contents/blob/master/LICENSE)
Recursively list, operate on, and navigate the contents of a directory while
avoiding symlink loops.
Description
-----------
Modeled after the linux `tree` command (when invoked with the follow-symlinks
option), this module recursively lists the contents of a directory while
avoiding symlink loops. In particular, `tree -l` and `buildDirTree` should
provide the same result. See the documentation of `buildDirTree` for an
example.
In addition to building the directory-contents tree, this module provides
facilities for filtering, displaying, and navigating the directory hierarchy.
Example
-------
```haskell
>
> import Data.Foldable as F
> import Data.List
> import qualified Data.Text as T
> import System.Directory.Contents
> import System.Directory.Contents.Zipper
> import System.FilePath
>
> main :: IO ()
> main = do
```
Building a directory tree is easy. Just call `buildDirTree` on a path of your
choice. It'll recursively enumerate the contents of the directories. If it
encounters symlinks, it'll follow those symlinks if it hasn't yet encountered
the target of the symlink. If it has, it'll store a reference to that
already-seen target.
```haskell
> mp <- buildDirTree "."
> case mp of
> Nothing -> putStrLn "Couldn't find that path."
> Just p -> do
```
Once you've got a `DirTree` you can fmap, traverse, filter, or
[wither](https://hackage.haskell.org/package/witherable-class) it to transform
it however you like.
Note that the filtering operations generally do not remove empty directories.
You have to call `pruneDirTree` to do that.
```haskell
> let f = pruneDirTree =<< filterDirTree ((`elem` [".hs", ".lhs"]) . takeExtension) p
> putStrLn $ case f of
> Nothing -> "No haskell source files found."
> Just hs -> unlines
> [ "Paths that contain haskell source files:"
> , T.unpack $ drawDirTree hs
> , ""
> , "Haskell source files:"
> , intercalate ", " $ F.toList hs
> ]
```
You can also use the provided `DirZipper` to browse your directory hierarchy and make
changes wherever you like.
```haskell
> let printFocused = maybe
> (putStrLn "Couldn't find navigation target")
> (printDirTree . focused)
>
> putStrLn "Navigating down to src/System/Directory:"
> printFocused $
> downTo "Directory" =<< downTo "System" =<< downTo "src" (zipped p)
>
> putStrLn "Navigating using a path containing \"..\":"
> printFocused $
> followRelative "./src/../src/System/Directory" (zipped p)
>
> putStrLn "Removing the src/System directory. The src folder is now empty"
> putStrLn "(note that this doesn't change the actual files):"
> printFocused $
> remove =<< followRelative "./src/System" (zipped p)
>
```