Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^4: 99 Problems in Perl6

by gaal (Parson)
on Dec 15, 2006 at 22:39 UTC ( #590138=note: print w/ replies, xml ) Need Help??


in reply to Re^3: 99 Problems in Perl6
in thread 99 Problems in Perl6

Your Haskell compress unfortunately bottoms out on empty input. It's otherwise much better than the stateful Perl 6 version.


Comment on Re^4: 99 Problems in Perl6
Replies are listed 'Best First'.
Re^5: 99 Problems in Perl6
by Ovid (Cardinal) on Dec 15, 2006 at 22:44 UTC

    Lest anyone think I'm a genius, I stole the Haskell code from here.

    Cheers,
    Ovid

    New address of my CGI Course.

      The "alternative solution" posted there doesn't suffer from the monomorphism restriction*, and thus does less to propagate the myth that one has to be a genius to write code in Haskell. It also works correctly with empty input :-)

      compress [] = [] compress [a] = [a] -- singleton list compress (x:y:xs) = (if x == y then [] else [x]) ++ compress (y:xs)
      *Something that, for the casual programmer, is quite technical but uninteresting, has a scary name, and a not-that-friendly error message.
        And indeed, you can do that in Perl too:
        multi compress () { () } multi compress ($a) { item $a } multi compress ($x, $y, *@xs) { $x xx ($x !=== $y), compress($y, |@xs) + } my @x = <a a a a b c c a a d e e e e>; say perl compress |@x;

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://590138]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (9)
As of 2015-07-29 19:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (267 votes), past polls