vbauerster

package main

import (
	"fmt"
	"sync"
)

func main() {
	var wg sync.WaitGroup
	done := make(chan struct{})

vbauerster

package main

import (
	"fmt"
	"time"
)

func main() {
	inch := make(chan int)
	outch := make(chan int)

vbauerster

package main

import "fmt"

type person struct {
	Name string
	Age  int
}

func main() {

vbauerster

package main

import (
	"fmt"
	"io/ioutil"
	"net/http"
)

func main() {
	responses := make(chan string, 3)

vbauerster

Keybase proof

I hereby claim:

• I am vbauerster on github.
• I am vbauerster (https://keybase.io/vbauerster) on keybase.
• I have a public key ASB3b2WsmEzM0zEf5anFdzxVWDr9H54XJK0hOntQZP7v_go

To claim this, I am signing this object:

vbauerster

" This must be first, because it changes other options as a side effect.
set nocompatible

" On Windows use '.vim' instead of 'vimfiles' to make sync easier
let s:ms_win = (has('win16') || has('win32') || has('win64'))
if s:ms_win
    set runtimepath=$HOME/.vim,$VIM/vimfiles,$VIMRUNTIME,$VIM/vimfiles/after,$HOME/.vim/after
    set shell=/bin/sh
endif

vbauerster

Set the Mac OS X SOCKS proxy on the command line

a.k.a. what to do when your ISP starts blocking sites :(

Set the SOCKS proxy to local SSH tunnel

networksetup -setsocksfirewallproxy "Ethernet" localhost 8080

To clear the domain and port

vbauerster

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

---

vbauerster

/**
 * 
 * Print From 45 to 4578 Without Repeating Digits 
 *
 * Write a method that prints all the numbers from 45 to 4578 to the console,
 * with the constraint that you cannot print any number with repeating digits.
 * This means the following numbers would be skipped: 11, 22, ...., 122, 110,.... 
 *
 * Created by vbauer on 19/04/14.
 */

vbauerster

 public int nextInt(int n) {
   if (n <= 0)
     throw new IllegalArgumentException("n must be positive");

   if ((n & -n) == n)  // i.e., n is a power of 2
     return (int)((n * (long)next(31)) >> 31);

   int bits, val;
   do {
       bits = next(31);