virtualsafety

module AVLTree where 
data BT = L | N Int BT BT deriving (Show, Eq)

-- Nice, small and useful functions
empty = L

-- You could say, depth L == Nothing depth (N v L L) == Just 0, but works for
-- me better this way:
depth L = 0
depth (N _ t u) = (max (depth t) (depth u)) + 1

virtualsafety

module Main where

import Text.Parsec
import Text.Parsec.String

input_text :: String
input_text = "foo123:"

main :: IO ()
main = do

virtualsafety

Backend Architectures

Twitter

ror, scala, jetty, erlang, thrift, mongrel, comet server, my-sql, memchached, varnish, kestrel(mq), starling, gizzard, cassandra, hadoop, vertica, munin, nagios, awstats

• Scaling Twitter: Making Twitter 10000 Percent Faster
• Scaling Twitter
• Blaine Cook on Scaling Twitter - YouTube

virtualsafety

// Implementation of a UDP proxy

package main

import (
	"flag"
	"fmt"
	"log"
	"net"
	"os"

virtualsafety

package main

import (
	"bytes"
	"encoding/hex"
	"flag"
	"fmt"
	"io"
	"log"
	"net"

virtualsafety

package main
 
import (
  "io/ioutil"
  "log"
  "net"
  "net/http"
  "net/url"
  "strings"
  "time"