Does not compiles under ghc 7.6.2
Date: Sat, 13 Apr 2013 11:09:13 +0800
From: m...@nh2.me
To: k...@iij.ad.jp
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] ANN: psqueue-benchmarks - benchmarks of priority
queue implementations
I actually found a (potential) problem with the GHC
Corrected, little bit slower on 64 bit but much faster on 32 bit version.(also
made hashmap grow from small default size as it is becnh
req)http://benchmarksgame.alioth.debian.org/u32q/program.php?test=knucleotidelang=ghcid=228
secs for 32
I have posted previous knucleotide program, it is fast on 64 bit butvery slow
on 32 bit.I cannot install 32 bit ghc to test it so I can only guess is
thatcause is use of Int64 for hash and HashMap array indexing.What bothers me
is that it that much slower , and I guessthat array indexing of 64
I have posted this version.Mad home grown HashMap and replaced IOref with
Ptr.This made program twice as fast as current entry.
{-# Language BangPatterns #-} The Computer Language Benchmarks Game--
http://benchmarksgame.alioth.debian.org/ Contributed by Branimir
Maksimovic--import
/ Contributed by Branimir
Maksimovic--import Data.Bitsimport Data.Charimport Data.Intimport
Data.Listimport Data.IORefimport Data.Array.Unboxedimport Data.Array.Baseimport
qualified Data.HashTable.IO as Himport Data.Hashableimport qualified
Data.ByteString.Char8 as Simport Control.Concurrentimport
current
haskell entry , I would post it , otherwise no point,except that program is
shorter and not low level.
{-# Language BangPatterns #-} The Computer Language Benchmarks Game--
http://benchmarksgame.alioth.debian.org/ Contributed by Branimir
Maksimovic--import Data.Charimport
I have placed constraint on version of hashable, time is exactly
same.bmaxa@maxa:~/shootout/knucleotide$ cabal list hashable* hashable
Synopsis: A class for types that can be converted to a hash valueDefault
available version: 1.2.0.5Installed versions: 1.1.2.5Homepage:
Subject: Re: [Haskell-cafe] Streaming bytes and performance
On 03/20/2013 12:47 AM, Branimir Maksimovic wrote:
Your problem is that main_6 thunks 'i' and 'a' .
If you write (S6 !i !a) - get
than there is no problem any more...
Nope :( Unfortunately that doesn't change anything. Still
To: haskell-cafe@haskell.org
From: to.darkan...@gmail.com
Date: Tue, 19 Mar 2013 23:27:09 +0200
Subject: Re: [Haskell-cafe] Streaming bytes and performance
On 03/19/2013 10:49 PM, Konstantin Litvinenko wrote:
{-# LANGUAGE BangPatterns #-}
import Control.Monad.State.Strict
data
In C usual way is to set some bit in integer variable by shifting or oring,and
than check flag integer variable by anding with particular flag value.What is
Haskell way?
Thanks. ___
Haskell-Cafe mailing list
ByteString gains most improvements as String must be converted o CStringfirst,
internaly, in regex (this is warpper for libpcre), while ByteString not.libpcre
is much faster than posix (I guess posix is also wrapper).Interface for libpcre
is same as for Posix, there is no real effortin
Here is haskell version that is faster than python, almost as fast as c++.You
need to install bytestring-lexing package for readDouble.
bmaxa@maxa:~/haskell$ time ./printMatrixDecay - output.txtread 16384 matrix
elements (128x128 = 16384)[0.00e0, 1.00e-8) = 0 (0.00%) 0[1.00e-8, 1.00e-7) = 0
Heh, I have wrote c++ version and that is much faster than python ;)
bmaxa@maxa:~/haskell$ time ./createMatrixDump.py -N 128 output.txt
real0m0.041suser0m0.040ssys 0m0.000sbmaxa@maxa:~/haskell$ time
./printMatrixDecay.py - output.txt(-) read 16384 matrix elements (128x128 =
On Tue, Dec 18, 2012 at 12:42 PM, Branimir Maksimovic bm...@hotmail.com wrote:
Seems to me that culprit is in function random as I have tested rest of
codeand didn't found speed related problems.
The problem with your original program was that it was not pure enough. Because
you stored
://shootout.alioth.debian.org/
contributed by Branimir Maksimovic-}
import System.Environmentimport System.IO.Unsafe
import Data.IORefimport Data.Array.Unboxedimport Data.Array.Storableimport
Data.Array.Baseimport Data.Word
import Foreign.Ptrimport Foreign.C.Types
type A = UArray Int Word8type B
AM, Branimir Maksimovic bm...@hotmail.com wrote:
Thanks ! Should I contribute your version on shootout site?
Do whatever you like with it. ___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
mine version.Thanks ! Should I contribute your version on shootout site?
Date: Mon, 3 Dec 2012 00:01:32 -0800
Subject: Re: [Haskell-cafe] Help optimize fannkuch program
From: b...@serpentine.com
To: bm...@hotmail.com
CC: haskell-cafe@haskell.org
On Sun, Dec 2, 2012 at 3:12 PM, Branimir Maksimovic bm
, BangPatterns #-}{- The Computer Language Benchmarks Game
http://shootout.alioth.debian.org/
contributed by Branimir Maksimovic
-}
import System.Environmentimport Text.Printfimport Data.Bits
import qualified Data.Vector.Unboxed.Mutable as VMimport qualified
Data.Vector.Generic.Mutable as VGimport
you want to incrementally update this list a lot of times?
The question would affect the answer you get; i.e. some context
(non-monadically speaking). :D
On Wed, Nov 28, 2012 at 3:43 AM, Branimir Maksimovic bm...@hotmail.com
wrote:
Problem is following short program:
list = [1,2,3,4,5
I have made benchmark test inspired by
http://lemire.me/blog/archives/2012/07/23/is-cc-worth-it/
What surprised me is that unboxed array is much faster than boxed
array.Actually boxed array performance is on par with standard Haskell
listwhich is very slow.All in all even unboxed array is
elapsed
./A +RTS -A50M -s 0.10s user 0.05s system 97% cpu 0.157 total
-
On Sat, Dec 1, 2012 at 11:09 AM, Branimir Maksimovic bm...@hotmail.com
wrote:
I have made benchmark test inspired by
http://lemire.me/blog/archives/2012/07/23/is-cc-worth
% of total elapsed
./A +RTS -A50M -s 0.10s user 0.05s system 97% cpu 0.157 total
-
On Sat, Dec 1, 2012 at 11:09 AM, Branimir Maksimovic bm...@hotmail.com
wrote:
I have made benchmark test inspired by
http://lemire.me/blog/archives/2012/07/23
On Samstag, 1. Dezember 2012, 16:09:05, Branimir Maksimovic wrote:
All in all even unboxed array is about 10 times slower than Java version.
I don't understand why is even unboxed array so slow.
It's not the unboxed arrays that are slow.
Your code has a couple of weak spots, and GHC's
Problem is following short program:list = [1,2,3,4,5]
advance l = map (\x - x+1) l
run 0 s = srun n s = run (n-1) $ advance s
main = dolet s = run 5000 listputStrLn $ show s
I want to incrementally update list lot of times, but don't knowhow to do
this.Since Haskell does not
, Nov 28, 2012 at 7:07 AM, Benjamin Edwards edwards.b...@gmail.com
wrote:
TCO + strictnesses annotations should take care of your problem.
On 28 Nov 2012 11:44, Branimir Maksimovic bm...@hotmail.com wrote:
Problem is following short program:list = [1,2,3,4,5]
advance l = map (\x - x+1) l
I don't see such behavior neither.ubuntu 12.10, ghc 7.4.2.
Perhaps this has to do with how malloc allocates /cachebehavior. If you try not
to allocate array rather use existing one perhaps there would be no
inconsistency?It looks to me that's about CPU cache performance.
Branimir
I'm using
From: Chris Kuklewicz [EMAIL PROTECTED]
To: haskell-cafe@haskell.org
Subject: [Haskell-cafe] x86 code generation going wrong?
Date: Sat, 07 Jan 2006 16:18:59 +
Hello,
I need to ask for some help to test x86 code generation.
There is a factor of two runtime difference between the code
From: Chris Kuklewicz [EMAIL PROTECTED]
To: [EMAIL PROTECTED], Haskell Cafe haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] x86 code generation going wrong?
Date: Sun, 08 Jan 2006 20:33:57 +
Brian Sniffen wrote:
The first couldn't even complete on my 2.26 GHz Celeron! It's only got
From: [EMAIL PROTECTED] (Donald Bruce Stewart)
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: [EMAIL PROTECTED],
[EMAIL PROTECTED],haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] x86 code generation going wrong?
Date: Mon, 9 Jan 2006 11:15:51 +1100
bmaxa:
From: Chris Kuklewicz
This pidigit program is not mine, but original authors of algorithm.
I've just added print function. It is idiomatic Haskell, pi is pure function
that generates inifinite list of digits, and on two machinas I've
tested p4 2.4 ghz and amd athlon 64 3000 it's about some
small percentage ( 5%)
From: Bulat Ziganshin [EMAIL PROTECTED]
Reply-To: Bulat Ziganshin [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: [EMAIL PROTECTED], haskell-cafe@haskell.org
Subject: Re[2]: [Haskell-cafe] Re: Haskell Speed
Date: Fri, 30 Dec 2005 17:56:57 +0300
Hello Branimir,
Friday
From: Isaac Gouy [EMAIL PROTECTED]
To: haskell-cafe@haskell.org
Subject: [Haskell-cafe] Re: Haskell Speed
Date: Thu, 29 Dec 2005 13:00:15 -0800 (PST)
--- Isaac Gouy [EMAIL PROTECTED] wrote:
We'll be happy to also show a Haskell program that
uses Data.HashTable - first, someone needs to
From: Isaac Gouy [EMAIL PROTECTED]
To: haskell-cafe@haskell.org
Subject: [Haskell-cafe] Re: Haskell Speed
Date: Tue, 27 Dec 2005 20:12:01 -0800 (PST)
Branimir Maksimovic wrote:
Of course, first example uses [String] instead of
Data.HashTable
as other languages do. Imagine C program does
From: Joel Reymont [EMAIL PROTECTED]
To: Tomasz Zielonka [EMAIL PROTECTED]
CC: Jeremy Shaw [EMAIL PROTECTED],haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] binary IO
Date: Tue, 27 Dec 2005 09:18:54 +
Tomasz,
Try http://wagerlabs.com/timeleak.tgz. See the Killer pickler
Paul Moore wrote:
On 25 Dec 2005 12:24:38 +0100, Peter Simons [EMAIL PROTECTED] wrote:
Paul Moore writes:
It would be interesting to see standalone code for wcIOB
(where you're allowed to assume that any helpers you
need, like your block IO library, are available from the
standard
From: Joel Reymont [EMAIL PROTECTED]
To: Bulat Ziganshin [EMAIL PROTECTED]
CC: Peter Simons [EMAIL PROTECTED], haskell-cafe@haskell.org
Subject: [Haskell-cafe] Haskell vs. Erlang for heavy-duty network apps
(wasRe: Haskell Speed)
Date: Sun, 25 Dec 2005 12:20:38 +
On Dec 25, 2005, at
From: Bulat Ziganshin [EMAIL PROTECTED]
Reply-To: Bulat Ziganshin [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re[2]: [Haskell-cafe] Substring replacements
Date: Fri, 23 Dec 2005 11:32:01 +0300
Hello Branimir,
Wednesday, December 21, 2005
From: Joel Reymont [EMAIL PROTECTED]
To: Haskell-Cafe Cafe haskell-cafe@haskell.org
Subject: [Haskell-cafe] Killer pickler combinators (was Time leak)
Date: Wed, 21 Dec 2005 02:39:43 +
The original paper is at http://research.microsoft.com/ ~akenn/fun/
picklercombinators.pdf
My
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Bulat Ziganshin [EMAIL PROTECTED], Haskell-Cafe@haskell.org
KMP is O(m) while straightforward is O(m*n).
Where m is the length of the input and n is the length of the searched-for
pattern, I think?
Yes
From: Joel Reymont [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Killer pickler combinators (was Time leak)
Date: Wed, 21 Dec 2005 14:51:42 +
I'm not sure I buy this. Again, this helps:
{-# NOINLINE lock #-}
lock
I've finally performed test on amd64 and result is a same as on intel.
KMP always wins. So KMP is best suited for non indexed strings
and I guess should be used in library as prefered search/replace method.
This test favors straightforward search.
[EMAIL PROTECTED] myhaskell]$ time ./KMP
From: Bulat Ziganshin [EMAIL PROTECTED]
Reply-To: Bulat Ziganshin [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Tue, 20 Dec 2005 23:55:22 +0300
Hello Branimir,
Tuesday, December 20, 2005, 9
From: Bulat Ziganshin [EMAIL PROTECTED]
Reply-To: Bulat Ziganshin [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: [EMAIL PROTECTED], Haskell-Cafe@haskell.org
Subject: Re[2]: [Haskell-cafe] Substring replacements
Date: Fri, 16 Dec 2005 16:51:32 +0300
Hello Branimir,
Friday
From: Bulat Ziganshin [EMAIL PROTECTED]
Reply-To: Bulat Ziganshin [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: [EMAIL PROTECTED], Haskell-Cafe@haskell.org
Subject: Re[2]: [Haskell-cafe] Substring replacements
Date: Fri, 16 Dec 2005 16:51:32 +0300
Hello Branimir,
Friday
| s == s' = srch str str' (l-1)
| otherwise = l
Greetings, Bane.
From: Branimir Maksimovic [EMAIL PROTECTED]
To: [EMAIL PROTECTED], [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Thu, 15 Dec
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Thu, 15 Dec 2005 21:07:11 +0100
Am Donnerstag, 15. Dezember 2005 02:39 schrieben Sie:
From: Branimir Maksimovic [EMAIL
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Tue, 13 Dec 2005 11:23:29 +0100
After seeing that your program is fastest (I've also tried one from
http://haskell.org
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Wed, 14 Dec 2005 17:10:20 +0100
I think that's because on your machine Bulat's version have better
perfromance
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Wed, 14 Dec 2005 20:40:06 +0100
Hi Bane,
nice algorithm. Since comparing chars _is_ cheap, it is to be expected that
all
From: Branimir Maksimovic [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Thu, 15 Dec 2005 00:55:02 +
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe
From: [EMAIL PROTECTED]
To: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Thu, 15 Dec 2005 00:25:19 -0500
G'day all.
Quoting Branimir Maksimovic [EMAIL PROTECTED]:
After seeing that your program is fastest (I've also tried one from
http://haskell.org
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Tue, 13 Dec 2005 11:23:29 +0100
Am Montag, 12. Dezember 2005 16:28 schrieben Sie:
From: Daniel Fischer [EMAIL PROTECTED
From: Joel Reymont [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Re: syscall, sigpause and EINTR on Mac OSX
Date: Mon, 12 Dec 2005 09:00:18 +
The app is multi-threaded but uses lightweight threads (unbound).
So
From: Daniel Fischer [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Mon, 12 Dec 2005 10:31:49 +0100
Am Montag, 12. Dezember 2005 01:34 schrieben Sie:
On 12/12/05, Daniel Fischer [EMAIL PROTECTED] wrote:
Okay, I
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Mon, 12 Dec 2005 13:07:29 +0100
Sorry, but
Prelude SearchRep searchReplace abaaba ## abababaaba
abababaaba
I haven't
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Mon, 12 Dec 2005 16:15:46 +0100
Earlier today:
Sorry, but
Prelude SearchRep searchReplace abaaba ## abababaaba
abababaaba
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Mon, 12 Dec 2005 16:15:46 +0100
Earlier today:
Sorry, but
Prelude SearchRep searchReplace abaaba ## abababaaba
abababaaba
From: Branimir Maksimovic [EMAIL PROTECTED]
To: [EMAIL PROTECTED], [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: RE: [Haskell-cafe] RE: Substring replacements (was: Differences
inoptimisiation Date: Sun, 11 Dec 2005 07:29:46 +
I've found one remaining bug
From: Daniel Fischer [EMAIL PROTECTED]
To: Bulat Ziganshin [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Differences in optimisiation with interactive
andcompiled mo
Date: Sun, 11 Dec 2005 14:59:55 +0100
Am Samstag, 10. Dezember 2005 22:42 schrieb Bulat
From: Bulat Ziganshin [EMAIL PROTECTED]
Reply-To: Bulat Ziganshin [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: [EMAIL PROTECTED], Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] RE: Substring replacements (was: Differences in
optimisiation ...)
Date: Sun, 11 Dec 2005
From: Joel Reymont [EMAIL PROTECTED]
To: Haskell Cafe haskell-cafe@haskell.org
Subject: [Haskell-cafe] Re: syscall, sigpause and EINTR on Mac OSX
Date: Sun, 11 Dec 2005 16:33:36 +
I looked at the scheduler source code and it appears that GHC goes to wait
for signals when a deadlock is
I've got two versions:
HSrts_thr and HSrts_thr_p
I don't know what's second for? but there is only one with
debug in it's name. So I'm not much of a help here.
Greetings, Bane.
From: Joel Reymont [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject
From: Joel Reymont [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Re: syscall, sigpause and EINTR on Mac OSX
Date: Sun, 11 Dec 2005 16:56:23 +
On Dec 11, 2005, at 4:50 PM, Branimir Maksimovic wrote
the details
. Deadlocks can be caused by other things, not neccessarily signals.
Greetings, Bane.
From: Branimir Maksimovic [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Re: syscall, sigpause and EINTR on Mac OSX
Date: Sun, 11 Dec 2005 17:28:54 +
From: Joel Reymont [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Re: syscall, sigpause and EINTR on Mac OSX
Date: Sun, 11 Dec 2005 18:25:47 +
Understood. But I'm printing things in the signal handler to show
From: Joel Reymont [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Re: syscall, sigpause and EINTR on Mac OSX
Date: Sun, 11 Dec 2005 19:09:20 +
What I do works so I don't see any reason to do it otherwise.
Oh, I 've
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: Substring replacements (was: Differences inoptimisiation
Date: Sun, 11 Dec 2005 18:12:12 +0100
Unfortunately:
Prelude SearchRep searchReplace aabaabba iii aabaabaabbaa
From: Joel Reymont [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Re: syscall, sigpause and EINTR on Mac OSX
Date: Sun, 11 Dec 2005 23:31:44 +
Allright, I _am_ convinced. How do I ready ^C from the keyboard
From: Joel Reymont [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Re: syscall, sigpause and EINTR on Mac OSX
Date: Sun, 11 Dec 2005 23:52:19 +
On Dec 11, 2005, at 10:02 PM, Branimir Maksimovic wrote:
This does
From: Daniel Fischer [EMAIL PROTECTED]
To: Haskell-Cafe@haskell.org
Subject: [Haskell-cafe] Substring replacements
Date: Mon, 12 Dec 2005 01:14:37 +0100
Okay, I have looked up KMP and implemented it.
Seems to work -- my first use of QuickCheck, too.
It's slower than Bulat's and Tomasz' for
From: Joel Reymont [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Re: syscall, sigpause and EINTR on Mac OSX
Date: Mon, 12 Dec 2005 02:28:54 +
My client _is_ single-threaded, I do not use bound (OS) threads at all
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: Differences in optimisiation with interactive and compiled mo
Date: Sat, 10 Dec 2005 15:11:31 +0100
Am Donnerstag, 8. Dezember 2005 19:17 schrieb Branimir Maksimovic
From: Tomasz Zielonka [EMAIL PROTECTED]
To: Henning Thielemann [EMAIL PROTECTED]
CC: Branimir Maksimovic [EMAIL PROTECTED], haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Differences in optimisiation with interactive
and compiled mode
Date: Sat, 10 Dec 2005 15:36:57 +0100
On Sat, Dec
From: Tomasz Zielonka [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: [EMAIL PROTECTED], haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Differences in optimisiation with interactive
and compiled mo
Date: Sat, 10 Dec 2005 18:14:58 +0100
On Sat, Dec 10, 2005 at 04:14
From: Bulat Ziganshin [EMAIL PROTECTED]
Reply-To: Bulat Ziganshin [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: [EMAIL PROTECTED],
[EMAIL PROTECTED],haskell-cafe@haskell.org
Subject: Re[2]: [Haskell-cafe] Differences in optimisiation with
interactive and compiled mo
Date
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: [Haskell-cafe] Differences in optimisiation with interactive
and compiled mo
Date: Sat, 10 Dec 2005 23:56:28 +0100
Am Samstag, 10. Dezember 2005 18:29 schrieb Branimir
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Substring replacements (was: Differences in optimisiation ...)
Date: Sat, 10 Dec 2005 22:56:10 +0100
and if you try it on
main2 :: IO ()
main2 = let src = replicate 1000 'r
same.
Greetings, Bane.
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Substring replacements (was: Differences in optimisiation ...)
Date: Sat, 10 Dec 2005 22:56:10 +0100
Am Samstag, 10. Dezember 2005 02:51 schrieben Sie
) = a;
---
From: Branimir Maksimovic [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: [Haskell-cafe] RE: Substring replacements (was: Differences
inoptimisiation ...)
Date: Sun, 11 Dec 2005 02:19:22 +
After seeing your test, I've implemented full KMP algorithm, which
From: Daniel Fischer [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Subject: Re: Differences in optimisiation with interactive and compiled mo
Date: Fri, 9 Dec 2005 23:27:00 +0100
Still doesn't work, though:
*Main searchr hahal jupp hahahalala
From: Joel Reymont [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Mixing C++ and Haskell, OpenSSL thread safety,
and using mmap
Date: Thu, 8 Dec 2005 09:21:08 +
I use OpenSSL in a heavily threaded environment
81 matches
Mail list logo
