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.

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

Versions [RSS] 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) [details]
License BSD-3-Clause
Author Riuga
Maintainer n/a
Category Data
Home page https://github.com/riugabachi/describe
Source repo head: git clone https://github.com/RiugaBachi/describe.git
Uploaded by riuga at 2019-10-07T02:06:57Z
Distributions NixOS:0.4.0.5
Downloads 5805 total (13 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]