nf

## fanout.go
package main

import (
	"flag"
	"log"
	"net/http"
	"strings"
	"sync"
	"time"

## gist:472384
package main

import (
    "bufio"
    "encoding/binary"
    "flag"
    "io"
    "os"
)

## tree-compare.go
// Two binary trees may be of different shapes,
// but have the same contents. For example:
//
//        4               6
//      2   6          4     7
//     1 3 5 7       2   5
//                  1 3
//
// Go's concurrency primitives allow us to neatly
// traverse and compare the contents of two trees.

## singleton.go
package main

import "fmt"

var singleton = NewSingleton()

type Singleton struct {
	S string
}

## macpaint.p
PROGRAM MacPaint;

{  BitMap Painting Program by Bill Atkinson }

{$D- }
{$R- }
{$X- }


USES {$U obj:HeapZone    }  HeapZone,

## heap_and_sort.go
package main

import (
        "fmt"
        "sort"
        "container/heap"
        "rand"
)

type record struct {

## cat.coffee
fs = require 'fs'

class File
	constructor: (@name) ->
	read: (cb) ->
		fs.readFile @name, (err, code) ->
		   throw err if err
		   cb code.toString()

file = new File "file.txt"

## gist:1282973
{
	"KeyName": "icecloud-key",
	"Server": [
		{
			"Kind": "master",
			"Location": "Tokyo",
			"Username": "ubuntu",
			"ImageID":  "ami-40b40041",
			"Size":     "m1.small",
			"NumClients": 100, "NumSources": 5

## gist:1568686
13:23 <@adg> :)
13:28 < skelterjohn> always good to see a smiling face in here
13:35 < AndrewBC> Always? What if it's JUST a smiling face?
13:36 < skelterjohn> you mean as in this case?
13:37 < skelterjohn> it'll do
13:38 < AndrewBC> D'oh. I meant more like horror movie gore, but you win this
                  round
13:39 < skelterjohn> lol
13:39 <@adg> :)
13:39 < skelterjohn> OH GOD

## index.tmpl
<html>
<head>
<title>Where's adg?</title>
<style>
th {
	text-align: left;
}
td, th {
	padding-right: 10px;
}
	package main

	import (
	"flag"
	"log"
	"net/http"
	"strings"
	"sync"
	"time"
	// Two binary trees may be of different shapes,
	// but have the same contents. For example:
	//
	// 4 6
	// 2 6 4 7
	// 1 3 5 7 2 5
	// 1 3
	//
	// Go's concurrency primitives allow us to neatly
	// traverse and compare the contents of two trees.
	package main

	import "fmt"

	var singleton = NewSingleton()

	type Singleton struct {
	S string
	}
	PROGRAM MacPaint;

	{ BitMap Painting Program by Bill Atkinson }

	{$D- }
	{$R- }
	{$X- }


	USES {$U obj:HeapZone } HeapZone,
	package main

	import (
	"fmt"
	"sort"
	"container/heap"
	"rand"
	)

	type record struct {
	fs = require 'fs'

	class File
	constructor: (@name) ->
	read: (cb) ->
	fs.readFile @name, (err, code) ->
	throw err if err
	cb code.toString()

	file = new File "file.txt"
	{
	"KeyName": "icecloud-key",
	"Server": [
	{
	"Kind": "master",
	"Location": "Tokyo",
	"Username": "ubuntu",
	"ImageID": "ami-40b40041",
	"Size": "m1.small",
	"NumClients": 100, "NumSources": 5
	13:23 <@adg> :)
	13:28 < skelterjohn> always good to see a smiling face in here
	13:35 < AndrewBC> Always? What if it's JUST a smiling face?
	13:36 < skelterjohn> you mean as in this case?
	13:37 < skelterjohn> it'll do
	13:38 < AndrewBC> D'oh. I meant more like horror movie gore, but you win this
	round
	13:39 < skelterjohn> lol
	13:39 <@adg> :)
	13:39 < skelterjohn> OH GOD
	<html>
	<head>
	<title>Where's adg?</title>
	<style>
	th {
	text-align: left;
	}
	td, th {
	padding-right: 10px;
	}