On Fri, Dec 18, 2009 at 11:31, Marcus D. Gabriel mar...@gabriel.name wrote:
than parList via parMap. For example, in one experiment, parMap
with parList run at 0.81 the time of the serial solution whereas
forceParMap with forceParList run at 0.58 the time of the serial
solution. This is to
On Tue, May 19, 2009 at 16:07, Jason Dusek jason.du...@gmail.com wrote:
The former page also has a curious discussion of standalone
deriving with a `for` keyword:
http://www.haskell.org/ghc/dist/current/docs/users_guide/type-extensions.html#stand-alone-deriving
Without this extension,
I'm using the Data.Graph.Inductive.Query.Dominators library
(http://haskell.org/ghc/docs/latest/html/libraries/fgl/Data-Graph-Inductive-Query-Dominators.html).
The library is a bit spare on comments, so I may or may not be using
it correctly.
My goal is to compute the set of nodes that dominate
On Sat, Feb 16, 2008 at 10:53 AM, Johannes Waldmann
[EMAIL PROTECTED] wrote:
If ghci (re-)reads a module that contains some error,
then it considers the module loading as a complete failure,
and at the prompt I get the Prelude environment.
I'd like to have at least the import statements
On Jan 26, 2008 7:01 PM, Yitzchak Gale [EMAIL PROTECTED] wrote:
[snip explanation]
The documentation in System.Random is a bit misleading.
It says the read instance of StdGen has the following properties:
It guarantees to succeed on any string... The word read should
really be Read instead. It
Hi all,
According to
http://haskell.org/ghc/docs/latest/html/libraries/random/System-Random.html#t%3AStdGen
the Read StdGen instance should never fail. However, in GHC 6.8.2, it
appears to:
ghci
GHCi, version 6.8.2: http://www.haskell.org/ghc/ :? for help
Loading package base ... linking ...
On Dec 4, 2007 10:45 PM, Ravi Nanavati [EMAIL PROTECTED] wrote:
One of the smaller nits I noticed when looking at profiles generated
by 6.8.1 (using -prof -auto-all) is that class methods show up as cost
centers named something like $f5. I can look at the call stack and
figure out that $f5 is
In the past few days I'd been wondering about how to detect infinite
loops myself, so thanks for this advice, pepe! I've put pepe's advice
on the Wiki under Debugging: http://haskell.org/haskellwiki/Debugging
Please feel free to flesh it out or add more advice as necessary.
-Denis
On Nov 21,
On Nov 15, 2007 10:10 AM, kenny lu [EMAIL PROTECTED] wrote:
I am using fink instead of darwin port, I have readline installed.
zhuo-ming-lus-computer:~ luzm$ fink list *readline*
Information about 1733 packages read in 1 seconds.
readline 4.3-1028 Comfortable terminal input
On Nov 9, 2007 4:38 AM, Bjorn Bringert [EMAIL PROTECTED] wrote:
I have this in my ~/.profile so that I don't have to keep giving
flags to configure for every single thing I build against MacPorts
libraries:
export CPATH=/opt/local/include
export LIBRARY_PATH=/opt/local/lib
export
Hi all,
Apologies if this has already been reported, or is a symptom of
something already reported.
I downloaded the GHC source
(http://www.haskell.org/ghc/dist/6.8.1/ghc-6.8.1-src.tar.bz2) and
attempted to build as follows, bootstrapping with GHC 6.6.1:
./configure ; make -j3
(The error
11 matches
Mail list logo
