terest in the given file
descriptor, and the IO manager / GHC runtime scheduler will wake up your
thread (GHC uses "green" threads) when the file descriptor becomes writable.
G
--
Gregory Collins <g...@gregorycollins.net>
___
Glasgow-ha
frequent, but average GC times go up. Dumping +RTS -S for us
will also help us understand your GC behaviour, since I wouldn't expect to
see 1s pauses on any but the largest heaps. Are you using large
MutableArrays?
--
Gregory Collins <g...@gregorycollins.net>
___
Built-up thunks can transparently hide a lot of allocation so fire up the
profiler and tighten those up (there's an 80-20 rule here). Reuse output
buffers if you aren't already, etc.
G
--
Gregory Collins <g...@gregorycollins.net>
___
Glasgo
--
Gregory Collins g...@gregorycollins.net
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
is not forced; that doesn't happen in your example until
BSL.length forces its input. If I'm right, changing the first line to
return $! encode command will move the hang to before the call to
traceEventIO.
--
Gregory Collins g...@gregorycollins.net
___
Glasgow
because encode is infinite-looping. I
think Occam's razor applies here, check that any recursion you're doing is
actually reducing the recursive argument. Perhaps you could post the code
(e.g. http://gist.github.com/)?
G
--
Gregory Collins g...@gregorycollins.net
On Fri, Sep 13, 2013 at 5:25 AM, Thiago Negri evoh...@gmail.com wrote:
Is PVP the one that every package on Hackage should use?
Yes.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
into the GHC IO manager with threadWaitWrite, which
registers interest in the file descriptor using epoll() and blocks the
calling Haskell thread until the socket is writable.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell
in a linker error
Loading package hashable-1.2.0.7 ... linking ... ghc:
/home/feuerbach/tmp/aeson/.cabal-sandbox/lib/i386-linux-ghc-7.6.3/hashable-1.2.0.7/libHShashable-1.2.0.7.a:
unknown symbol `hashable_siphash24_sse2'
ghc: unable to load package `hashable-1.2.0.7'
Roman
* Gregory Collins
/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
and ran it on each machine. On the Dell I get:
Odds are good it's integer overflow. Change Int to Integer or Int64 and
retry.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
) *** (*5) $ (20,30)
(23,150)
mapFst :: (a - b) - (a,c) - (b,c)
mapFst f = mapPair f id
mapSnd :: (b - c) - (a,b) - (a,c)
mapSnd = mapPair id
That's Control.Arrow.{first, second}:
ghci first (+10) (1,1)
(11,1)
ghci second (+10) (1,1)
(1,11)
G
--
Gregory Collins g
://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
boy for why we have the motto avoid success at all costs.
You have two options: stay on GHC 6.x (the bits didn't get deleted from the
internet), and if that isn't practical, fix Wash (or pay someone to do it
if you don't know how) and get on with your life.
G
--
Gregory Collins g
-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
newTable = H.new
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell
of bytes.
PS. My main lang is C++ over 10 years and I only learn Haskell :)
__**_
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/**mailman/listinfo/haskell-cafehttp://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory
On Fri, Mar 8, 2013 at 9:36 AM, Gregory Collins g...@gregorycollins.netwrote:
I presume you did some Handle debugging?
...and here I mean benchmarking of course.
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Fri, Mar 8, 2013 at 9:48 AM, John Lato jwl...@gmail.com wrote:
For comparison, on my system I get
$ time cp input.dat output.dat
real 0m0.004s
user 0m0.000s
sys 0m0.000s
Does your workstation have an SSD? Michael's using a spinning disk.
--
Gregory Collins g...@gregorycollins.net
version.
G
On Fri, Mar 8, 2013 at 10:13 AM, Alexander Kjeldaas
alexander.kjeld...@gmail.com wrote:
On Fri, Mar 8, 2013 at 9:53 AM, Gregory Collins
g...@gregorycollins.netwrote:
On Fri, Mar 8, 2013 at 9:48 AM, John Lato jwl...@gmail.com wrote:
For comparison, on my system I get
-streams
Cheers,
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. There are several libraries that purport to provide better
interfaces for doing IO in Haskell, like conduit, pipes, enumerator, and my
own io-streams library (http://github.com/snapframework/io-streams, soon to
be released). You could try one of those.
G
--
Gregory Collins g...@gregorycollins.net
/archive/base/4.2.0.1/doc/html/GHC-IO-BufferedIO.html
On Feb 27, 2013 10:52 PM, Gregory Collins g...@gregorycollins.net
wrote:
On Wed, Feb 27, 2013 at 9:38 PM, John D. Ramsdell ramsde...@gmail.comwrote:
How does one create a value of type System.IO.Handle for reading that
takes its input from
-cafehttp://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/eva_colgotes
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
--
Gregory Collins g...@gregorycollins.net
___
Haskell mailing list
Haskell@haskell.org
http
, such as -H and -c, and haven't found anything to help. I'm using GHC
7.4.1.
Thanks,
Jeff
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g
On Sun, Oct 21, 2012 at 1:25 PM, Jason Dusek jason.du...@gmail.com wrote:
Sadly, I can not do Posix IO on handles or read a ByteString
from a Posix FD.
Try the unix-bytestring package.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe
list
Haskell-Cafe@haskell.org
http://www.haskell.org/**mailman/listinfo/haskell-cafehttp://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
? Which of the two are more
performant?
Bye and thanks,
A.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, but a fair number of requests are much slower, 38-40
milli-secs, making the mean latency and throughput quite bad.
You might get more information from running threadscope on your program.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe
Data.Text.Encoding.decodeUtf8With which allows you to replicate this. It's
likely, however, that your input text is in some other encoding like
ISO-8859-1. Use the text-icu package (
http://hackage.haskell.org/package/text-icu) to decode these.
G
--
Gregory Collins g...@gregorycollins.net
| http://www.joachim-breitner.de/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe
find it hard to stay on the treadmill? Things could be a lot worse.
I guarantee you that our friends in the Standard ML community are not
having this discussion. :-)
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell
This part of the conditional can be written more succinctly as:
all (== test_lcv) [init_lcv, update_lcv, update_lcv']
Re: the if statement, you can also use guard syntax.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe
.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
, as it is deeply offensive to many and unfairly
marginalizes the differently-abled.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
should be trivial.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
+haskell-cafe, oops
On Thu, Apr 5, 2012 at 11:04 AM, Gregory Collins g...@gregorycollins.netwrote:
On Wed, Apr 4, 2012 at 10:09 PM, tsuraan tsur...@gmail.com wrote:
It's hard to rule Snap timeouts out; try building snap-core with the
-fdebug flag and running your app with DEBUG=1, you'll
and running your app with DEBUG=1, you'll get a spew of
debugging output from Snap on stderr.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/**mailman/listinfo/haskell-cafehttp://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
-users mailing list
glasgow-haskell-us...@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins
structures we want to store arbitrary pointers (hence casArray#).
This is true, although using bits-atomic does a function call (i.e the
calls are not inlined), which would be pretty bad for performance.
G
--
Gregory Collins g...@gregorycollins.net
:: MutableByteArray# s - Int# - Word# - Word#
- State# s - (# State# s, Int#, Word#)
and equivalents for Word32. Word64, Int16, Int32, Int64.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/blob/master/src/Snap/Chat/ChatRoom.hs
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
anymore about the implementation details, once and for all.
It's hard to know which abstraction might be sufficiently magical to allow
you to skip caring about the implementation details; personally I think stm
is pretty magical already :)
G
--
Gregory Collins g...@gregorycollins.net
bit harder.
In domains where you care a lot about operational semantics (like parallel
and concurrent programming, where it's absolutely critical), programmers
necessarily require a lot more experience and knowledge in order to be
effective in Haskell.
G
--
Gregory Collins g...@gregorycollins.net
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
message.
Memory profiling should help you find the leak.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
config?
I'm using the default value.
CLOSE_WAIT indicates that the other side has closed its side of the
connection and the OS is waiting for you to close() the socket. At this
point I'd start looking at your database layer.
G
--
Gregory Collins g...@gregorycollins.net
, of course.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to cajole people into it -- if Hackage 2 puts
stable packages on a different / better list, there's your social
pressure. Right now the stability flag in the .cabal file, as you
pointed out, is almost completely content-free.
G
--
Gregory Collins g...@gregorycollins.net
for tackling these kinds of
policy issues, because it would probably allow you to e.g. filter the
package list by stability.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
. This would show up in the criterion output as an
unusually large outlier.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
deepseq, and thus the whole list is forced. See
https://gist.github.com/1299380 for a short counterexample.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
to leverage GHC's internal async I/O
but I'm not sure how to do it.
Maybe: forkIO two threads, one for the read end, one for the write
end? I would use a loop over lazy I/O, also.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
On Tue, Oct 18, 2011 at 9:23 AM, R J rj248...@hotmail.com wrote:
hey Haskell check it out http://www.fastnews10i.com
OK, who has the ban hammer?
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
On Sat, Oct 15, 2011 at 6:40 PM, Michael Snoyman mich...@snoyman.com wrote:
I'm strongly in favor of this change, the current associativity has
caused me to litter some code with a few too many parentheses.
Strong +1 for me as well, for the same reason.
G
--
Gregory Collins g
memory and I'm using fairly hefty machines (e.g one with 48
cores and 128GB of RAM) and so perhaps the default/heuristic settings aren't
optimal.
Increasing -A and -H in the RTS options should help with this.
G
--
Gregory Collins g...@gregorycollins.net
with a Chan to shuttle data between them, I
think it's probably the best way of doing it.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of them, so I think, assuming I'm understanding you
correctly, that this would make a lot of sense.
I think that's roughly what I had in mind, yes.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
is correctly following the
spec by decompressing.
If you decide to implement a workaround for this, the only reasonable
thing I can think of is adding a ignoreContentEncoding knob the user
can twiddle to violate spec.
G
--
Gregory Collins g...@gregorycollins.net
On Mon, Aug 29, 2011 at 4:28 PM, Herbert Valerio Riedel h...@gnu.org wrote:
On Mon, 2011-08-29 at 13:21 +0200, Gregory Collins wrote:
A web server should not be setting Content-encoding: gzip on a
.tar.gz file.
Why not? From RFC2616 compliant servers I'd expect a .tar.gz file to
have
and HPC test coverage
reports, it's really useful.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Wed, Jun 29, 2011 at 4:16 AM, Roman Leshchinskiy r...@cse.unsw.edu.au
wrote:
Gregory Collins wrote:
For an example of a similar technique (minus the freezing part), I did
a similar thing in the hashtables library:
You might be interested in 'grow' :-)
I would be, except to save a couple
in the hashtables library:
https://github.com/gregorycollins/hashtables/blob/master/src/Data/HashTable/Internal/Linear/Bucket.hs#L45
It's unlikely to be worth the extra effort except for extremely
performance-critical code.
G
--
Gregory Collins g...@gregorycollins.net
to get help, you should a) demonstrate
that you've made an effort to solve the problem on your own, b)
explain where you've gotten stuck and what it is you don't understand
about how to move forward.
G
--
Gregory Collins g...@gregorycollins.net
by templates or DSL would
help.
Thanks!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell
://gregorycollins.net/posts/2011/06/11/announcing-hashtables
Although I’ve made substantial efforts to test this code prior to
release, it is a version 1.0. Please send bug reports to the
hashtables github issues page:
https://github.com/gregorycollins/hashtables/issues.
Thanks!
G
--
Gregory Collins g
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
into it consecutively as a
special case.
The blaze-builder might work for this also, this is exactly the
problem it's designed for.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
and on which some extra information can be
hung. How would I organize something like this in Haskell?
Thanks.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g
?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe
On Sat, May 7, 2011 at 12:38 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
On 07/05/2011 09:10 AM, Gregory Collins wrote:
Linode. Can't recommend them highly enough.
If Linode is really the cheapest that the Internet has to offer, I'm going
to need to find a job that pays
you go into a little bit of detail about the mechanism behind this?
Thanks!
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
(), or something smarter in GHC 7 (epoll() on linux,
kqueue() on BSD/OSX).
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
use PQSocket() to get the
underlying socket file descriptor, and call
ThreadWaitRead/ThreadWaitWrite to use the system event dispatcher
(epoll() or select()) to efficiently multiplex.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing
use case whether you wanted to
optimize for throughput or for latency to secondary storage. I just
know from experience that for high-throughput server applications,
writing each message to disk is going to introduce unacceptable
context-switching overhead.
G
--
Gregory Collins g
than once every N seconds.
Is the ease-of-use goal contradicting making this library useful in more
complex applications?
Easy to use and high performance don't have to be contradictory,
but you shouldn't neglect the latter.
G
--
Gregory Collins g...@gregorycollins.net
version, are you also producing a linked list containing all
of the values? Because that's what mapM does. Your test is mostly
measuring the cost of allocating and filling ~3 million machine words
on the heap. Try mapM_ instead.
G
--
Gregory Collins g...@gregorycollins.net
trivial with the second variant, but
seems very difficult with the first one, if it's possible at all.
Why can't you use #1 and do this when you call run_?
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe
, brown fox
, jumped
, over the lazy
, dog ]
-
G.
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm not sure I understood what you meant by You don't need to write
more typeclass instances this way.
Sorry, I misspoke -- they're equivalent. Personally I find the
existential easier to read.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell
On Mar 29, 2011 10:42 AM, o...@okmij.org wrote:
I'm keen to hear of the example that seem to require Iteratee's
allocating additional resources. I'd really like to see if any of such
cases can be cast it terms of regions, implemented via iterated
Iteratee transformers.
Hello Oleg,
The
-match against another constructor in mainline code,
hurting performance -- or is there some other reasonable way to deal
with it?
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
to dealing with an issue in
multithreading, and you may not be doing yourself any favours in the
long-term by piling on workarounds to get back the semantics you
actually want.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
GHC installer, or rebuild your libraries
with 32-bit support.
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
(warning, DJ Bernstein code :) )
G
--
Gregory Collins g...@gregorycollins.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to *not* install
it...
You need a system development toolchain (compiler, assembler, linker,
etc) to run GHC.
Could you please point me to the ticket you opened? I was not able to google
it.
http://hackage.haskell.org/trac/ghc/ticket/3470
G
--
Gregory Collins g...@gregorycollins.net
Senior Software Engineer,
Mirantis Inc. http://www.mirantis.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Gregory Collins g...@gregorycollins.net
, some preliminary benchmarks:
https://gist.github.com/826935
It's probably a month or two away from a releasable state, but my
work-in-progress is substantially faster (4-6X) than Data.Hashtable
for inserts and lookups.
G
--
Gregory Collins g...@gregorycollins.net
On Wed, Feb 23, 2011 at 3:49 PM, Max Bolingbroke
batterseapo...@hotmail.com wrote:
On 23 February 2011 12:05, Gregory Collins g...@gregorycollins.net wrote:
I've been working on one lately, some preliminary benchmarks:
https://gist.github.com/826935
It's probably a month or two away from
1 - 100 of 211 matches
Mail list logo