homepage: https://github.com/kalhauge/dirtree#readme
changelog-type: ''
hash: f32982ed2a16253e0a5aa909cb02b1f073418b258c764d29663d812e6dec4abf
test-bench-deps:
  hspec-expectations-pretty-diff: -any
  base: ! '>=4.7 && <5'
  hspec: -any
  filepath: -any
  containers: -any
  lens: -any
  deepseq: -any
  hspec-discover: -any
  dirtree: -any
  directory: -any
maintainer: christian@kalhauge.dk
synopsis: A small library for working with directories.
changelog: ''
basic-deps:
  base: ! '>=4.7 && <5'
  filepath: -any
  containers: -any
  lens: -any
  deepseq: -any
  directory: -any
all-versions:
- 0.0.1
author: Christian Gram Kalhauge
latest: 0.0.1
description-type: markdown
description: |+
  # dirtree

  Dir tree is an small implementation of a directory tree much akin to
  [`directory-tree`](http://hackage.haskell.org/package/directory-tree),
  in contrast it uses F-algebras to store the tree for easy traversals and
  recursion.


license-name: MIT

Update from Hackage at 2019-06-06T22:44:32Z
Update from Hackage at 2019-06-06T22:44:32Z
