JS1k: The JavaScript code golfing competition

_='w=c.w&W&;h=c.hqHq;t=k=G=-1;T=[];A=x+@ry-@ru=[x`d>5?0:s,p,r];m.nu$d>5)N;var i=u;$<7){A-Y3-;A+Y3+OA,s*8,d,i,mN m}QTA(,[Z{n:[]})setInterval(G=(t+=005)-1)+1;=!createRadialGradient(32,201,^FD4"05,^FB0"6,^CEF"	Rect(0,0,w_	JQj  U)$
2]){!leW&=
2]*L32z
0t*8+i),
1t)/(8+i)	l0Z1]	(
0Z
1ZL64*
2ZV)O=^261",!font=20*G+"px Arial",!Text("\\u273f",0]-10*G,1]+8*GL2_*6.44_*5.%V$k>7||k<0)k=0,i=5,W=[]{y=Yh;W[w`w+Y99+99,y+Y50])}k+=02,i=5{dx=0]-2];dy=1]-3];!="rgba(2%2%2%"+(1.2-k/7)+")"z0K1Xl2K3X()}},33
U[j][!random();!begPath(	L2*(t)+1)_-8*t)*h,L.addColorStop(Math.W[i][	!function,s,d,p,m){(i+5)*(L3)_,1.6,1,02,s*6,d+1,i,m)(x`r;i--;)strokeJarc(in0.for(fill]+=.push(=wdow.ner);s(eTo(
3][cos(Style!a.$if(%55,&idth@=h/4*s*J=^000"Kdx*k,Lw/NreturnO}else Q;i=3UT[i].nV0,7	(Xdy*k	Y*Z],^"#_,h`,y,qeightzmov';for(Y=0;$='zq`_^ZYXVUQONLKJ@&%$!	
'[Y++];)with(_.split($))_=join(pop());eval(_)

Xz0ndz1jLncmGVcmO2g9Yy5ocRlIcTt0PWs9Rz0tMTtUPVtdO0E9C3grQB5yGnktQBtyGnU9W3hgZD41PzA6cyxwLHJdO20ubhh1GiRkPjUpTjt2YXIgaT11OyQDPBQ3KXtBDy1ZFDMtDjtBDytZFDMrDk9BDyxzKhQ4LGQsaSxtGk4gbX1RVBhBKAwsWwxae246W119KRpzZXRJbnRlcnZhbCgLRz0bKHQrPRQwMDUpLTEpKzE7Aj0hY3JlYXRlUmFkaWFsR3JhZGllbnQoBTMyLAUyBjAxLF5GRDQiBjA1LF5GQjAiBjYsXkNFRiIJFlJlY3QoMCwwLHdfCREfSlEVaiATIFUpJAEyXSl7IWwTZVcmPQEyXSpMMzJ6ATAXHnQqOCtpKSwBMRcbdCkvKDgraSkJbBMcHTBaHTFdCREoEgEwWgExWkw2NCoBMlpWKU8CPV4yNjEiLCFmb250PTIwKkcrInB4IEFyaWFsIiwhFlRleHQoIlxcdTI3M2YiLB0wXS0xMCpHLB0xXSs4KkcSTDJfKjYuNDRfKjUuJVYaJGs+FDd8fGs8MCkVaz0wLGk9NSxXPVtdEHt5PVloO1cYW3dgdytZOTkrOTkseStZNTBdKX0Vays9FDAyLGk9NRB7ZHg9CDBdLQgyXTtkeT0IMV0tCDNdOyERHz0icmdiYSgyJTIlMiUiKygxLjItay8UNykrIikieggwSzFYbBMcCDJLM1gRKCl9fSwzMxoBVVtqXVsCIRYfAwdyYW5kb20oKQQ7IWJlZxNQYXRoKAkFTDIqKB50KSsxKV8tFDgqG3QpKmgsTAYaAi5hZGRDb2xvclN0b3AoFAdNYXRoLghXW2ldWwkaIQtmdW5jdGlvbg8scyxkLHAsbSl7DChpKxQ1KSooTDMpXywxLjYsMSwwDhQyLHMqFDYsZCsxLGksbSkPKHhgchA7aS0tOykRc3Ryb2tlEhoCSgRhcmMoE2luFDAuFWZvcigWZmlsbBddKz0YLnB1c2goGT13E2Rvdy4TbmVyGik7GwdzEygcZVRvKB0BM11bHgdjb3MoH1N0eWxlIWEuJGlmKCU1NSwmaWR0aEA9aC80KnMqSj1eMDAwIksXZHgqaywITHcvTnJldHVybk99ZWxzZSBROxVpPTMQVVRbaV0ublYwLDcJFihYF2R5KmsJWQMqWl0sXiIjXyxoYCx5LHFlaWdodHoEbW92HCc7Zm9yKFk9MDskPSd6cWBfXlpZWFZVUU9OTEtKQCYlJCEfHh0cGxoZGBcWFRQTEhEQDw4MCwkIBwYFBAMCASdbWSsrXTspd2l0aChfLnNwbGl0KCQpKV89am9pbihwb3AoKSk7ZXZhbChfKQ==

/**
         * Rebirth, by Jérémy Tuloup
         * js1k 2013-Spring entry
         * 
         * Description:
         * Every year, spring is the time for renewal.
         * It brings life back and buds grow again as the sun rise in the sky.
         * If you want new trees, just refresh the page.
         * Enjoy :)
         * 
         * It runs smoothly on a i7 computer, with Chrome 24, Firefox 18 and 
         * Internet Explorer on Windows, and also in Chrome on Linux, but a bit 
         * slower in Firefox on Linux (maybe because of my Firefox install). 
         * I noticed a little glitch on Safari on Mac with the leaves, just at 
         * the beginning of the demo. 
         * 
		 * About the code:
		 * - There are a lot of magic numbers, found after a lot of testing
		 * - 7 is used instead of 2*Math.PI for drawing circles, and 1.6 instead of Math.PI/2
		 * - Minification is done in two steps:
		 * 		1. With Closure Compiler (http://closure-compiler.appspot.com/home) to
		 * 		remove whitespaces and comments.
		 * 		2. With JS Crush (http://www.iteral.com/jscrush/) for a big compression!
		 * - The two functions use the same signature, because it allows more 
         * compression with JS Crush
         * 
		 */
	
        w = c.width = window.innerWidth;
        h = c.height = window.innerHeight;
        t = k = G = -1; // initialize time, wind and growth at the same time
		T = []; // list of trees

		// grow a tree
		// (posX, posY, radius, scale, depth, parent, self pointer)
        A = function(x,y,r,s,d,p,m) {
        
			// compute new coordinates
            x+=h/4*s*Math.cos(r);
            y-=h/4*s*Math.sin(r);
			
			// add the new node [x,y,scale,parent,radius]
            u=[x,y,(d>5)?0:s,p,r];
            m.n.push(u);

			// end of recursion
            if (d > 5) return; // only 6 for better performance

            var i = u; // remember self node
            if(Math.random() < 0.7) {
                A(x,y,r-Math.random()*0.3-0.2,s*0.6,d+1,i,m); // left branch
                A(x,y,r+Math.random()*0.3+0.2,s*0.6,d+1,i,m); // right branch
            } else
                A(x,y,r,s*0.8,d,i,m); // continue with main branch
				
			return m;
        }

		// create the trees
        for(i=3;i--;)
            T.push(A((i+0.5)*(w/3), h, 1.6,1,0,[(i+0.5)*(w/3),h,1.6,1,0],{n:[]}));
            
        // main
        setInterval(function(x,y,r,s,d,p,m) {
 
			// update t and G at the same time
			G = Math.sin((t+=0.005)-1)+1;
 
            // sky and sun
            a.fillStyle = a.createRadialGradient(
				w/2*(Math.cos(t)+1), h-0.8*Math.sin(t)*h, w/32, 
				w/2*(Math.cos(t)+1),  h-0.8*Math.sin(t)*h, w/2
			);
            a.fillStyle.addColorStop(0.01, '#FD4');
            a.fillStyle.addColorStop(0.05, '#FB0');
            a.fillStyle.addColorStop(0.6, '#CEF');
            a.fillRect(0, 0, w, h);
            
            a.strokeStyle = '#000';

            // render and update trees
            for(i=3;i--;)
                for (j in T[i].n)
                    if (T[i].n[j][2]) {
						// draw a branch from the current node to its parent
						a.lineWidth = T[i].n[j][2]*w/32;
						a.beginPath();
						a.moveTo(
							T[i].n[j][0]+= Math.cos(t*8+i), // update x at the same time
							T[i].n[j][1]+= Math.sin(t)/(8+i) // update y at the same time
						);
						a.lineTo(T[i].n[j][3][0],T[i].n[j][3][1]);
						a.stroke();
                        // draw a circle to make the tree look better
						a.fillStyle = '#000';
						a.beginPath();
						a.arc(T[i].n[j][0],T[i].n[j][1],w/64*T[i].n[j][2],0, 7);
						a.fill();
					} else {
						// drawing a text for the leaf helps to save a few bytes
                        a.fillStyle = '#261', // green
						a.font = 20*G+'px Arial',
						a.fillText('✿',T[i].n[j][3][0]-10*G,T[i].n[j][3][1]+8*G)
					}
            
			// render a little hill at the bottom
			a.fillStyle = '#000';
			a.beginPath();
			a.arc(w/2,h*6.44,h*5.55,0,7);
			a.fill();
			
			// compute a new wind, going from right to left
			if (k>0.7||k<0)
				for (k=0,i=5,W=[];i--;){
					y = Math.random()*h;
					W.push([
						w, // start x
						y, // start y
						w+Math.random()*99+99, // end x
						y+Math.random()*50 // end y
					]);
				}
			
			// render and update wind
			for (k+=0.02,i=5;i--;){
				dx = W[i][0]-W[i][2]; dy = W[i][1]-W[i][3];
				a.strokeStyle = 'rgba(255,255,255,'+(1.2-k/0.7)+')';
				a.beginPath();
				a.moveTo(W[i][0]+=dx*k,W[i][1]+=dy*k);
				a.lineTo(W[i][2]+=dx*k,W[i][3]+=dy*k);
				a.stroke();
			}

        }, 33);