Wei Gao villadora

(This is the text of the keynote I gave at Startup Riot 2009. Will update when video becomes available.)

Hi everyone, I'm Chris Wanstrath, and I'm one of the co-founders of GitHub.

GitHub, if you haven't heard of it, has been described as "Facebook for developers." Which is great when talking about GitHub as a website, but not so great when describing GitHub as a business. In fact, I think we're the polar opposite of Facebook as a business: we're small, never took investment, and actually make money. Some have even called us successful.

Which I've always wondered about. Success is very vague, right? Probably even relative. How do you define it?

After thinking for a while I came up with two criteria. The first is profitability. We employ four people full time, one person part time, have thousands of paying customers, and are still growing. In fact, our rate of growth is increasing - which means January was our best month so far, and February is looking pretty damn good.

---------- Forwarded message ----------

From: Mark S. Miller <[email protected]>
Date: Tue, Nov 16, 2010 at 3:44 PM
Subject: "Future of Javascript" doc from our internal "JavaScript Summit"
last week
To: [email protected]

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

Interesting part (unmounting & API) is at the end if you're not interested in the rest =).

Stress Tests

This animation proposal is just an attempt. In case it doesn't work out, I've gathered a few examples that can test the power of a future animation system.

Parent is an infinitely spinning ball, and has a child ball that is also spinning. Clicking on the parent causes child to reverse spinning direction. This tests the ability of the animation system to compose animation, not in the sense of applying multiple interpolations to one or more variables passed onto the child (this should be trivial), but in the sense that the parent's constantly updating at the same time as the child, and has to ensure that it passes the animation commands correctly to it. This also tests that we can still intercept these animations (the clicking) and immediately change their configuration instead of queueing them.
Typing letters and let them fly in concurrently. This tests concurrency, coordination of an array of ch

	-optimizationpasses 5
	-dontusemixedcaseclassnames
	-dontskipnonpubliclibraryclasses
	-dontpreverify
	-verbose
	-optimizations !code/simplification/arithmetic,!field/,!class/merging/
	-ignorewarnings
	-renamesourcefileattribute SourceFile
	-keepattributes SourceFile,LineNumberTable,Annotation,Signature

	// HELPER: #key_value
	//
	// Usage: {{#key_value obj}} Key: {{key}} // Value: {{value}} {{/key_value}}
	//
	// Iterate over an object, setting 'key' and 'value' for each property in
	// the object.
	Handlebars.registerHelper("key_value", function(obj, fn) {
	var buffer = "",
	key;

	var http = require("http"),
	url = require("url"),
	path = require("path"),
	fs = require("fs"),
	mime = require("mime")
	port = process.argv[2] \|\| 8888;

	http.createServer(function(request, response) {

	var uri = url.parse(request.url).pathname

	import android.view.View;
	import android.view.ViewGroup;

	/**
	* A {@link ViewGroup.OnHierarchyChangeListener hierarchy change listener} which recursively
	* monitors an entire tree of views.
	*/
	public final class HierarchyTreeChangeListener implements ViewGroup.OnHierarchyChangeListener {
	/**
	* Wrap a regular {@link ViewGroup.OnHierarchyChangeListener hierarchy change listener} with one

	function normalizeSelector(sel) {

	// save unmatched text, if any
	function saveUnmatched() {
	if (unmatched) {
	// whitespace needed after combinator?
	if (tokens.length > 0 &&
	/^[~+>]$/.test(tokens[tokens.length-1])
	) {
	tokens.push(" ");