bytesmith: Nonresumable byte parser
Parse bytes as fast as possible. This is a nonresumable parser
that aggresively uses UnboxedSums to avoid performing any
allocations.
Modules
[Index] [Quick Jump]
Downloads
- bytesmith-0.3.6.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1.0.0, 0.2.0.0, 0.2.0.1, 0.3.0.0, 0.3.1.0, 0.3.2.0, 0.3.3.0, 0.3.4.0, 0.3.5.0, 0.3.6.0, 0.3.7.0, 0.3.8.0, 0.3.9.0, 0.3.9.1, 0.3.10.0, 0.3.11.0, 0.3.11.1 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.12 && <5), byteslice (>=0.1.4 && <0.3), bytestring (>=0.10.8 && <0.11), contiguous (>=0.4 && <0.6), primitive (>=0.7 && <0.8), run-st (>=0.1 && <0.2), text-short (>=0.1.3 && <0.2), wide-word (>=0.1.0.9 && <0.2) [details] |
| License | BSD-3-Clause |
| Copyright | 2019 Andrew Martin |
| Author | Andrew Martin |
| Maintainer | andrew.thaddeus@gmail.com |
| Category | Data |
| Home page | https://github.com/andrewthad/bytesmith |
| Bug tracker | https://github.com/andrewthad/bytesmith/issues |
| Uploaded | by andrewthad at 2020-03-04T19:27:18Z |
| Distributions | LTSHaskell:0.3.11.1, NixOS:0.3.11.1, Stackage:0.3.11.1 |
| Reverse Dependencies | 15 direct, 83 indirect [details] |
| Downloads | 8641 total (91 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2020-03-04 [all 1 reports] |