On 05/13/2012 03:13 AM, Felipe Almeida Lessa wrote:
Truly amazing! I wonder it would fare with larger repositories. =)
It does not scale well. I have not looked into optimization at all. For
example the algorithm to compute the transitive reduction is very naive
and brute force.
Somehow related
Hi all!
Yesterday I wrote a little tool to output the dependencies of darcs
patches in dot format. The hardest part was to wrap my head around the
darcs API and find a way to let it compute the patch dependencies. I
don't know, if I got it right, but it looks correct at first glance.
Here is the
That's great! I think, it would be useful to include the version of the
shipped gcc (where applicable). Would that be complicated to add?
For windows, I looked them up once:
2011.4.0.0 - 4.5.0
2011.2.0.1 - 4.5.0
2011.2.0.0 - 4.5.0
2010.2.0.0 - 3.4.5
Cheers,
Sönke
Simon
Hi all!
string-conversions is a very simple package to facilitate dealing with
different string types. It provides a simple type class that allows you to
convert between values of different string types. It also provides type
synonyms for these string types.
Supported types are:
- String
-
Hi Joachim!
Joachim Breitner wrote:
you could elaborate the documenatation “Assumes UTF-8” – I guess this
only applies to the two ByteString variants, as String and Text _should_
contain unicode codepoints and no encoding. Not that someone tries to
use a String where each Char corresponds to
Michael Snoyman wrote:
I'm the author of convertible-text, and I consider it deprecated (it's
marked as such in the synopsis).
As far as string-conversions, I'm a little concerned that it's using
decodeUtf8, which can throw exceptions from pure code for invalid UTF8
sequences. I would
.)
Sönke
Sönke Hahn wrote:
Hi all!
string-conversions is a very simple package to facilitate dealing with
different string types. It provides a simple type class that allows you to
convert between values of different string types. It also provides type
synonyms for these string types.
Supported
Tony Morris wrote:
Pointed f = Pointed (StateT s f)
but not
Applicative f = Applicative (StateT s f)
I see. So StateT cannot be what you could call an applicative transformer.
(Unlike for example ReaderT.)
Thanks.
___
Haskell-Cafe mailing
Hi!
I was reading through the Typeclassopedia ([1]) and I was wondering which
type could be an instance of Pointed, but not of Applicative. But I can't
think of one. Any ideas?
Sönke
[1] http://www.haskell.org/haskellwiki/Typeclassopedia
___
Sönke Hahn wrote:
There is a related bug report in ghc's trac: [1]. According to that, you
could try to remove the -fvia-C flag to prevent ghc from using the C
backend. (I had no luck with that, so I guess there is still another bug
lurking.)
Just FYI:
I tried again and realised, why I had
epsilonhalbe wrote:
hey haskellers,
i'm fresh into haskell and love it. so to do faster easier haskell i
wanted to install lambdabot but had to face some errors - i don't
understand them at all
here is some error output from zsh:
http://hpaste.org/46401/bot_install_error
can anyone
Roel van Dijk wrote:
On 24 April 2011 01:49, wren ng thornton w...@freegeek.org wrote:
I would *love* there to be a tool which (a) automatically saves failing
QuickCheck values to disk, and (b) automates using HUnit to load those in
and test them. I'm not so sure that QuickCheck should be
Hi all!
The next Berlin Haskell Meeting will be next wednesday:
Date: Wednesday, April 27th
Time: from 20:00
Location: c-base, Rungestrasse 20, 10179 Berlin
I hope, this is not on too short notice.
Cheers,
Sönke
___
Haskell-Cafe mailing list
Hi!
I would like to have a library that would allow to use QuickCheck in the
normal manner, but it would save test data for failing properties on the
filesystem (maybe using the shiny new acid-state?). On consecutive test
runs, the saved test data would be used first (before generating new
Hi all!
I haven't tried the tool myself, but it seems interesting to the Haskell
efforts to compile to JavaScript:
http://syntensity.blogspot.com/2011/04/emscripten-10.html
Cheers,
Sönke
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi all!
It's been some time since the last Berlin Haskell Meeting, but we're doing it
again:
Date: Wednesday, March 30th
Time: from 20:00
Location: c-base, Rungestrasse 20, 10179 Berlin
If you're in Berlin and interested in Haskell, save the date!
Cheers,
Sönke
John Lask wrote:
I have noticed that on my windows box and ghc 6.12.3 I get the return
list for System.Direcotry.getDirectoryContents in reverse sorted order.
This is a change from previous observed behavior and I would consider it
a bug. I would like to verify that it is not just me.
I
Erik de Castro Lopo wrote:
Jonathan Geddes wrote:
snip
So, am I missing the benefits of TDD in my Haskell code?
Probably. I work on a project which has 4+ lines of
haskell code (a compiler written in haskell) and has a huge
test suite that is a vital to continued development.
On Thursday, December 30, 2010 06:50:32 pm Neil Mitchell wrote:
Hi Sönke,
I've just released cmdargs-0.6.6 which supports helpArgs [groupname
Something]
That was fast! Thanks a lot, works like a charm.
Thanks,
Sönke
___
Haskell-Cafe mailing list
That i18n is a fantastic argument - and one that really means cmdargs
has no choice but to support all the attributes on help/version.
Is it possible to change the groupname for the implicit help and version
options? I have defined some options with groupname development flags, but I
would
Hi!
If you write a cabal setup script with user hooks, is there a way to tell
cabal-install that the setup script itself depends on some package from
hackage? (The dependency would be cabal-macosx in my case.)
Thanks,
Sönke
___
Haskell-Cafe mailing
The Berlin Haskell meeting is due again:
Date: Tuesday, December 7th
Time: from 20:00
Location: c-base, Rungestrasse 20, 10179 Berlin
See you there.
Sönke
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
The next haskell meeting in Berlin will be this wednesday:
Date: Wednesday, November 24th
Time: from 20:00
Location: c-base, Rungestrasse 20, 10179 Berlin
Hope to see you there,
Sönke
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Friday, October 29, 2010 02:07:55 am Daniel van den Eijkel wrote:
Hi,
thanks to all participants for the funny meeting! I had a lot of fun and
I'm looking forward to see you again.
I had fun, too. There were twice as many people than I anticipated (4 instead
of 2) and we outnumbered the
I have been thinking for a while that it might be worth defining a
Prelude2, which corrects the known problems with the Prelude. Over time,
people could migrate to using Prelude2. It would probably take years to be
widely adopted, but at least there would be light at the end of the
tunnel.
On Saturday, October 23, 2010 07:50:41 pm Johannes Waldmann wrote:
There will be an informal Haskell meeting [...]
The bi-monthly lisp meeting [...]
[1] http://www.c-base.org/calender/phpicalendar/month.php
Pray tell - which of the three above-mentioned languages is from the dark
side?
Hi all!
There will be an informal Haskell meeting in Berlin.
Date: Thursday, October 28th
Time: from 20:00
Location: c-base, Rungestrasse 20, 10179 Berlin
The bi-monthly lisp meeting takes place at the same time and place [1].
This is the first of hopefully more meetings to come, so we will
On Monday, June 28, 2010 10:38:33 am José Romildo Malaquias wrote:
Is there in Haskell a non monadic function of type a - a - Bool which
test for physical equality of two values? It would return True if only
if both values are the same object in memory.
IIRC observable sharing does similar
On Monday 01 March 2010 03:16:25 pm Sönke Hahn wrote:
Yes there are. I am working on a game with Haskell using OpenGL rendering.
I've done some frame time measurements lately and encountered single frames
needing more than 100ms to be rendered. I am currently trying to gather
information
On Monday 01 March 2010 01:04:37 am Luke Palmer wrote:
On Sun, Feb 28, 2010 at 2:06 AM, Pavel Perikov peri...@gmail.com wrote:
Did you really seen 100ms pauses?! I never did extensive research on this
but my numbers are rather in microseconds range (below 1ms). What causes
such a long
On Sunday, Andrew Coppin asked:
Is Thread Scope any use for profiling single-threaded programs?
I used threadscope to look at eventlogs from a program that uses OpenGL to
render multiple frames per second (compiled without -threaded). That means,
there is CPU activity regularly (multiple
On Wednesday 11 November 2009 08:23:53 am Tony Morris wrote:
I have two projects that I intend to put on hackage soon. One depends
on the other. I have cabaled both. I am wondering how others work
with this kind of set up where changes are made to both libraries as
they work.
What i did in
On Monday 19 October 2009 10:30:55 am Dougal Stanton wrote:
Has not been responding for at least the last 12 hours.
Is there somewhere to look for status reports on sysadmin details like
this, so we can tell if
- it's a scheduled down time
- it's a problem but the admins know about it
-
On Friday 09 October 2009 07:07:21 pm Duncan Coutts wrote:
On Fri, 2009-10-09 at 17:37 +0200, Sönke Hahn wrote:
Hi!
I need to set an environment variable from Haskell and i would like to do
that cross-platform. There is System.Posix.Env.setEnv, which does
exactly, what i want on Linux
PM, Sönke Hahn sh...@cs.tu-berlin.de wrote:
Hi!
I need to set an environment variable from Haskell and i would like to do
that
cross-platform. There is System.Posix.Env.setEnv, which does exactly,
what
i
want on Linux. There is the module System.Environment, which seems
On Wednesday 14 October 2009 04:50:56 pm Sönke Hahn wrote:
On Friday 09 October 2009 07:19:30 pm Peter Verswyvelen wrote:
Mmm, that seems like a shortcoming.
Well, you could just wrap the C functions yourself, like this (two
possibilities, no error checking yet, quick hack):
http
Hi!
I need to set an environment variable from Haskell and i would like to do that
cross-platform. There is System.Posix.Env.setEnv, which does exactly, what i
want on Linux. There is the module System.Environment, which seems to be
cross-platform, but it does not contain functions to
Hi!
I often stumble upon 2- (or 3-) dimensional numerical data types like
(Double, Double)
or similar self defined ones. I like the idea of creating instances for Num for
these types. The meaning of (+), (-) and negate is clear and very intuitive, i
think. I don't feel sure about (*),
On 5 Oct 2009, at 21:06, Lennart Augustsson wrote:
OK, just pairs have no arithmetic, but one way of defining
arithmetic is to treat the pairs as complex numbers. Or as mantissa
and exponent. Or as something else. So there's nothing wrong, IMO,
to make pairs an instance of Num if you
39 matches
Mail list logo
