2008/10/24 Donnie Jones <[EMAIL PROTECTED]>:
> Hello Krasimir,
>
> There is also the xml package from Galois:
> http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xml
That looks nice. Are there any examples of its usage?
--vk
___
Haskell maili
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
David F. Place wrote:
> I've used HaXml's SAX parser to parse huge XML files. It is surprising
> that HXT doesn't seem to have a SAX parser as I understand that it is
> the successor to HaXml. DOM style parsing won't work with huge files.
It can wi
I've used HaXml's SAX parser to parse huge XML files. It is
surprising that HXT doesn't seem to have a SAX parser as I understand
that it is the successor to HaXml. DOM style parsing won't work
with huge files.
http://hackage.haskell.org/packages/archive/HaXml/1.19/doc/html/Text-
XML-Ha
Hi Michael,
You need a functional depenency in the class to make this work. Something like
class MakeAExp a s | a -> s where
makeAExp :: a -> AExp s
should work, although I haven't tested it with your code.
I did actually extend my FD constraint solver with arithmetic
constraints myself, b
Hello Krasimir,
There is also the xml package from Galois:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xml
Hope that helps.
__
Donnie
2008/10/23 Krasimir Angelov <[EMAIL PROTECTED]>
> Hi,
>
> Does some one have made performance tests on the different XML libraries
> for Haskell
Michael Marte <[EMAIL PROTECTED]> wrote in article <[EMAIL PROTECTED]> in
gmane.comp.lang.haskell.general:
> *FD> :type let x = (1::Int) in x #+ x #+ x
> let x = (1::Int) in x #+ x #+ x :: (MakeAExp (AExp s) s1) => AExp s1
>
> It appears to me that ghci generates two phantom types s and s1 and fa
I remember that HaXML has also a lazy XML parser. maybe if you just need to
use some specific information stored in your XML file you can earn some
time/memory with it.From my experience, HXT seems faster.
Cheers,
hugo
2008/10/23 Krasimir Angelov <[EMAIL PROTECTED]>
> Hi,
>
> Does some one have
Hi,
Does some one have made performance tests on the different XML libraries for
Haskell? I have a 20MB xml file that I want to read. I remember from my
earlier experiments (years ago) that all libraries were too slow and were
consuming too much memory. I hoped that this situation had changed but
Hello *,
I am trying to extend the finite-domain (FD) constraint solver proposed by
David Overton (http://overtond.blogspot.com/2008/07/pre.html) with arithmetic
constraints by means of an embedded DSL. In principle, this is a very natural
thing to do in a functional language; it is basically a
roconnor:
> http://hackage.haskell.org/cgi-bin/hackage-scripts/package/colour-0.0.0
>
> I hope for this library to become the standard colour library for Haskell.
> Most software does not properly blend colours because they fail to
> gamma-correct the colours before blending. Hopefully by using
10 matches
Mail list logo
