Happiest programmers?

http://blog.doloreslabs.com/2009/05/the-programming-language-with-the-happiest-users/

I don't know what to add, except http://asset.soup.io/asset/0359/3976_fff8_500.png

lol lisp hipsters boasting their new fibs implementations

HASKAL PROGRAMMERS = DEAD

>>3
I'm sure there are less than 57005 Haskal programmers

The Programming Language with the Happiest User Tweets
Fixed.

gonna summarize the comments before reading them:

"boohoo python wasn't on top. invalid."

>>2
Join us in http://www.reddit.com/r/fibs !

i'm happy

>>8
You are happy inside your little bubble, autist

>>9
You are unhappy inside your little bubble, autist

>100
true.

I'm thinking of going from C# to C++.  Does this mean I should reconsider?

happy programmers copy and paste other programmers code

>>13
lol, that's what I was thinking

>>2

#include <cstdio>
#define T long

struct Z {T R,I;};
Z m(Z l,Z r){return{l.R*r.R+5*l.I*r.I,l.R*r.I+l.I*r.R};}
Z s(Z l,Z r){return{l.R-r.R,l.I-r.I};}
Z x(Z e, T n){Z r={1,0};for(;n;n>>=1){if(n&0x1)r=m(r,e);e=m(e,e);}return r;}
T f(T n){Z p={1,1},_=s(x(p,n),x(s({2,0},p),n));return _.I/(1<<n);}

// The entry point to our program
int main(
    int   argc,   // The number of arguments to command-line binary (unused)
    char* argv[]  // An array of char* arguments to command-line binary (unused)
) {
    // The beginning of our program

    // Execute the following interior code 15 times
    for (int i=0; i<15; i++) {
   
        // Evaluate f at every integral value along the interval [0, 15).
        // "%d" signifies the result will be interpreted as a signed integer.
        // A space is included following the "format string" to provide a
        //   neatly formatted output
        printf("%d ", f(i));
       
    }
    // End of interior code section
   
    // Return a success code to the operating system
    return 0;
   
    // The end of our program
}

>>15
n.b. needs --std=c++0x and for usefulness' sake you would probably want to make T a bigger type

>>15
Well commented program.

A drunk man may be happier than a sober one.

Whats wrong with haskell? lol I find it very a compact and concise useful language. There's a few great compilers out there for haskell too, such that one needn't worry about optimisation. For example,

reverse      :: [Int] -> [Int]
reverse   []  = []
reverse x:xs  = reverse xs ++ [x]

is replaced in the compiler by some function like:

reverse2            :: [Int] -> [Int] -> [Int]
reverse2 [] ys       = ys
reverse2 x:xs ys     = reverse2 xs x:ys

useReverse     :: [Int] -> [Int]
useReverse xs   = reverse2 xs []

since the useReverse is much faster (because ++ takes more steps).

So one really doesn't have to worry about memory usage and such in haskell, which is why it's so awesome! :)

>>20
So one really doesn't have to worry about memory usage [...] in haskell,
Yeah, no.

Stupidity.

>>20
is replaced in the compiler by some function like:
No it's not. Where did you get that idea?

reverse' :: [a] -> [a]
reverse' []     = []
reverse' (x:xs) = reverse' xs ++ [x]

compiles to:

reverse' =
  \ (@ a_adG) (ds_dig :: [a_adG]) ->
    case ds_dig of _ {
      [] -> [] @ a_adG;
      : x_adu xs_adv ->
        ++
          @ a_adG
          (reverse' @ a_adG xs_adv)
          (: @ a_adG x_adu ([] @ a_adG))
    }