catsocks catsocks

Stevey's Google Platforms Rant

I was at Amazon for about six and a half years, and now I've been at Google for that long. One thing that struck me immediately about the two companies -- an impression that has been reinforced almost daily -- is that Amazon does everything wrong, and Google does everything right. Sure, it's a sweeping generalization, but a surprisingly accurate one. It's pretty crazy. There are probably a hundred or even two hundred different ways you can compare the two companies, and Google is superior in all but three of them, if I recall correctly. I actually did a spreadsheet at one point but Legal wouldn't let me show it to anyone, even though recruiting loved it.

I mean, just to give you a very brief taste: Amazon's recruiting process is fundamentally flawed by having teams hire for themselves, so their hiring bar is incredibly inconsistent across teams, despite various efforts they've made to level it out. And their operations are a mess; they don't real

This re-styles your sublime text 2 sidebar to be darker, so it doesn't blind you when using a dark theme.

Save the Default.sublime-theme file into packages/Theme - Default, make a backup of your original if you want to be able to go back easily.

Copied from http://code.lancepollard.com/complete-list-of-html-meta-tags/

Basic HTML Meta Tags

<meta name="keywords" content="your, tags"/>
<meta name="description" content="150 words"/>
<meta name="subject" content="your website's subject">
<meta name="copyright"content="company name">
<meta name="language" content="ES">

tmux cheat sheet

(C-x means ctrl+x, M-x means alt+x)

Prefix key

The default prefix is C-b. If you (or your muscle memory) prefer C-a, you need to add this to ~/.tmux.conf:

remap prefix to Control + a

tmux shortcuts & cheatsheet

start new:

tmux

start new with session name:

tmux new -s myname

Couldn't find the text of this for a while...

Original (404'ed) -- https://plus.google.com/115094562986465477143/posts/Di6RwCNKCrf
Fakeout -- http://www.dzone.com/links/rss/ryan_dahl_i_hate_almost_all_software.html
Repost -- https://plus.google.com/116904230181415286707/posts/DnAMAN5sUR8

	Some possible implementations of the Bresenham Algorithms in C.

	The Bresenham line algorithm is an algorithm which determines which points in an
	n-dimensional raster should be plotted in order to form a close approximation
	to a straight line between two given points.
	It is commonly used to draw lines on a computer screen, as it uses only integer
	addition, subtraction and bit shifting, all of which are very cheap operations
	in standard computer architectures.
	It is one of the earliest algorithms developed in the field of computer graphics.
	A minor extension to the original algorithm also deals with drawing circles.

	Latency Comparison Numbers (~2012)
	----------------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD

	package main

	import (
	"fmt"
	"labix.org/v2/mgo"
	"labix.org/v2/mgo/bson"
	"time"
	)

	type Person struct {

	#include <SDL2/SDL.h>
	#include <SDL2/SDL_mixer.h>

	#define WAV_PATH "Roland-GR-1-Trumpet-C5.wav"
	#define MUS_PATH "HR2_Friska.ogg"

	// Our wave file
	Mix_Chunk *wave = NULL;
	// Our music file
	Mix_Music *music = NULL;