any idea what could be causing this error when i add the -fvia-C option
/tmp/ghc32300_0/ghc32300_0.hc:6:23:
error: SFMT_wrap.h: No such file or directory
make: *** [release] Error 1
I am also passing these options:
-O2 -fexcess-precision -funbox-strict-fields -fglasgow-exts
-fbang-patterns
aeyakovenko:
any idea what could be causing this error when i add the -fvia-C option
/tmp/ghc32300_0/ghc32300_0.hc:6:23:
error: SFMT_wrap.h: No such file or directory
make: *** [release] Error 1
I am also passing these options:
-O2 -fexcess-precision -funbox-strict-fields
When compiling something linked against the mersenne random package?
yes, does it not work with fvia-C?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Wed, 2008-06-11 at 23:50 -0700, Anatoly Yakovenko wrote:
any idea what could be causing this error when i add the -fvia-C option
/tmp/ghc32300_0/ghc32300_0.hc:6:23:
error: SFMT_wrap.h: No such file or directory
make: *** [release] Error 1
Some package you're using is a FFI binding
On Thu, 2008-06-12 at 00:07 -0700, Don Stewart wrote:
aeyakovenko:
any idea what could be causing this error when i add the -fvia-C option
/tmp/ghc32300_0/ghc32300_0.hc:6:23:
error: SFMT_wrap.h: No such file or directory
make: *** [release] Error 1
I am also passing these
On Wed, 11 Jun 2008, Isaac Dupree wrote:
extractHead is an ugly name for a nevertheless standardish-meaning
function... what is it usually called? uncons? headTail? (Data.Sequence,
which is meant to be left-right symmetric, calls it viewr... except your
version doesn't have the Maybe, it's
On Wed, 11 Jun 2008, Thomas M. DuBuisson wrote:
Why is there no mapAccumL' (strict)? Just a library deficiency that we
can remedy or am I missing something?
The strictness in foldl' is needed to avoid that unevaluated computations
accumulate until the end of the list. In mapAccumL and
Hello
I'm working with large DTDs from http://www.recordare.com/dtds/,
particulary partwise.dtd and timewise.dtd.
I check these DTDs with some tools, like Altova XML Spy and Microsoft
Visual Studio, and DTDs are valid.
However Validate tool from HaXML doesn't validate same DTDs.
Result from
On Wed, Jun 11, 2008 at 08:56:17PM -0400, Isaac Dupree wrote:
Stephan Friedrichs wrote:
I've implemented Chris Okasaki's random-access list[1] which provides
typical list operations (cons, head, tail) in O(1) and yet offers
indexed random-access in O(log n). It's uploaded on hackage[2].
Hello,
I have the same problems. I believe I sent Malcolm some patches. If
not, look here:
http://peteg.org/haskell/HaXml/
I am away from my laptop right now so I cannot readily tell you
whether a darcs get will do the job. In any case, there is a bug in
the DTD parser that is easily fixed.
Duncan Coutts wrote:
Don, this does not work:
includes: SFMT.h SFMT_wrap.h
install-includes: SFMT.h
Sorry, that was my fault.
(It does work with ghc 6.9, but that's not much of an excuse)
Bertram
___
Haskell-Cafe mailing list
Henning Thielemann wrote:
On Wed, 11 Jun 2008, Isaac Dupree wrote:
extractHead is an ugly name for a nevertheless standardish-meaning
function... what is it usually called? uncons? headTail?
(Data.Sequence, which is meant to be left-right symmetric, calls it
viewr... except your version
On Thu, 12 Jun 2008, Isaac Dupree wrote:
Henning Thielemann wrote:
On Wed, 11 Jun 2008, Isaac Dupree wrote:
extractHead is an ugly name for a nevertheless standardish-meaning
function... what is it usually called? uncons? headTail? (Data.Sequence,
which is meant to be left-right
Henning Thielemann wrote:
On Thu, 12 Jun 2008, Isaac Dupree wrote:
Henning Thielemann wrote:
On Wed, 11 Jun 2008, Isaac Dupree wrote:
extractHead is an ugly name for a nevertheless standardish-meaning
function... what is it usually called? uncons? headTail?
(Data.Sequence, which is meant
Isaac Dupree wrote:
[...]
Great to see it, it deserved implementing, IIRC! I don't remember
enough about it.. (and don't have Okasaki anywhere handy). Can it be
lazy or infinitely long?
No, it has to be finite as it's actually a list of complete binary trees
whose size depend on the skew
2008/6/12 Stephan Friedrichs [EMAIL PROTECTED]:
For index, don't use Monad, use Maybe (I think that's what the recent
[EMAIL PROTECTED] discussion concluded, in the context of switching
Data.Map back to Maybe).
I was just copying the idea from Data.Map and it's usually a good thing to
have
Hi all,
I downloaded cabal-install and the cabal-1.4 branch from darcs. The following
error occurs when building:
runhaskell Setup.hs build
Building cabal-install-0.4.9...
[19 of 27] Compiling Hackage.SrcDist ( Hackage/SrcDist.hs,
dist/build/cabal/cabal-tmp/Hackage/SrcDist.o )
Could you try the cabal-1.4 package just put up on hackage.haskell.org?
aditya_siram:
Hi all,
I downloaded cabal-install and the cabal-1.4 branch from darcs. The following
error occurs when building:
runhaskell Setup.hs build
Building cabal-install-0.4.9...
[19 of 27] Compiling
Chaddaï Fouché wrote:
Given that this structure isn't lazy enough, I really don't see a
problem with using Int (any random access list with a size that needs an
Integer would blow the memory anyway...).
Bad way to think about things. The implications of using Int as the
result type of a
Chris Smith wrote:
Chaddaï Fouché wrote:
Given that this structure isn't lazy enough, I really don't see a
problem with using Int (any random access list with a size that needs an
Integer would blow the memory anyway...).
Bad way to think about things. The implications of using Int as the
On Thu, 2008-06-12 at 16:07 -0500, Aditya Siram wrote:
Hi all,
I downloaded cabal-install and the cabal-1.4 branch from darcs. The following
error occurs when building:
runhaskell Setup.hs build
Building cabal-install-0.4.9...
[19 of 27] Compiling Hackage.SrcDist ( Hackage/SrcDist.hs,
Cafe,
Daniel Larsson noticed a correctness issue with the pureMD5 package.
This issue would affect you if you built the value incrementally via the
'updateMD5' function (vs just using 'md5') and didn't provide 512 bit
long bytestrings (an MD5 block of operation).
As you can probably tell, I
22 matches
Mail list logo
