Hi,
I have now tuned Josh Goldfoot's code without changing the order in which the
magic squares are produced, for a 5x5 magic square, my machine took about 1
1/2 hours and used 2Mb memory (considering that the original code did not
finish within 4 1/2 hours here, that should push time on the
Is there anyone trading with Haskell or interested in doing it?
Thanks, Joel
--
http://wagerlabs.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I want your feedback..
The purpose of this program is to get the files/ directories you know faster.
Put this into your .bashrc:
Of course you have to adjust the executable filename.
= .bashrc ==
alias F='/usr/bin/hquickfile'
Does anyone have bindings for HDF5 [1]?
[1] http://hdf.ncsa.uiuc.edu/whatishdf5.html
Thanks, Joel
--
http://wagerlabs.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
And a related question... Would there be an advantage in using lazy
byte strings or Bulat's streams library over HDF5? There's a good
performance review [1] of PyTables (thin wrapper on top of HDF5) vs.
SqlLite that I just read and it made me wonder.
I'm looking to model the trading
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Daniel,
I have now tuned Josh Goldfoot's code without changing the order in
which the
magic squares are produced, for a 5x5 magic square, my machine took
about 1
1/2 hours and used 2Mb memory (considering that the original code
did not
finish
Hello Joel,
Tuesday, July 4, 2006, 7:49:02 PM, you wrote:
Does anyone have bindings for HDF5 [1]?
[1] http://hdf.ncsa.uiuc.edu/whatishdf5.html
isn't it better to use sql database?
http://haskell.org/haskellwiki/Libraries_and_tools/Database_interfaces
--
Best regards,
Bulat
On 7/3/06, Thiago Arrais [EMAIL PROTECTED] wrote:
EclipseFP is being written in Java, I wonder how the GHC
library would be accessed on such a environment.
The York Haskell Compiler (yhc) compiles to bytecode, and my memory
suggests that there was an implementation of the required runtime
Hi
The York Haskell Compiler (yhc) compiles to bytecode, and my memory
suggests that there was an implementation of the required runtime
system written in Java. My mail archive confirms this: Neil Mitchell
wrote about it on haskell-cafe on March 28 under the topic of
'Haskell's Market'.
It
On Jul 4, 2006, at 6:29 PM, Bulat Ziganshin wrote:
isn't it better to use sql database?
Not necessarily but it's better to start simple. I'll try SQLlite first.
--
http://wagerlabs.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Iain Alexander wrote:
Another suggestion:
Put your strings in an ordered binary tree (other data structures
might also work here).
Make your Atom an encoding of the structure of the tree (resp. other
structure). This is logically a sequence of bits, 0 for left (less
than), 1 for right
Brian Hulley wrote:
Iain Alexander wrote:
Another suggestion:
Put your strings in an ordered binary tree (other data structures
might also work here).
Make your Atom an encoding of the structure of the tree (resp. other
structure). This is logically a sequence of bits, 0 for left (less
Simon Peyton-Jones wrote:
Concerning other mail on this subject, which has been v useful, I've
revised the Wiki page (substantially) to take it into account.
http://hackage.haskell.org/trac/ghc/wiki/GhcPackages
Further input (either by email or by adding material to the Wiki)
would be welcome.
Am Dienstag, 4. Juli 2006 18:20 schrieben Sie:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Daniel,
I have now tuned Josh Goldfoot's code without changing the order in
which the
magic squares are produced, for a 5x5 magic square, my machine took
about 1
1/2 hours and used 2Mb
Brian Hulley wrote:
Simon Peyton-Jones wrote:
http://hackage.haskell.org/trac/ghc/wiki/GhcPackages
I think the following is a non-question:
An open question: if A.B.C is in the package being compiled,
and in an exposed package, and you say import A.B.C,
do you get an error
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Jul 4, 2006, at 5:20 PM, Daniel Fischer wrote:
I would propose modifying the other entries (since there are only a
handful) to match the output of your original solution.
What do you think?
Cool, though the problem of exploding runtime
16 matches
Mail list logo
