http://lmgtfy.com/?q=haskell+run+length+codingl=1
But you'll learn nothing if you just copy that
Am 19.03.2009 um 03:24 schrieb THANDO NTUANE:
- Forwarded Message
From: THANDO NTUANE thandodar...@yahoo.com
To: Haskell-Cafe@haskell.org
Sent: Thursday, March 19, 2009 10:22:40 AM
Jonathan Cast jonathancc...@fastmail.fm writes:
Couldn't you just substitute catch exceptions with unsafePerformIO
here, and make the same argument?
This puzzled me, until I realized you meant `unsafeInterleaveIO'.
Aargh, yes of course! Sorry about that.
Assuming you mean
Ashley Yakeley wrote:
Have a look at these:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/witness
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/open-witness
Ah, nice! It seems most we came up with is already in there. Even Any
which I use in my project but didn't
Martijn van Steenbergen wrote:
Ashley Yakeley wrote:
Have a look at these:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/witness
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/open-witness
Ah, nice! It seems most we came up with is already in there. Even Any
which I
Since I haven't found out how to report bugs for this package, I am posting
this here.
Changing the color of Text elements in a Hieroglyph image like this:
text {attributes = plain {strokeRGBA = opaque blue}}
does not work correctly. Instead, the color used for the text is the one of the
I also see a segfault on Windows XP SP2 and GHC 6.10.1, very quick so
I'm fairly sure it's not memory.
I agree this should be a bug report.
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Luke Palmer
Sent: 19 March
Hi,
I found myself writing the following
leastFixedPoint :: (Eq a) = (a - a) - a - a
leastFixedPoint f x = fst . head . dropWhile (uncurry (/=)) $ zip l (tail l)
where l = iterate f x
and was a bit surprised that I couldn't get any matches on hoogle for the
type above. The closest one is
Henning Thielemann lemm...@henning-thielemann.de writes:
On Tue, 17 Mar 2009, Melanie_Green wrote:
What are the limitations of list comprehension. I want to use
listcomprehension to output the pattern below. So a mixture of a's and
newline characters. The part im stuck at is creating
Bernie Pope ha scritto:
Language-python provides a parser (and lexer) for Python written in
Haskell. Currently it only supports version 3 of Python (the most recent
version), but it will support version 2 in the future.
Great, thanks!
I was planning to write a Python parser by myself, since
On Wed, 2009-03-18 at 22:24 +0100, Johannes Waldmann wrote:
Hello.
I wonder what is the required layout of directories
and files on a server that supplies packages for cabal-install.
I figure 00-index.tar.gz contains the *.cabal files.
Right. The directory layout within the index is
Am Mittwoch, 18. März 2009 13:31 schrieben Sie:
On Wed, Mar 18, 2009 at 04:36, Wolfgang Jeltsch wrote:
Am Mittwoch, 18. März 2009 10:03 schrieb Benjamin L.Russell:
Just go through the list, choose your top favorite, and assign rank 1
to it;
Is rank 1 the best or the worst?
The
Am Donnerstag, 19. März 2009 03:53 schrieb Benjamin L.Russell:
Therefore, rank 1 is the best.
This is quite the opposite of what Denis Bueno said. :-(
Best wishes,
Wolfgang
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Am Mittwoch, 18. März 2009 15:17 schrieben Sie:
Wolfgang Jeltsch schrieb:
Okay. Well, a monoid with many objects isn’t a monoid anymore since a
monoid has only one object. It’s the same as with: “A ring is a field
whose multiplication has no inverse.” One usually knows what is meant
with
Thanks. Now the 00-index.tar.gz works.
When studying the access log of my web server,
I found that the cabal client (cabal-install/0.6.0)
does not want $pkg/$ver/$pkg-$ver.tar.gz
but uses packages/$pkg-$ver/tarball instead
(yes, packages and tarball are constant strings).
That's strange, since
Wolfgang == Wolfgang Jeltsch g9ks1...@acme.softbase.org writes:
Wolfgang Am Mittwoch, 18. März 2009 13:31 schrieben Sie:
On Wed, Mar 18, 2009 at 04:36, Wolfgang Jeltsch wrote:
Am Mittwoch, 18. März 2009 10:03 schrieb Benjamin L.Russell:
Just go through the list, choose your
Hey There,
I am trying to write a hash-algorithm that in fact is working, but as you might
have guessed the problem is the performance :) At the moment I am 40 times
worse than the same implementation in C.
My problem is, I need mutable arrays which are the heart of that hash.
The algorithm
Hi.
I'm pleased to announce the availability of my random-stream package.
The cabalized package is available at:
http://haskell.mperillo.ath.cx/random-stream-0.0.1.tar.gz
Note that I have not uploaded it on Hackage, and I do not plan to upload
it in the near future, at least until I will
On 19 mrt 2009, at 11:39, Wolfgang Jeltsch wrote:
Am Mittwoch, 18. März 2009 13:31 schrieben Sie:
On Wed, Mar 18, 2009 at 04:36, Wolfgang Jeltsch wrote:
Am Mittwoch, 18. März 2009 10:03 schrieb Benjamin L.Russell:
Just go through the list, choose your top favorite, and assign
rank 1
to it;
Hi.
I have some doubts about the runGetState function in the binary package.
The signature is:
runGetState :: Get a - LBS - Int64 - (a, LBS, Int64)
however the Int64 input parameter is not documented.
What value should I pass?
How will be used?
Thanks Manlio Perillo
Hello Matthias,
Thursday, March 19, 2009, 2:16:30 PM, you wrote:
1. use ghc -O2
2. use unsafeRead/WriteArrray
3. check that all calculations (step*, li/ri) are strict
Hey There,
I am trying to write a hash-algorithm that in fact is working, but
as you might have guessed the problem is the
Csaba Hruska csaba.hru...@gmail.com wrote:
Some planned features:
+ skeletal animation (in progress)
+ physics (hpysics) integration
Add softbodies and IKA (scriptable) and you'll make me drool instead of
merely salivate.
--
(c) this sig last receiving data processing entity. Inspect
On 19 Mar 2009, at 11:39, Wolfgang Jeltsch wrote:
Am Mittwoch, 18. März 2009 13:31 schrieben Sie:
On Wed, Mar 18, 2009 at 04:36, Wolfgang Jeltsch wrote:
Am Mittwoch, 18. März 2009 10:03 schrieb Benjamin L.Russell:
Just go through the list, choose your top favorite, and assign
rank 1
to
Hello sylvain,
Thursday, March 19, 2009, 2:16:06 AM, you wrote:
Something is wrong: how can Haskell be faster than C?
1. you measure efficiency of libs, not compilers
2. don't forget about -O2/-O3
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
Peter Verswyvelen bugf...@gmail.com wrote:
The GHC documentation lists a lot of tweaks that can be done to the
garbage collector.
However, Haskell spin-offs like Timber http://www.timber-lang.org/
implement their own incremental garbage collector that is better
suitable for real-time usage.
On Thu, Mar 19, 2009 at 5:43 AM, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
Am Mittwoch, 18. März 2009 15:17 schrieben Sie:
Wolfgang Jeltsch schrieb:
Okay. Well, a monoid with many objects isn’t a monoid anymore since a
monoid has only one object. It’s the same as with: “A ring is a
Claus Reinke wrote:
I finally got around to making my code for random Go playouts
available. Here it is:
http://www.haskell.org/~simonmar/goboard.tar.gz
Cool!-) To reciprocate, I've temporarily put a snapshot of my code here:
http://www.cs.kent.ac.uk/~cr3/tmp/SimpleGo.hs
I've not yet
I've been thinking a lot about these issues lately, mainly because I have
been working with a toy compiler that uses multiple inheritance heavily, and
which uses adjectives explicitly for context sensitive mixins.
An easier idea to think about would be to categorize most adjectives applied
to
Hello.
I need the documentation of alex (a lexical analyser generator in
Haskell) in PDF format, so I used the Makefile in the doc directory of
the distribution of alex to get it.
But unfortunatly, the documentation includes some code listings that are
too wide and does not fit in the default
Manlio Perillo wrote:
Hi.
I have some doubts about the runGetState function in the binary package.
The signature is:
runGetState :: Get a - LBS - Int64 - (a, LBS, Int64)
however the Int64 input parameter is not documented.
What value should I pass?
How will be used?
Thanks Manlio Perillo
ChrisK ha scritto:
Manlio Perillo wrote:
Hi.
I have some doubts about the runGetState function in the binary package.
The signature is:
runGetState :: Get a - LBS - Int64 - (a, LBS, Int64)
however the Int64 input parameter is not documented.
What value should I pass?
How will be used?
On Thu, Mar 19, 2009 at 08:58:08AM +, Danny Chan wrote:
By the way, for the complete newbie that I am, is there a standard way to
report bugs for a package from Hackage?
Most packages on Hackage have a 'Maintainer' field providing an email
address to which you can send bug reports.
On Thu, Mar 19, 2009 at 11:55:16AM +0100, Manlio Perillo wrote:
Note that I have not uploaded it on Hackage, and I do not plan to upload it
in the near future, at least until I will repute the package mature enough.
I would encourage you to upload it to Hackage regardless of its
supposed
Manlio Perillo manlio_peri...@libero.it writes:
The stream generator implements tha RandomGen interface.
This is really cool, though I think 'split' is a must. Maybe all
instances could share the same stream in the background, then it
wouldn't cause resource issues.
Also, IMHO mkStream should
What do you mean with IKA? Inverse Kinematics Animation?
On Thu, Mar 19, 2009 at 1:34 PM, Achim Schneider bars...@web.de wrote:
Csaba Hruska csaba.hru...@gmail.com wrote:
Some planned features:
+ skeletal animation (in progress)
+ physics (hpysics) integration
Add softbodies and IKA
Brent Yorgey ha scritto:
On Thu, Mar 19, 2009 at 11:55:16AM +0100, Manlio Perillo wrote:
Note that I have not uploaded it on Hackage, and I do not plan to upload it
in the near future, at least until I will repute the package mature enough.
I would encourage you to upload it to Hackage
Maybe the feature has been added, but not released, because somebody is
strict about their code...
It should be possible to do:
cabal install http://haskell.mperillo.ath.cx/random-stream-0.0.1.tar.gz
It's unfortunate that this is not supported.
Thanks Manlio
Gökhan San ha scritto:
Manlio Perillo manlio_peri...@libero.it writes:
The stream generator implements tha RandomGen interface.
This is really cool, though I think 'split' is a must. Maybe all
instances could share the same stream in the background, then it
wouldn't cause resource issues.
No? Well, that's a bug in and of itself.
On Thu, Mar 19, 2009 at 9:50 AM, Brent Yorgey byor...@seas.upenn.edu wrote:
On Thu, Mar 19, 2009 at 08:58:08AM +, Danny Chan wrote:
By the way, for the complete newbie that I am, is there a standard way to
report bugs for a package from Hackage?
Danny, I'll fix this today and repost and add a maintainer email
address in the cabal package while I'm at it. Thanks!
2009/3/19 Danny Chan chan_...@yahoo.de:
Since I haven't found out how to report bugs for this package, I am posting
this here.
Changing the color of Text elements in a
Andrew Wagner ha scritto:
Maybe the feature has been added, but not released, because somebody is
strict about their code...
We should first agree on the meaning of release some code...
Manlio
___
Haskell-Cafe mailing list
On Thu, Mar 19, 2009 at 4:41 PM, Manlio Perillo
manlio_peri...@libero.it wrote:
However, in this case, the package name should be changed.
I'm not sure it is a good idea to release a package that implements only one
function (but I may be wrong).
Personally, I think that there is little harm
It looks like Manuel Chakravarty is making some progress on this.
http://hackage.haskell.org/trac/ghc/ticket/1673#comment:11
Sean
On Thu, Jan 15, 2009 at 21:57, Nicolas Frisby wrote:
Any movement on this?
(I am actually just looking forward to generating kind ascriptions and
having access
I've used a similar function myself, but why write it in such a
complicated way? How about
lfp :: Eq a = (a - a) - a - a
lfp f x
| f x == x = x
| otherwise = lfp f (f x)
Edsko
On 19 Mar 2009, at 09:49, Jens Blanck wrote:
Hi,
I found myself writing the following
leastFixedPoint :: (Eq
Bug fixed. Package uploaded to Hackage.
2009/3/19 Danny Chan chan_...@yahoo.de:
Since I haven't found out how to report bugs for this package, I am posting
this here.
Changing the color of Text elements in a Hieroglyph image like this:
text {attributes = plain {strokeRGBA = opaque blue}}
Max Rabkin ha scritto:
On Thu, Mar 19, 2009 at 4:41 PM, Manlio Perillo
manlio_peri...@libero.it wrote:
However, in this case, the package name should be changed.
I'm not sure it is a good idea to release a package that implements only one
function (but I may be wrong).
Personally, I think
I've used a similar function myself, but why write it in such a complicated
way? How about
lfp :: Eq a = (a - a) - a - a
lfp f x
| f x == x = x
| otherwise = lfp f (f x)
I've used a similar function too, but your version computes f x twice
per iteration, I wrote mine as:
fix :: Eq a =
I always feel that the compiler should do such optimizations for me :)
On 19 Mar 2009, at 16:21, Neil Mitchell wrote:
I've used a similar function myself, but why write it in such a
complicated
way? How about
lfp :: Eq a = (a - a) - a - a
lfp f x
| f x == x = x
| otherwise = lfp f (f x)
CSE is tricky and a potential space leak in general. I'd love it if
the compiler could pick the best option, but I'm afraid its unlikely
to know.
On Thu, Mar 19, 2009 at 4:25 PM, Edsko de Vries devri...@cs.tcd.ie wrote:
I always feel that the compiler should do such optimizations for me :)
On
Max == Max Rabkin max.rab...@gmail.com writes:
Max On Thu, Mar 19, 2009 at 4:41 PM, Manlio Perillo
Max manlio_peri...@libero.it wrote:
Max Personally, I think that there is little harm in releasing a
Max package if it does something useful in a not-totally-broken
Max way.
Can you give an example of when CSE would not be the way to go?
Thanks,
Martijn.
Neil Mitchell wrote:
CSE is tricky and a potential space leak in general. I'd love it if
the compiler could pick the best option, but I'm afraid its unlikely
to know.
A JIT compiler can easily know.
Regards,
John A. De Goes
N-BRAIN, Inc.
The Evolution of Collaboration
http://www.n-brain.net|877-376-2724 x 101
On Mar 19, 2009, at 10:29 AM, Neil Mitchell wrote:
CSE is tricky and a potential space leak in general. I'd love it if
the compiler could
Generally, I mark my stuff as Experimental, and make note of it in my
announcements.
/jve
On Thu, Mar 19, 2009 at 12:30 PM, Colin Paul Adams co...@colina.demon.co.uk
wrote:
Max == Max Rabkin max.rab...@gmail.com writes:
Max On Thu, Mar 19, 2009 at 4:41 PM, Manlio Perillo
Max
Can you give an example of when CSE would not be the way to go?
if length (replicate 'a' 1) == 1 then [] else head (replicate 'a' 1)
This program will use O(1) memory. If we perform CSE:
if length x == 1 then [] else head x
where x = replicate 'a' 1
Now we use 1 cells of
Neil Mitchell wrote:
if length (replicate 'a' 1) == 1 then [] else head (replicate 'a' 1)
This program will use O(1) memory.
Doesn't length force evaluation of the 1 cells?
Martijn.
___
Haskell-Cafe mailing list
On 2009 Mar 19, at 12:30, Colin Paul Adams wrote:
Max == Max Rabkin max.rab...@gmail.com writes:
Max On Thu, Mar 19, 2009 at 4:41 PM, Manlio Perillo
Max manlio_peri...@libero.it wrote:
Max Personally, I think that there is little harm in releasing a
Max package if it does
On 19 Mar 2009, at 16:37, Martijn van Steenbergen wrote:
Neil Mitchell wrote:
if length (replicate 'a' 1) == 1 then [] else head (replicate
'a' 1)
This program will use O(1) memory.
Doesn't length force evaluation of the 1 cells?
Yes, but without CSE every cell can
I believe R J was consciously restricting himself to finite lists in the
original post.
2009/3/18 MigMit miguelim...@yandex.ru
More interesting:
foldl (flip const) whatever (repeat 1 ++ [1,2,3])
Daniel Fischer wrote on 18.03.2009 15:17:
Am Mittwoch, 18. März 2009 13:10 schrieb Daniel
Brettschneider:
Hey There,
I am trying to write a hash-algorithm that in fact is working, but as you
might have guessed the problem is the performance :) At the moment I am 40
times worse than the same implementation in C.
My problem is, I need mutable arrays which are the heart of
37Lenny222
Just noticed that this logo is way too similar to the logo of Techsmith:
http://www.techsmith.com/
Regards,
CS
2009/3/19 Eelco Lempsink ee...@lempsink.nl
On 19 mrt 2009, at 11:39, Wolfgang Jeltsch wrote:
Am Mittwoch, 18. März 2009 13:31 schrieben Sie:
On Wed, Mar 18, 2009 at
IANAL, so would this a problem if this logo won?
Deniz
2009/3/19 Cetin Sert cetin.s...@gmail.com:
37Lenny222
Just noticed that this logo is way too similar to the logo of Techsmith:
http://www.techsmith.com/
Regards,
CS
2009/3/19 Eelco Lempsink ee...@lempsink.nl
On 19 mrt 2009, at
On 2009 Mar 19, at 12:39, Brandon S. Allbery KF8NH wrote:
On 2009 Mar 19, at 12:30, Colin Paul Adams wrote:
Max == Max Rabkin max.rab...@gmail.com writes:
Max On Thu, Mar 19, 2009 at 4:41 PM, Manlio Perillo
Max manlio_peri...@libero.it wrote:
Max Personally, I think that there is
Anyway, these functions do not get the least fixed point ot r, but a fixed
point of f starting from the seed x. it is'n?
http://en.wikipedia.org/wiki/Fixed_point_(mathematics)
2009/3/19 Neil Mitchell ndmitch...@gmail.com
I've used a similar function myself, but why write it in such a
After spending a bit of time trying to decide how to vote, I ended up
deciding that my favorite would be a hybrid of several of the designs
(#9 #49 FalconNL, and #50 George Pollard). It's probably too late to
include this in the voting, but here it is nonetheless:
inline:
On 2009 Mar 19, at 13:12, Deniz Dogan wrote:
IANAL, so would this a problem if this logo won?
Legally, only if Techsmith complained. Practically, I would wonder
about the possibility of confusion.
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allb...@kf8nh.com
system
Deniz Dogan wrote:
IANAL, so would this a problem if this logo won?
Not necessarily. The Lenny222 entry is distinctly multicoloured
unlike TechSmith's which might distinguish it. Trademarks may only
apply to a particular industrial sector or geographical region.
TechSmith is in computer
Peter Verswyvelen bugf...@gmail.com wrote:
What do you mean with IKA? Inverse Kinematics Animation?
yep.
--
(c) this sig last receiving data processing entity. Inspect headers
for copyright history. All rights reserved. Copying, hiring, renting,
performance and/or quoting of this signature
Ooh, shiny!
2009/3/19 Warren Harris warrensomeb...@gmail.com
After spending a bit of time trying to decide how to vote, I ended up
deciding that my favorite would be a hybrid of several of the designs (#9
#49 FalconNL, and #50 George Pollard). It's probably too late to include
this in the
The problem we were asked about was specifically
a
aa
aaa
The code (iterate ('a':) \n) does not give the right answer.
It's not just that it produces an infinite list instead of three
strings, it doesn't even start with the right string. It starts
with \n when we need a\n.
To
Hello,
I need sleep briefly(1/2 seconds) in code that I have written. I tried
searching for sleep and wait in Hoogle and either didn't get a hit or
got something inappropriate. ??
Regards, Vasili
___
Haskell-Cafe mailing list
In general, if you can't find what you seek due to terminology
differences then search based on what you expect the type to be. In
this case you want to provide a measure of time (Ints are common) and
have it perform some sort of IO action:
Int - IO ()
It just so happens that the first result
Actually, yea. This is pretty nice. If either #9, #49 or #50 make it to
the top of the list, can we ensure that this will be selectable as a
variant?
(If not, we can at least put it on cafe press and I'd buy the t-shirt :) )
2009/3/19 Edward Kmett ekm...@gmail.com
Ooh, shiny!
2009/3/19
Manlio Perillo manlio_peri...@libero.it writes:
Gökhan San ha scritto:
Manlio Perillo manlio_peri...@libero.it writes:
The stream generator implements tha RandomGen interface.
This is really cool, though I think 'split' is a must. Maybe all
instances could share the same stream in the
I'm playing around with the com package, but I'm having a hard time
understanding how to map a COM call to the appropriate methodN or
functionN call. Does anyone have any example code that uses the
method1 or higher. Any help or pointers would be appreciated.
Here's the code I have so far:
I'm not sure I understand what is going on here, but it seems to me
that the following assignment of mult = (*) causes mult to lose
out on some of the polymorphic behavior of (*). Is that right? If
so, why?
Prelude Data.Function Data.List Data.Char let sizeMult = (*) `on`
length
Hello,
On Thu, Mar 19, 2009 at 05:49:34PM -0600, Duane Johnson wrote:
I'm not sure I understand what is going on here, but it seems to me that
the following assignment of mult = (*) causes mult to lose out on some
of the polymorphic behavior of (*). Is that right? If so, why?
This is the
Hi,
there's a steady stream of people reporting that getting started with
curl on Windows is cumbersome and tricky to get right. A legitimate
complaint! :-)
To hopefully help out a bit in that regard, I've put together some notes
covering the steps reqd + made available a pre-packaged curl
Tomáš Janoušek t...@nomi.cz writes:
Hello,
On Thu, Mar 19, 2009 at 05:49:34PM -0600, Duane Johnson wrote:
I'm not sure I understand what is going on here, but it seems to me that
the following assignment of mult = (*) causes mult to lose out on some
of the polymorphic behavior of (*). Is
What does this mean again? I'm working on the assumption that
`context-sensitive' means `under some (not necessarily compositional
and/or continuous and/or monotonic) equivalence relation/
I'm using contexts as expressions with holes, as used for evaluation
contexts in operational semantics,
2009/3/19 Jens Blanck jens.bla...@gmail.com
Hi,
I found myself writing the following
leastFixedPoint :: (Eq a) = (a - a) - a - a
leastFixedPoint f x = fst . head . dropWhile (uncurry (/=)) $ zip l (tail
l)
where l = iterate f x
and was a bit surprised that I couldn't get any matches
On Thu, Mar 19, 2009 at 04:42, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
Am Donnerstag, 19. März 2009 03:53 schrieb Benjamin L.Russell:
Therefore, rank 1 is the best.
This is quite the opposite of what Denis Bueno said. :-(
Ugh, I'm sorry about this. I've participated in several
80 matches
Mail list logo
