[Haskell-cafe] Fast parsing of unboxed values without boxing them in the parser?
ekirpichov at gmail.com
Tue Oct 23 05:26:17 CEST 2012
Are there any libraries that can be used for very fast parsing of
binary data into structures with unboxed fields?
The "naive" way, as implemented in Data.Binary etc, has the parsing
monad datatype (say, "Get a") be parametric in "a" and include a field
of type "a", which makes it impossible for a parser to return an
unboxed value (e.g. parse a word32 from a byte array).
I'm thinking that a CPS-style parser type could allow returning an
unboxed value as a result of the compiler inlining and fusing together
the parsing code and the code that consumes the parsed value.
Are there any libraries that work like this?
We're hiring! http://tinyurl.com/mirantis-openstack-engineer
More information about the Haskell-Cafe