The uu-parsing library support every ata type that is an instance of
Data.Listlike
(http://hackage.haskell.org/packages/archive/ListLike/3.0.1/doc/html/Data-ListLike.html#t:ListLike)
and thus input from Data.Bytestring.Lazy.
A very small starting program can be found below. Note that here we a
I do the same, but using iteratee and attoparsec-iteratee.
Best,
--Nick
On 2011 Mar 11, at 07:51 EST, Felipe Almeida Lessa wrote:
> On Fri, Mar 11, 2011 at 8:11 AM, Ketil Malde wrote:
>> I use binary <0.5 (later versions can no longer read a list of items
>> lazily. I believe attoparsec has th
On Fri, Mar 11, 2011 at 8:11 AM, Ketil Malde wrote:
> I use binary <0.5 (later versions can no longer read a list of items
> lazily. I believe attoparsec has the same restriction.)
You can define a parser for one item using attoparsec and then get all
items using an enumerator with attoparsec-en
"Skeptic ." writes:
> I finally have an opportunity to learn Haskell (I'm a day-to-day Java
> programmer, but I'm also at ease with Scheme), parsing a huge (i.e. up
> to 50 go) binary file. The encoding is very stable, but it's not a
> flat struct array (i.e. it uses flags).
I use binary <0.5 (
ppk:
> On Thu, Mar 10, 2011 at 10:36:27AM -0500, Skeptic . wrote:
> >
> >
> > Hi,
>
> > I finally have an opportunity to learn Haskell (I'm a day-to-day
> > Java programmer, but I'm also at ease with Scheme), parsing a huge
> > (i.e. up to 50 go) binary file. The encoding is very stable, but
> >
On Thu, Mar 10, 2011 at 10:36:27AM -0500, Skeptic . wrote:
>
>
> Hi,
> I finally have an opportunity to learn Haskell (I'm a day-to-day
> Java programmer, but I'm also at ease with Scheme), parsing a huge
> (i.e. up to 50 go) binary file. The encoding is very stable, but
> it's not a flat struct
Hi,
I finally have an opportunity to learn Haskell (I'm a day-to-day Java
programmer, but I'm also at ease with Scheme), parsing a huge (i.e. up to 50
go) binary file. The encoding is very stable, but it's not a flat struct array
(i.e. it uses flags).
Different outputs (i.e. text files) will