Christoph Hack tux21b

## tc08.in
  a b c d e f g h
8 . . r . . . . . 8
7 . . . . . . . . 7
6 . . . . . . . . 6
5 . . . k . . . . 5
4 . . . . . . . . 4
3 . . . . . N . r 3
2 . K . . . P . . 2
1 . . . . . . . q 1
  a b c d e f g h

## sara.cpp
#include <iostream>
#include <typeinfo>


struct Game;

struct Command
{
    void execute(Game& game);
};

## gist:2816411
package main

import (
    "database/sql"
    "fmt"
    _ "github.com/bmizerany/pq"
    "log"
)

func QueryMap(db *sql.DB, query string) (map[string]interface{}, error) {

## chess
 8 ♜ ♞ ♝ ♛ ♚ ♝ ♞ ♜
 7 ♟ ♟ ♟ ♟ ♟ ♟ ♟ ♟
 6 · · · · · · · ·
 5 · · · · · · · ·
 4 · · · · · · · ·
 3 ♙ · · · · · · ·
 2 · ♙ ♙ ♙ ♙ ♙ ♙ ♙
 1 ♖ ♘ ♗ ♕ ♔ ♗ ♘ ♖
   a b c d e f g h

## id_rsa.pub
ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAABAQCxXRA2PXooQhMcqVJYBe4pjeGJyFdDLmV5LcxF8C/iSDAFhIEOxz8o/g6L7kuMPMd+UPiJwZNkUECsgrHJM0RUMa8rcePM5/nN9RxLfQWmI45RAf2pxTqyndeOGmWr2xkHvd3KQqskC9wyQSjDvajG+V28fvmG/AewtZNt0C+n+6KumqtAqCUw/c3Sol7IthVtngsLkyEbEYDmGBqATWclX4J6nfyFHIC2qL42HX4SU2rDXMloMEkneZA75rsSI57KpvzmQNl0RCb7YOrbwxMMRShWdXlmG53z1xMBVPCSuLl6q/bTataJxt2Z91ERyqqmx7Y2+0b0n0NYsZsmf+X/ christoph@tuxmobil

## smile.go
package main

import (
    "fmt"
    "os"
    "unsafe"
)

type ʘᴗʘ int32
type Θ_Θ struct{}

## disruptor.go
// Copyright (C) 2011 by Christoph Hack. All rights reserved.
// Use of this source code is governed by the New BSD License.
/*
   This program contains a simple micro-benchmark for a Disruptor [1] like
   event buffer (or at least what I think that Disruptor might be). There
   isn't any kind of API yet and this test is currently limited to a
   single producer - single consumer architecture, but generally the
   architecture of Disruptor is also well suited for multiple producers and
   consumers.

## banking1.go
// Fictional accounting example #1 - "Shared Mutability"
package main

import (
    "fmt"
    "sync"
)

type Account struct {
    id      string
	a b c d e f g h
	8 . . r . . . . . 8
	7 . . . . . . . . 7
	6 . . . . . . . . 6
	5 . . . k . . . . 5
	4 . . . . . . . . 4
	3 . . . . . N . r 3
	2 . K . . . P . . 2
	1 . . . . . . . q 1
	a b c d e f g h
	#include <iostream>
	#include <typeinfo>


	struct Game;

	struct Command
	{
	void execute(Game& game);
	};
	package main

	import (
	"database/sql"
	"fmt"
	_ "github.com/bmizerany/pq"
	"log"
	)

	func QueryMap(db *sql.DB, query string) (map[string]interface{}, error) {
	8 ♜ ♞ ♝ ♛ ♚ ♝ ♞ ♜
	7 ♟ ♟ ♟ ♟ ♟ ♟ ♟ ♟
	6 · · · · · · · ·
	5 · · · · · · · ·
	4 · · · · · · · ·
	3 ♙ · · · · · · ·
	2 · ♙ ♙ ♙ ♙ ♙ ♙ ♙
	1 ♖ ♘ ♗ ♕ ♔ ♗ ♘ ♖
	a b c d e f g h
	// Copyright (C) 2011 by Christoph Hack. All rights reserved.
	// Use of this source code is governed by the New BSD License.
	/*
	This program contains a simple micro-benchmark for a Disruptor [1] like
	event buffer (or at least what I think that Disruptor might be). There
	isn't any kind of API yet and this test is currently limited to a
	single producer - single consumer architecture, but generally the
	architecture of Disruptor is also well suited for multiple producers and
	consumers.
	// Fictional accounting example #1 - "Shared Mutability"
	package main

	import (
	"fmt"
	"sync"
	)

	type Account struct {
	id string