homepage: https://github.com/riugabachi/describe
changelog-type: markdown
hash: 7f5a96f5fbd6ad724601ceb4556a3483113b79cd8e2776e977b11bc2ab14c261
test-bench-deps:
  cereal: ! '>=0.5.8 && <0.6'
  bytestring: ! '>=0.10.8 && <0.11'
  base: ^>=4.12.0.0
  describe: -any
  QuickCheck: -any
maintainer: n/a
synopsis: Combinators for describing binary data structures
changelog: |
  # Revision history for describe

  ## 0.1.0.0 -- 2019-06-03

  * Initial release.
basic-deps:
  cereal: ! '>=0.5.8 && <0.6'
  bytestring: ! '>=0.10.8 && <0.11'
  base: ^>=4.12.0.0
all-versions:
- 0.1.0.0
author: Riuga
latest: 0.1.0.0
description-type: haddock
description: Combinators for describing binary data structures, which eliminate the
  boilerplate of having to write isomorphic Get and Put instances. Please see the
  Github page for examples.
license-name: BSD-3-Clause

homepage: https://github.com/riugabachi/describe
changelog-type: markdown
hash: 5ab8be078d533709289a168efd64efab9d8d90068836de4ac0fe4da197c046e8
test-bench-deps:
  cereal: ! '>=0.5.8 && <0.6'
  bytestring: ! '>=0.10.8 && <0.11'
  base: ^>=4.12.0.0
  describe: -any
  QuickCheck: -any
maintainer: n/a
synopsis: Combinators for describing binary data structures
changelog: |
  # Revision history for describe

  ## 0.1.1.0 -- 2019-09-05

  * Added Monad instance for Descriptor

  ## 0.1.0.0 -- 2019-06-03

  * Initial release.
basic-deps:
  cereal: ! '>=0.5.8 && <0.6'
  bytestring: ! '>=0.10.8 && <0.11'
  base: ^>=4.12.0.0
all-versions:
- 0.1.0.0
- 0.1.1.0
author: Riuga
latest: 0.1.1.0
description-type: haddock
description: Combinators for describing binary data structures, which eliminate the
  boilerplate of having to write isomorphic Get and Put instances. Please see the
  Github page for examples.
license-name: BSD-3-Clause

Update from Hackage at 2019-09-05T15:07:04Z
Update from Hackage at 2019-09-05T15:07:04Z
