Achim Schneider wrote:
wren ng thornton w...@freegeek.org wrote:
(b) allows
instances to have a fixed type for keys (like Data.Trie and
Data.IntMap have),
Can't we do some type magic to automagically select Data.Trie if the
key is a (strict) bytestring?
Uh, sure. I was thinking more
Neil Mitchell wrote:
Hi
1) Show all the functions (when the number is low), but place platform
specific functions under separate headers: Windows,
Linux/BSD/POSIX, OS X, etc.
If a function isn't available on all OS's then all Hoogle would be
encouraging you to do is break compatibility
Hi Neil,
Neil Mitchell wrote:
If a function isn't available on all OS's then all Hoogle would be
encouraging you to do is break compatibility and stop me from using
your software. If a function is only available on one OS you will
certainly have to deliberately choose to search for that, and it
On Sat, Feb 21, 2009 at 11:55 AM, Martijn van Steenbergen
mart...@van.steenbergen.nl wrote:
How about allowing an extra search flag +windows that reveals
windows-specific APIs? Likewise for other OS's.
Being able to enable API for a specific package requires me knowing in what
package I want
Bulat Ziganshin ha scritto:
[...]
but problem - not mine, but for haskellers, is that some people said
that ghc can generate code that is as fast as gcc one. it will be
stupid if someone will start to write say mpeg4 codec and after year
of work will find that it need 100 Ghz cpu to work.
On Sat, Feb 21, 2009 at 01:18:35AM +0100, Martijn van Steenbergen wrote:
You now need to specify the exact type of the exception you wish to
catch. For example, to catch any exception:
action `catch` (\(e :: SomeException) - handler)
For more information, see:
Most people in the games industry that I knew don't even know haskell. they
are trained imperative hackers.
However tim sweeney studies haskell, so it cetainly has influenced at least
one well known game developer.
But I wasn't saying that Haskell *is* used, I said one could use it for
I think the (valid) concern is that too many people are choosing
platform-specific packages when there are alternatives available
(albeit not as convenient in some cases), and this really hurts the
Windows community because Windows is so radically different from all
the other operating
nothing should stop you from writing video games in Haskell since
video codec isn't video game :)))
ouch, mea culpa, I misread your message.
but I've worked with people that wrote physics engines in C/C++,
and they also had to hand optimize specifically for a certain compiler to
get
Hi, I copied the program below from a reddit post of dons'. I have a dual
core laptop with ubuntu hardy and ghc 6.10.1. I can see the difference when
I run the program with +RTS -N2 but CPU always says 100%. I'd like an
example that shows 100 -- is it not showing 100 because of my timeformat
or
Hi Wolgang,
On Wed, Feb 18, 2009 at 12:53:23 +0100, Wolfgang Jeltsch wrote:
What do you mean with “something which will make it much easier for third
parties to write a GUI in the future”?
Kari's example of GUI-friendly optimisations might be one thought.
More generally, I was thinking of
Hello Jim,
Saturday, February 21, 2009, 6:17:54 PM, you wrote:
main = a `par` b `par` c `pseq` print (a + b + c)
two things:
1) that are grouping order? may be,
a `par` (b `par` (c `pseq` print (a + b + c))) ?
2) i recommend you to use 2 *same* computations.
otherwise, it's easily possible
Jim, I'm actually not sure that time will report greater than 100% cpu
on ubuntu hardy. (really not sure, and don't have it available right
this moment to check). I would however try making a computation that
will take a little longer and use the system monitor or /proc to look
at your CPU usage
On Sat, Feb 21, 2009 at 12:17 PM, Jim Burton j...@sdf-eu.org wrote:
$ time ./Par +RTS -N2
1405006117752879898543142606244511569936384005711076
1.504 real,2.316 user,0.016 sys, 100.00 cpu
I don't know why it is only 100%, but you can see that the user time
is greater than real time, so
Jeff Heard wrote:
Jim, I'm actually not sure that time will report greater than 100% cpu
on ubuntu hardy. (really not sure, and don't have it available right
this moment to check). I would however try making a computation that
will take a little longer and use the system monitor or /proc
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090221
Issue 106 - February 21, 2009
---
Welcome to issue 106 of HWN, a newsletter covering
Hello, communion people!
I have a problem and ask for an advice.
I'm dealing with sockets on *Linux* platform (Network.Socket). The problem
is that I can't fully control timeout for (connect :: Socket - SockAddr -
IO ()) operation.
On my system the timeout is - 3 seconds - I want to be able to
I've been experimenting with the state monad and with StateT, and
have some questions about how to combine one state with another.
This email is literate Haskell tested on GHCi, version 6.10.1. Also,
sigfpe's post on monad transformers (http://blog.sigfpe.com/2006/05/
Hi all,
I liked Brian O'Sullivan's blog post on twitter
(http://www.serpentine.com/blog/2008/12/05/functional-programmers-on-twitter/),
so I moved the Haskell subset of his list (along with a couple of
additions) onto the haskell wiki, to make it easier for people to
update. You can find the page
Oh I've again sent mail to wrong address
-- Forwarded Message --
On Saturday 21 February 2009 02:42:11 you wrote:
On Sat, Feb 21, 2009 at 12:22 AM, Bulat Ziganshin
bulat.zigans...@gmail.com
wrote:
Hello Khudyakov,
Saturday, February 21, 2009, 2:07:39 AM, you wrote:
Hello Khudyakov,
Sunday, February 22, 2009, 12:58:59 AM, you wrote:
you could even pass it in a test data set to which it must be optimized;
after the program is compiled, the compiler runs and profiles it, measures
the results, and does another pass to make it faster.
it supported in gcc4
Hello Louis,
Saturday, February 21, 2009, 4:16:10 AM, you wrote:
In the meantime, a brief summary:
a minor correction: the best gcc result shown in the thread was 50x
faster than Don's one, so you need to miltiple all ratios by a factor
of 50
Straightforward and simple Haskell code, written
Observation:
The best gcc result shown in the thread, if I recall, precomputed the result
of the full computation at compiletime and simply outputted it, when we
looked at the assembly.
While I will accept that this could be seen as an optimization GHC should
have made, I do not accept that this
Am Sonntag, 22. Februar 2009 00:21 schrieb Bulat Ziganshin:
Hello Louis,
Saturday, February 21, 2009, 4:16:10 AM, you wrote:
In the meantime, a brief summary:
a minor correction: the best gcc result shown in the thread was 50x
faster than Don's one, so you need to miltiple all ratios by a
Hello Louis,
Sunday, February 22, 2009, 2:30:23 AM, you wrote:
yes, you are right. Don also compared results of 64x-reduced
computation with full one. are you think that these results are more
fair?
Observation:
The best gcc result shown in the thread, if I recall, precomputed
the result of
On Sat, Feb 21, 2009 at 3:33 PM, Luis O'Shea los...@gmail.com wrote:
I've been experimenting with the state monad and with StateT, and have some
questions about how to combine one state with another.
snip
test3 :: Monad m = String - StateT Integer m String
test3 s = do
modify (+ 1)
a -
Hello Daniel,
Sunday, February 22, 2009, 2:36:57 AM, you wrote:
You're referring to the freak result of Dan Doel?
Come on, be serious, please. I have a Haskell result that runs in 7ms, too.
Just use a rewrite rule and hey presto :)
Dan, why you have not said the same about test where ghc
I said nothing about fairness, and *never at any point said I thought Don's
results were more useful or fair.* What makes you think that's what I meant
to imply?
You have not responded to my separate concern that
For code that actively requires computation at runtime, I have seen
no examples
On Sat, Feb 21, 2009 at 11:35 PM, Bulat Ziganshin bulat.zigans...@gmail.com
wrote:
Hello Louis,
Sunday, February 22, 2009, 2:30:23 AM, you wrote:
yes, you are right. Don also compared results of 64x-reduced
computation with full one. are you think that these results are more
fair?
Yes.
On Sat, Feb 21, 2009 at 01:54:52PM +, Ian Lynagh wrote:
On Sat, Feb 21, 2009 at 01:18:35AM +0100, Martijn van Steenbergen wrote:
You now need to specify the exact type of the exception you wish to
catch. For example, to catch any exception:
action `catch` (\(e :: SomeException) -
Sebastian, that's not Bulat's point. He's saying that if we make that
optimization in Haskell, we should at least make the same optimization in
GCC for fair comparison. (Though I'm not entirely sure that that
optimization would be of any use to GCC, but that's a linguistic concern, no
more.)
http://haskell.org/haskellwiki/Protect_the_community
Random notes on how to maintain tone, focus and productivity in an
online community I took a few years ago.
Might be some material there if anyone's seeking to help ensure
we remain a constructive, effective community.
-- Don
P.S. release
No, he asked if comparing the D64 version with the straight gcc one was
more fair then comparing a version that precomputes the result with one
that doesn't. That's what I responded to.
On Sat, Feb 21, 2009 at 11:59 PM, Louis Wasserman wasserman.lo...@gmail.com
wrote:
Sebastian, that's not
Am Sonntag, 22. Februar 2009 00:50 schrieb Bulat Ziganshin:
Hello Daniel,
Sunday, February 22, 2009, 2:36:57 AM, you wrote:
You're referring to the freak result of Dan Doel?
Come on, be serious, please. I have a Haskell result that runs in 7ms,
too. Just use a rewrite rule and hey presto
Hello Sebastian,
Sunday, February 22, 2009, 2:55:38 AM, you wrote:
yes, you are right. Don also compared results of 64x-reduced
computation with full one. are you think that these results are more
fair?
Yes. Clearly so.
It still computes the result from scratch - it just uses a trick
I tried to compile the template Haskell loop unrolling trick from Claus
Reinke on my machine which is running Windows and GHC 6.10.1, and I got
linker errors.
(note that compiling *without* -fvia-C works fine)
Compiling under Cygwin did not solve it. Any ideas how I could get this
working? I have
Missing --make
bugfact:
I tried to compile the template Haskell loop unrolling trick from Claus Reinke
on my machine which is running Windows and GHC 6.10.1, and I got linker
errors.
c:\tempghc -O2 -fvia-C -optc-O3 -fforce-recomp Apply.hs
Apply.o:ghc6140_0.hc:(.text+0x7d): undefined
I JUST FOUND OUT...SILLY ME!!! ;-)
On Sun, Feb 22, 2009 at 1:13 AM, Don Stewart d...@galois.com wrote:
Missing --make
bugfact:
I tried to compile the template Haskell loop unrolling trick from Claus
Reinke
on my machine which is running Windows and GHC 6.10.1, and I got linker
On Sun, Feb 22, 2009 at 12:10 AM, Bulat Ziganshin bulat.zigans...@gmail.com
wrote:
Hello Sebastian,
Sunday, February 22, 2009, 2:55:38 AM, you wrote:
yes, you are right. Don also compared results of 64x-reduced
computation with full one. are you think that these results are more
Hello Louis,
Sunday, February 22, 2009, 2:59:05 AM, you wrote:
Sebastian, that's not Bulat's point. He's saying that if we make
that optimization in Haskell, we should at least make the same
optimization in GCC for fair comparison. (Though I'm not entirely
sure that that optimization would
Bulat, you've some serious lessons to learn on how to interact with
online communities. First,
1. Stop posting replies to every post on this thread
2. Read some of the fine literature on how to be a productive,
contributing member of a mailing list community,
Bulat,
Thank you for being productive. =)
of course these results are useful! my own goal was just to make fair
comparison. i'm bothered when people said that ghc should be used
for something like video codecs based on those let's optimize only
for haskell pseudo-benchmarks. if Don was omitted
It's not practical at all. It's monstrously more complicated than C.
It would be much simpler to do it in C and use FFI.
Regards,
John A. De Goes
N-BRAIN, Inc.
The Evolution of Collaboration
http://www.n-brain.net|877-376-2724 x 101
On Feb 21, 2009, at 4:55 PM, Sebastian Sylvan
I think this thread has stopped being useful and started going round in
circles, so I've blocked all messages to it and...
On Sat, Feb 21, 2009 at 04:28:21PM -0800, Donald Bruce Stewart wrote:
I'm setting your moderation bit now
...reverted this.
Thanks
Ian
Cool!
Does an overview exists of what can be done with wxFruit versus Yampa?
E.g. Yampa has many switchers (up to the amazing dpSwitch). Does wxFruit
support switching?
For what I can read at
http://www.cs.uu.nl/wiki/pub/Afp0607/DomainSpecificLanguages/fruit.pdf
wxFruit (by Bart Robinson and
Hi,
The code below compiles fine as it is, but if I change the import statement
to:
import Data.Array.Unboxed
I get the following error:
philip-beadlings-imac-g5:MonteCarlo phil$ ghc -O2 --make test.hs
[2 of 5] Compiling InverseNormal( InverseNormal.hs, InverseNormal.o )
2009/2/21 Phil pbeadl...@mail2web.com:
InverseNormal.hs:28:38:
No instance for (IArray a1 Double)
arising from a use of `!' at InverseNormal.hs:28:38-40
Possible fix: add an instance declaration for (IArray a1 Double)
In the first argument of `(*)', namely `c ! 1'
In
Thanks for the tip - I got it to work using:
a :: UArray Int Double
And so on.
Cheers,
Phil.
On 22/02/2009 01:05, Felipe Lessa felipe.le...@gmail.com wrote:
2009/2/21 Phil pbeadl...@mail2web.com:
InverseNormal.hs:28:38:
No instance for (IArray a1 Double)
arising from a
On Sat, Feb 21, 2009 at 10:26 PM, Phil pbeadl...@mail2web.com wrote:
Thanks for the tip - I got it to work using:
a :: UArray Int Double
And so on.
That's nice. I should have noted as well that you may say just
a, b, c, d :: UArray Int Double
or, even better,
type DataArray = UArray
On Sat, 2009-02-21 at 07:25 -0700, John A. De Goes wrote:
I think the (valid) concern is that too many people are choosing
platform-specific packages when there are alternatives available
(albeit not as convenient in some cases), and this really hurts the
Windows community because
On Sat, Feb 21, 2009 at 5:37 PM, David Menendez d...@zednenem.com wrote:
PS. Here are two functions that I ended up not using in my examples,
but which may come in handy when dealing with nested applications of
StateT:
curryStateT :: (Monad m) = StateT (s,t) m a - StateT s (StateT t m) a
Maybe because one Haskeller generally tries to help another one.
That's what what it means to be a community, no?
Regards,
John A. De Goes
N-BRAIN, Inc.
The Evolution of Collaboration
http://www.n-brain.net|877-376-2724 x 101
On Feb 21, 2009, at 6:47 PM, Jonathan Cast wrote:
On
Don Stewart d...@galois.com wrote:
http://haskell.org/haskellwiki/Protect_the_community
Random notes on how to maintain tone, focus and productivity in an
online community I took a few years ago.
Might be some material there if anyone's seeking to help ensure
we remain a constructive,
John A. De Goes:
I think the (valid) concern is that too many people are choosing
platform-specific packages when there are alternatives available
(albeit not as convenient in some cases), and this really hurts the
Windows community because Windows is so radically different from all
the other
I'd like to announce the 0.2.* series release of the X Haskell
Bindings. This release, like the prior 0.1.* series focuses on making
the API prettier. This does mean that there's a good chance this is a
breaking release. Also, 0.2.* is based on the just-released version
1.4 of the XML
aslatter:
I'd like to announce the 0.2.* series release of the X Haskell
Bindings. This release, like the prior 0.1.* series focuses on making
the API prettier. This does mean that there's a good chance this is a
breaking release. Also, 0.2.* is based on the just-released version
1.4 of
On Sun, Feb 22, 2009 at 2:08 AM, Antoine Latter aslat...@gmail.com wrote:
The goal of XHB is to provide a Haskell implementation of the X11 wire
protocol, similar in spirit to the X protocol C-language Binding
(XCB).
[snip]
Related projects:
X C Bindings: http://xcb.freedesktop.org/
I
57 matches
Mail list logo
