cilindrox

// link to "iw3mp.exe" +set dedicated 1 +set sv_punkbuster 1 +exec dedicated.cfg +map_rotate
// Put this file under CoD4/main install folder

set sv_hostname "chorilan"

// Security
set g_password ""
set rcon_password "changeMe!"

// Maximum Clients

cilindrox

PSQL

Magic words:

psql -U postgres

If run with -E flag, it will describe the underlaying queries of the \ commands (cool for learning!).

Most \d commands support additional param of __schema__.name__ and accept wildcards like *.*

cilindrox

tmux shortcuts & cheatsheet

start new:

tmux

start new with session name:

tmux new -s myname

cilindrox

First, you'll need to list your disks. Just use the following to see which /dev/diskN node we're going to:

diskutil list

We'll need to unmount the disk to be cloned. We'll use the following command for that:

diskutil unmountDisk /dev/diskN

cilindrox

eXtreme Go Horse (XGH) Process

Source: [http://gohorseprocess.wordpress.com]

1. I think therefore it's not XGH.

In XGH you don't think, you do the first thing that comes to your mind. There's not a second option as the first one is faster.

2. There are 3 ways of solving a problem:

the right way, the wrong way and the XGH way which is exactly like the first one but faster. XGH is faster than any development process you know (see Axiom 14).

cilindrox

Abstraction Suggestions

Summary: use good/established messaging patterns like Enterprise Integration Patterns. Don't make up your own. Don't expose transport implementation details to your application.

Broker

As much as possible, I prefer to hide Rabbit's implementation details from my application. In .Net we have a Broker abstraction that can communicate through a lot of different transports (rabbit just happens to be our preferred one). The broker allows us to expose a very simple API which is basically:

• publish
• request
• start/stop subscription

cilindrox

/**
 * This will iterate up-to the sqrt of num 
 * in order to check if it can be written as 'nxn=axb'
 **/
public boolean isPrime(int num) {
  // check for even nums
  if (num % 2 == 0) return false;

  // http://stackoverflow.com/a/5813926
  for (int i = 3; i*i <= num ; i+=2) {