describe: Combinators for describing binary data structures
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.
Modules
[Index] [Quick Jump]
Downloads
- describe-0.2.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
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 |
| Uploaded | by riuga at 2019-10-07T01:30:29Z |
| Category | Data |
| Home page | https://github.com/riugabachi/describe |
| Source repo | head: git clone https://github.com/RiugaBachi/describe.git |
| Downloads | 7058 total (76 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] |