describe: Combinators for describing binary data structures

[ bsd3, data, library ] [ Propose Tags ]

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.

Versions [faq] 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.2.1, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3, 0.2.0.4, 0.2.0.5, 0.2.0.6, 0.3.0.0, 0.3.0.1, 0.3.1.0, 0.3.1.1, 0.4.0.0, 0.4.0.1, 0.4.0.2, 0.4.0.3, 0.4.0.4, 0.4.0.5
Change log CHANGELOG.md
Dependencies base (>=4.12.0.0 && <4.13), bytestring (>=0.10.8 && <0.11), cereal (>=0.5.8 && <0.6), fixed-vector (>=1.2.0 && <1.3), lens (>=4.18.1 && <4.19), mmorph (>=1.1.3 && <1.2), monad-control (>=1.0.2 && <1.1), mtl (>=2.2.2 && <2.3), profunctors (>=5.5.1 && <5.6), template-haskell, text (>=1.2.3 && <1.3), transformers (>=0.5.6 && <0.6) [details]
License BSD-3-Clause
Author Riuga
Maintainer Riuga
Category Data
Home page https://github.com/riugabachi/describe
Source repo head: git clone https://github.com/RiugaBachi/describe.git
Uploaded by riuga at Sat Feb 8 01:25:42 UTC 2020
Distributions NixOS:0.4.0.1
Downloads 2234 total (862 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees